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.r043-smll-171620180200128.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 AutoFlight-PT-96a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 04:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 04:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 629K May 18 16:42 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 AutoFlight-PT-96a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-96a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716298381317

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=AutoFlight-PT-96a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 13:33:03] [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-21 13:33:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:33:04] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-05-21 13:33:04] [INFO ] Transformed 2251 places.
[2024-05-21 13:33:04] [INFO ] Transformed 2225 transitions.
[2024-05-21 13:33:04] [INFO ] Found NUPN structural information;
[2024-05-21 13:33:04] [INFO ] Parsed PT model containing 2251 places and 2225 transitions and 6914 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA AutoFlight-PT-96a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 373 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:33:05] [INFO ] Computed 514 invariants in 96 ms
[2024-05-21 13:33:07] [INFO ] Implicit Places using invariants in 2306 ms returned []
[2024-05-21 13:33:07] [INFO ] Invariant cache hit.
[2024-05-21 13:33:09] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 4261 ms to find 0 implicit places.
[2024-05-21 13:33:09] [INFO ] Invariant cache hit.
[2024-05-21 13:33:11] [INFO ] Dead Transitions using invariants and state equation in 2107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6749 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Support contains 47 out of 2251 places after structural reductions.
[2024-05-21 13:33:11] [INFO ] Flatten gal took : 318 ms
[2024-05-21 13:33:12] [INFO ] Flatten gal took : 158 ms
[2024-05-21 13:33:12] [INFO ] Input system was already deterministic with 1841 transitions.
Support contains 40 out of 2251 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 1040 ms. (steps per millisecond=9 ) properties (out of 30) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-21 13:33:13] [INFO ] Invariant cache hit.
[2024-05-21 13:33:15] [INFO ] [Real]Absence check using 513 positive place invariants in 179 ms returned sat
[2024-05-21 13:33:15] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 13:33:20] [INFO ] After 3983ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:19
[2024-05-21 13:33:20] [INFO ] State equation strengthened by 384 read => feed constraints.
[2024-05-21 13:33:20] [INFO ] After 265ms SMT Verify possible using 384 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-21 13:33:20] [INFO ] After 6890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-21 13:33:22] [INFO ] [Nat]Absence check using 513 positive place invariants in 186 ms returned sat
[2024-05-21 13:33:22] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-21 13:33:26] [INFO ] After 3981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2024-05-21 13:33:31] [INFO ] After 4381ms SMT Verify possible using 384 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2024-05-21 13:33:37] [INFO ] Deduced a trap composed of 1238 places in 860 ms of which 16 ms to minimize.
[2024-05-21 13:33:38] [INFO ] Deduced a trap composed of 1242 places in 853 ms of which 2 ms to minimize.
[2024-05-21 13:33:39] [INFO ] Deduced a trap composed of 1146 places in 874 ms of which 3 ms to minimize.
[2024-05-21 13:33:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3077 ms
[2024-05-21 13:33:40] [INFO ] Deduced a trap composed of 1262 places in 871 ms of which 3 ms to minimize.
[2024-05-21 13:33:41] [INFO ] Deduced a trap composed of 1267 places in 885 ms of which 2 ms to minimize.
[2024-05-21 13:33:42] [INFO ] Deduced a trap composed of 1266 places in 870 ms of which 1 ms to minimize.
[2024-05-21 13:33:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3144 ms
[2024-05-21 13:33:44] [INFO ] Deduced a trap composed of 1257 places in 782 ms of which 2 ms to minimize.
[2024-05-21 13:33:44] [INFO ] Deduced a trap composed of 1244 places in 758 ms of which 2 ms to minimize.
[2024-05-21 13:33:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1898 ms
[2024-05-21 13:33:48] [INFO ] Deduced a trap composed of 2 places in 2469 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 13:33:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-21 13:33:48] [INFO ] After 27488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 19 different solutions.
Finished Parikh walk after 309 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=25 )
Parikh walk visited 21 properties in 703 ms.
Computed a total of 169 stabilizing places and 1 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' '!(X((p0 U X(G(p1)))))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 225 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:33:49] [INFO ] Invariant cache hit.
[2024-05-21 13:33:51] [INFO ] Implicit Places using invariants in 1762 ms returned []
[2024-05-21 13:33:51] [INFO ] Invariant cache hit.
[2024-05-21 13:33:52] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 3525 ms to find 0 implicit places.
[2024-05-21 13:33:52] [INFO ] Invariant cache hit.
[2024-05-21 13:33:54] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5678 ms. Remains : 2251/2251 places, 1841/1841 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 317 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s838 1), p0:(EQ s855 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5289 steps with 19 reset in 261 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-00 finished in 6361 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(p0)||(F(X((X(p1) U p2)))&&G(p3)))))'
Support contains 4 out of 2251 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 132 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:33:55] [INFO ] Invariant cache hit.
[2024-05-21 13:33:57] [INFO ] Implicit Places using invariants in 1632 ms returned []
[2024-05-21 13:33:57] [INFO ] Invariant cache hit.
[2024-05-21 13:33:59] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
[2024-05-21 13:33:59] [INFO ] Invariant cache hit.
[2024-05-21 13:34:01] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6087 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND p3 (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p3 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p3:(EQ s533 1), p0:(AND (EQ s238 1) (EQ s1499 1)), p2:(AND (EQ s381 1) (EQ s238 1) (EQ s1499 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 166 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-01 finished in 6393 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 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 168 places and 0 transitions.
Drop transitions removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 904 rules applied. Total rules applied 904 place count 2082 transition count 1104
Reduce places removed 736 places and 0 transitions.
Iterating post reduction 1 with 736 rules applied. Total rules applied 1640 place count 1346 transition count 1104
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 1640 place count 1346 transition count 880
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 2184 place count 1026 transition count 880
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 2184 place count 1026 transition count 784
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 2376 place count 930 transition count 784
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 2664 place count 786 transition count 640
Applied a total of 2664 rules in 355 ms. Remains 786 /2251 variables (removed 1465) and now considering 640/1841 (removed 1201) transitions.
// Phase 1: matrix 640 rows 786 cols
[2024-05-21 13:34:02] [INFO ] Computed 250 invariants in 10 ms
[2024-05-21 13:34:03] [INFO ] Implicit Places using invariants in 1111 ms returned [313, 339, 353, 367, 393, 419, 433, 447, 451, 455, 459, 463, 467, 471, 475, 479, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 579, 583, 587, 591, 595, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 667, 671, 675, 679, 683, 687, 691, 695, 699, 703, 707, 711, 713, 715, 717, 719, 721, 723, 725, 727, 729, 731, 733, 735, 739, 743, 747, 751, 755, 759, 763, 767, 771, 775, 779, 783, 785]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1116 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 681/2251 places, 640/1841 transitions.
Graph (trivial) has 351 edges and 681 vertex of which 25 / 681 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 578 transition count 514
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 578 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 161 place count 577 transition count 513
Applied a total of 161 rules in 125 ms. Remains 577 /681 variables (removed 104) and now considering 513/640 (removed 127) transitions.
// Phase 1: matrix 513 rows 577 cols
[2024-05-21 13:34:03] [INFO ] Computed 145 invariants in 5 ms
[2024-05-21 13:34:03] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-21 13:34:03] [INFO ] Invariant cache hit.
[2024-05-21 13:34:04] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 577/2251 places, 513/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2898 ms. Remains : 577/2251 places, 513/1841 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-02 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 (EQ s100 1) (EQ s337 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 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-02 finished in 2961 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(G(p0))&&F(p1))))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 168 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:34:05] [INFO ] Computed 514 invariants in 22 ms
[2024-05-21 13:34:06] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2024-05-21 13:34:06] [INFO ] Invariant cache hit.
[2024-05-21 13:34:08] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
[2024-05-21 13:34:08] [INFO ] Invariant cache hit.
[2024-05-21 13:34:10] [INFO ] Dead Transitions using invariants and state equation in 2088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6032 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s322 1) (EQ s1389 1)), p1:(EQ s457 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-03 finished in 6229 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(p0))||G(p1)))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 151 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:34:11] [INFO ] Invariant cache hit.
[2024-05-21 13:34:13] [INFO ] Implicit Places using invariants in 1948 ms returned []
[2024-05-21 13:34:13] [INFO ] Invariant cache hit.
[2024-05-21 13:34:15] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
[2024-05-21 13:34:15] [INFO ] Invariant cache hit.
[2024-05-21 13:34:17] [INFO ] Dead Transitions using invariants and state equation in 2341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6421 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(AND (EQ s453 0) (EQ s819 0)), p1:(EQ s453 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7921 ms.
Product exploration explored 100000 steps with 33333 reset in 8094 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 22 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96a-LTLFireability-04 finished in 22754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 147 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:34:34] [INFO ] Invariant cache hit.
[2024-05-21 13:34:35] [INFO ] Implicit Places using invariants in 1916 ms returned []
[2024-05-21 13:34:35] [INFO ] Invariant cache hit.
[2024-05-21 13:34:37] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 3910 ms to find 0 implicit places.
[2024-05-21 13:34:37] [INFO ] Invariant cache hit.
[2024-05-21 13:34:40] [INFO ] Dead Transitions using invariants and state equation in 2302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6375 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s147 0) (EQ s1350 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15336 steps with 58 reset in 337 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-05 finished in 6831 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 U (p1||F(G(p1))))))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2251 transition count 1401
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 1811 transition count 1401
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 135 Pre rules applied. Total rules applied 880 place count 1811 transition count 1266
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 1150 place count 1676 transition count 1266
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 1438 place count 1532 transition count 1122
Applied a total of 1438 rules in 277 ms. Remains 1532 /2251 variables (removed 719) and now considering 1122/1841 (removed 719) transitions.
// Phase 1: matrix 1122 rows 1532 cols
[2024-05-21 13:34:40] [INFO ] Computed 514 invariants in 8 ms
[2024-05-21 13:34:42] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2024-05-21 13:34:42] [INFO ] Invariant cache hit.
[2024-05-21 13:34:43] [INFO ] State equation strengthened by 623 read => feed constraints.
[2024-05-21 13:35:13] [INFO ] Performed 441/1532 implicitness test of which 130 returned IMPLICIT in 30 seconds.
[2024-05-21 13:35:43] [INFO ] Performed 1348/1532 implicitness test of which 311 returned IMPLICIT in 60 seconds.
[2024-05-21 13:35:47] [INFO ] Implicit Places using invariants and state equation in 64832 ms returned [5, 10, 25, 30, 40, 55, 60, 65, 70, 100, 105, 115, 130, 135, 140, 150, 155, 165, 180, 185, 195, 205, 215, 225, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275, 280, 285, 290, 295, 300, 305, 310, 315, 320, 325, 330, 335, 340, 345, 350, 355, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 627, 701, 739, 777, 851, 925, 963, 1001, 1007, 1013, 1019, 1025, 1031, 1037, 1043, 1049, 1055, 1061, 1067, 1073, 1079, 1085, 1091, 1097, 1103, 1109, 1115, 1121, 1127, 1133, 1139, 1145, 1151, 1157, 1163, 1169, 1175, 1181, 1187, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253, 1259, 1265, 1271, 1277, 1283, 1289, 1293, 1297, 1301, 1305, 1309, 1313, 1317, 1321, 1325, 1329, 1333, 1337, 1343, 1349, 1355, 1361, 1367, 1373, 1379, 1385, 1391, 1397, 1403, 1409, 1413, 1417, 1421, 1425, 1429, 1433, 1437, 1441, 1445, 1449, 1453, 1463, 1469, 1475, 1481, 1487, 1493, 1499, 1505, 1511, 1517, 1523, 1529]
Discarding 345 places :
Implicit Place search using SMT with State Equation took 66352 ms to find 345 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1187/2251 places, 1122/1841 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1187 transition count 883
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 948 transition count 883
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 478 place count 948 transition count 727
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 790 place count 792 transition count 727
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 892 place count 690 transition count 625
Iterating global reduction 2 with 102 rules applied. Total rules applied 994 place count 690 transition count 625
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1016 place count 690 transition count 603
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1019 place count 687 transition count 600
Iterating global reduction 3 with 3 rules applied. Total rules applied 1022 place count 687 transition count 600
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1025 place count 684 transition count 597
Iterating global reduction 3 with 3 rules applied. Total rules applied 1028 place count 684 transition count 597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1031 place count 681 transition count 594
Iterating global reduction 3 with 3 rules applied. Total rules applied 1034 place count 681 transition count 594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1037 place count 678 transition count 591
Iterating global reduction 3 with 3 rules applied. Total rules applied 1040 place count 678 transition count 591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1043 place count 675 transition count 588
Iterating global reduction 3 with 3 rules applied. Total rules applied 1046 place count 675 transition count 588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1049 place count 672 transition count 585
Iterating global reduction 3 with 3 rules applied. Total rules applied 1052 place count 672 transition count 585
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1055 place count 669 transition count 582
Iterating global reduction 3 with 3 rules applied. Total rules applied 1058 place count 669 transition count 582
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1061 place count 666 transition count 579
Iterating global reduction 3 with 3 rules applied. Total rules applied 1064 place count 666 transition count 579
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1066 place count 664 transition count 577
Iterating global reduction 3 with 2 rules applied. Total rules applied 1068 place count 664 transition count 577
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1070 place count 662 transition count 575
Iterating global reduction 3 with 2 rules applied. Total rules applied 1072 place count 662 transition count 575
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1073 place count 661 transition count 574
Iterating global reduction 3 with 1 rules applied. Total rules applied 1074 place count 661 transition count 574
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1075 place count 660 transition count 573
Iterating global reduction 3 with 1 rules applied. Total rules applied 1076 place count 660 transition count 573
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1077 place count 659 transition count 572
Iterating global reduction 3 with 1 rules applied. Total rules applied 1078 place count 659 transition count 572
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1079 place count 658 transition count 571
Iterating global reduction 3 with 1 rules applied. Total rules applied 1080 place count 658 transition count 571
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1081 place count 657 transition count 570
Iterating global reduction 3 with 1 rules applied. Total rules applied 1082 place count 657 transition count 570
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1083 place count 656 transition count 569
Iterating global reduction 3 with 1 rules applied. Total rules applied 1084 place count 656 transition count 569
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1085 place count 655 transition count 568
Iterating global reduction 3 with 1 rules applied. Total rules applied 1086 place count 655 transition count 568
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1087 place count 654 transition count 567
Iterating global reduction 3 with 1 rules applied. Total rules applied 1088 place count 654 transition count 567
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1089 place count 653 transition count 566
Iterating global reduction 3 with 1 rules applied. Total rules applied 1090 place count 653 transition count 566
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1091 place count 652 transition count 565
Iterating global reduction 3 with 1 rules applied. Total rules applied 1092 place count 652 transition count 565
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1093 place count 651 transition count 564
Iterating global reduction 3 with 1 rules applied. Total rules applied 1094 place count 651 transition count 564
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1095 place count 650 transition count 563
Iterating global reduction 3 with 1 rules applied. Total rules applied 1096 place count 650 transition count 563
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1097 place count 649 transition count 562
Iterating global reduction 3 with 1 rules applied. Total rules applied 1098 place count 649 transition count 562
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1099 place count 648 transition count 561
Iterating global reduction 3 with 1 rules applied. Total rules applied 1100 place count 648 transition count 561
Applied a total of 1100 rules in 479 ms. Remains 648 /1187 variables (removed 539) and now considering 561/1122 (removed 561) transitions.
// Phase 1: matrix 561 rows 648 cols
[2024-05-21 13:35:47] [INFO ] Computed 169 invariants in 5 ms
[2024-05-21 13:35:48] [INFO ] Implicit Places using invariants in 623 ms returned [13, 18, 31, 40, 45, 66, 71, 76, 81, 86, 99, 108, 113, 130, 143, 152, 157, 170, 179, 188, 197, 647]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 626 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 626/2251 places, 561/1841 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 626 transition count 522
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 587 transition count 522
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 585 transition count 520
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 585 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 584 transition count 519
Applied a total of 84 rules in 44 ms. Remains 584 /626 variables (removed 42) and now considering 519/561 (removed 42) transitions.
// Phase 1: matrix 519 rows 584 cols
[2024-05-21 13:35:48] [INFO ] Computed 147 invariants in 4 ms
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-21 13:35:49] [INFO ] Invariant cache hit.
[2024-05-21 13:35:49] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-21 13:35:50] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 584/2251 places, 519/1841 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 69690 ms. Remains : 584/2251 places, 519/1841 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s290 1), p0:(AND (EQ s558 1) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-06 finished in 69834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F((p1||G(p2)))))))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 146 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:35:50] [INFO ] Computed 514 invariants in 12 ms
[2024-05-21 13:35:52] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-21 13:35:52] [INFO ] Invariant cache hit.
[2024-05-21 13:35:54] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2024-05-21 13:35:54] [INFO ] Invariant cache hit.
[2024-05-21 13:35:56] [INFO ] Dead Transitions using invariants and state equation in 2344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6016 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s485 1), p1:(EQ s412 0), p2:(EQ s412 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 252 steps with 0 reset in 10 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-09 finished in 6230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&X(p1)) U (p2&&X(G(!p0)))))))'
Support contains 4 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 144 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:35:56] [INFO ] Invariant cache hit.
[2024-05-21 13:35:58] [INFO ] Implicit Places using invariants in 1925 ms returned []
[2024-05-21 13:35:58] [INFO ] Invariant cache hit.
[2024-05-21 13:36:00] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 3885 ms to find 0 implicit places.
[2024-05-21 13:36:00] [INFO ] Invariant cache hit.
[2024-05-21 13:36:03] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6403 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) p0), (OR (NOT p2) (NOT p1) p0), true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(NEQ s110 1), p0:(EQ s16 1), p1:(AND (EQ s52 1) (EQ s1716 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 375 reset in 2173 ms.
Product exploration explored 100000 steps with 375 reset in 2634 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 243 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (OR (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96549 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96549 steps, saw 47167 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 13:36:12] [INFO ] Invariant cache hit.
[2024-05-21 13:36:12] [INFO ] [Real]Absence check using 513 positive place invariants in 185 ms returned sat
[2024-05-21 13:36:12] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 13:36:13] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 13:36:13] [INFO ] [Nat]Absence check using 513 positive place invariants in 176 ms returned sat
[2024-05-21 13:36:13] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 13:36:15] [INFO ] After 1429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 13:36:15] [INFO ] State equation strengthened by 384 read => feed constraints.
[2024-05-21 13:36:15] [INFO ] After 229ms SMT Verify possible using 384 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 13:36:16] [INFO ] After 898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 680 ms.
[2024-05-21 13:36:16] [INFO ] After 3812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 88 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0)))), (X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p0 (NOT p1))))))]
False Knowledge obtained : [(F (OR p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Property proved to be false thanks to negative knowledge :(F (OR p0 (NOT p2)))
Knowledge based reduction with 13 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96a-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96a-LTLFireability-10 finished in 20272 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 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2251 transition count 1401
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 1811 transition count 1401
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 880 place count 1811 transition count 1265
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 1152 place count 1675 transition count 1265
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 1438 place count 1532 transition count 1122
Applied a total of 1438 rules in 295 ms. Remains 1532 /2251 variables (removed 719) and now considering 1122/1841 (removed 719) transitions.
// Phase 1: matrix 1122 rows 1532 cols
[2024-05-21 13:36:17] [INFO ] Computed 514 invariants in 9 ms
[2024-05-21 13:36:42] [INFO ] Implicit Places using invariants in 24981 ms returned [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 116, 121, 126, 131, 136, 141, 146, 151, 156, 161, 166, 171, 176, 181, 186, 191, 196, 201, 206, 211, 216, 221, 226, 231, 236, 241, 246, 251, 256, 261, 266, 271, 276, 281, 286, 291, 296, 301, 306, 311, 316, 321, 326, 331, 336, 341, 346, 351, 356, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 627, 701, 739, 777, 851, 925, 963, 1001, 1007, 1013, 1019, 1025, 1031, 1037, 1043, 1049, 1055, 1061, 1067, 1073, 1079, 1085, 1091, 1097, 1103, 1109, 1115, 1121, 1127, 1133, 1139, 1145, 1151, 1157, 1163, 1169, 1175, 1181, 1187, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253, 1259, 1265, 1271, 1277, 1283, 1289, 1293, 1297, 1301, 1305, 1309, 1313, 1317, 1321, 1325, 1329, 1333, 1337, 1343, 1349, 1355, 1361, 1367, 1373, 1379, 1385, 1391, 1397, 1403, 1409, 1413, 1417, 1421, 1425, 1429, 1433, 1437, 1441, 1445, 1449, 1453, 1457, 1463, 1469, 1475, 1481, 1487, 1493, 1499, 1505, 1511, 1517, 1523, 1529, 1531]
Discarding 369 places :
Implicit Place search using SMT only with invariants took 24996 ms to find 369 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1163/2251 places, 1122/1841 transitions.
Graph (trivial) has 831 edges and 1163 vertex of which 73 / 1163 are part of one of the 1 SCC in 3 ms
Free SCC test removed 72 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 1091 transition count 595
Reduce places removed 432 places and 0 transitions.
Iterating post reduction 1 with 432 rules applied. Total rules applied 865 place count 659 transition count 595
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 944 place count 580 transition count 516
Iterating global reduction 2 with 79 rules applied. Total rules applied 1023 place count 580 transition count 516
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1025 place count 579 transition count 515
Applied a total of 1025 rules in 66 ms. Remains 579 /1163 variables (removed 584) and now considering 515/1122 (removed 607) transitions.
// Phase 1: matrix 515 rows 579 cols
[2024-05-21 13:36:42] [INFO ] Computed 145 invariants in 4 ms
[2024-05-21 13:36:42] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-21 13:36:42] [INFO ] Invariant cache hit.
[2024-05-21 13:36:43] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-21 13:36:44] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 579/2251 places, 515/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27425 ms. Remains : 579/2251 places, 515/1841 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s91 1) (NEQ s478 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 657 reset in 1034 ms.
Product exploration explored 100000 steps with 659 reset in 1177 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 380166 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380166 steps, saw 107873 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 13:36:49] [INFO ] Invariant cache hit.
[2024-05-21 13:36:50] [INFO ] [Real]Absence check using 145 positive place invariants in 40 ms returned sat
[2024-05-21 13:36:50] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 13:36:50] [INFO ] [Nat]Absence check using 145 positive place invariants in 40 ms returned sat
[2024-05-21 13:36:50] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 13:36:50] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-21 13:36:50] [INFO ] After 84ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 13:36:51] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 13:36:51] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 128 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 515/515 transitions.
Applied a total of 0 rules in 16 ms. Remains 579 /579 variables (removed 0) and now considering 515/515 (removed 0) transitions.
[2024-05-21 13:36:51] [INFO ] Invariant cache hit.
[2024-05-21 13:36:51] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-21 13:36:51] [INFO ] Invariant cache hit.
[2024-05-21 13:36:52] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-21 13:36:53] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-05-21 13:36:53] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-21 13:36:53] [INFO ] Invariant cache hit.
[2024-05-21 13:36:53] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2638 ms. Remains : 579/579 places, 515/515 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 4208 steps, including 28 resets, run visited all 1 properties in 41 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 653 reset in 957 ms.
Product exploration explored 100000 steps with 655 reset in 1049 ms.
Built C files in :
/tmp/ltsmin7264835993763717775
[2024-05-21 13:36:56] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2024-05-21 13:36:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:36:56] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2024-05-21 13:36:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:36:56] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2024-05-21 13:36:56] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:36:56] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7264835993763717775
Running compilation step : cd /tmp/ltsmin7264835993763717775;'/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 1985 ms.
Running link step : cd /tmp/ltsmin7264835993763717775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7264835993763717775;'/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/stateBased5360059014181377774.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 515/515 transitions.
Applied a total of 0 rules in 23 ms. Remains 579 /579 variables (removed 0) and now considering 515/515 (removed 0) transitions.
[2024-05-21 13:37:11] [INFO ] Invariant cache hit.
[2024-05-21 13:37:12] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-21 13:37:12] [INFO ] Invariant cache hit.
[2024-05-21 13:37:12] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-21 13:37:13] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2024-05-21 13:37:13] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-21 13:37:13] [INFO ] Invariant cache hit.
[2024-05-21 13:37:14] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2610 ms. Remains : 579/579 places, 515/515 transitions.
Built C files in :
/tmp/ltsmin15955608674370470988
[2024-05-21 13:37:14] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2024-05-21 13:37:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:37:14] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2024-05-21 13:37:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:37:14] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2024-05-21 13:37:14] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:37:14] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15955608674370470988
Running compilation step : cd /tmp/ltsmin15955608674370470988;'/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 1794 ms.
Running link step : cd /tmp/ltsmin15955608674370470988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15955608674370470988;'/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/stateBased15968099248804991143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:37:29] [INFO ] Flatten gal took : 27 ms
[2024-05-21 13:37:29] [INFO ] Flatten gal took : 27 ms
[2024-05-21 13:37:29] [INFO ] Time to serialize gal into /tmp/LTL18137679834688572991.gal : 8 ms
[2024-05-21 13:37:29] [INFO ] Time to serialize properties into /tmp/LTL8297610037243968294.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/LTL18137679834688572991.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7948952965593353604.hoa' '-atoms' '/tmp/LTL8297610037243968294.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8297610037243968294.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7948952965593353604.hoa
Detected timeout of ITS tools.
[2024-05-21 13:37:44] [INFO ] Flatten gal took : 31 ms
[2024-05-21 13:37:44] [INFO ] Flatten gal took : 21 ms
[2024-05-21 13:37:44] [INFO ] Time to serialize gal into /tmp/LTL3966606296093512091.gal : 4 ms
[2024-05-21 13:37:44] [INFO ] Time to serialize properties into /tmp/LTL3398044417149151899.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/LTL3966606296093512091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3398044417149151899.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p157!=1)||(p1806!=1))"))))
Formula 0 simplified : GF!"((p157!=1)||(p1806!=1))"
Detected timeout of ITS tools.
[2024-05-21 13:37:59] [INFO ] Flatten gal took : 22 ms
[2024-05-21 13:37:59] [INFO ] Applying decomposition
[2024-05-21 13:37:59] [INFO ] Flatten gal took : 29 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/graph10071974109724798213.txt' '-o' '/tmp/graph10071974109724798213.bin' '-w' '/tmp/graph10071974109724798213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10071974109724798213.bin' '-l' '-1' '-v' '-w' '/tmp/graph10071974109724798213.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:37:59] [INFO ] Decomposing Gal with order
[2024-05-21 13:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:38:00] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 13:38:00] [INFO ] Flatten gal took : 143 ms
[2024-05-21 13:38:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-21 13:38:00] [INFO ] Time to serialize gal into /tmp/LTL7819341404339211070.gal : 20 ms
[2024-05-21 13:38:00] [INFO ] Time to serialize properties into /tmp/LTL11834314492022111964.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7819341404339211070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11834314492022111964.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u44.p157!=1)||(i18.u45.p1806!=1))"))))
Formula 0 simplified : GF!"((i4.u44.p157!=1)||(i18.u45.p1806!=1))"
Reverse transition relation is NOT exact ! Due to transitions t745_t744_t743_t742_t741_t740_t739_t738_t737_t736_t735_t734_t733_t732_t731_t730_t729_t728_t72...714
Computing Next relation with stutter on 144 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8516285719236207958
[2024-05-21 13:38:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8516285719236207958
Running compilation step : cd /tmp/ltsmin8516285719236207958;'/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 1276 ms.
Running link step : cd /tmp/ltsmin8516285719236207958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8516285719236207958;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96a-LTLFireability-11 finished in 133357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||(G(p1)&&X(p2))))&&F(p2)))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 149 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:38:30] [INFO ] Computed 514 invariants in 11 ms
[2024-05-21 13:38:32] [INFO ] Implicit Places using invariants in 2122 ms returned []
[2024-05-21 13:38:32] [INFO ] Invariant cache hit.
[2024-05-21 13:38:34] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 4058 ms to find 0 implicit places.
[2024-05-21 13:38:34] [INFO ] Invariant cache hit.
[2024-05-21 13:38:37] [INFO ] Dead Transitions using invariants and state equation in 2571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6780 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1165 1), p1:(EQ s1165 0), p2:(OR (EQ s476 0) (EQ s1643 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 745 reset in 2192 ms.
Product exploration explored 100000 steps with 734 reset in 2506 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90508 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90508 steps, saw 46474 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 13:38:46] [INFO ] Invariant cache hit.
[2024-05-21 13:38:47] [INFO ] [Real]Absence check using 513 positive place invariants in 178 ms returned sat
[2024-05-21 13:38:47] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 13:38:49] [INFO ] After 1818ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2024-05-21 13:38:49] [INFO ] State equation strengthened by 384 read => feed constraints.
[2024-05-21 13:38:49] [INFO ] After 153ms SMT Verify possible using 384 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-21 13:38:49] [INFO ] After 2819ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-21 13:38:49] [INFO ] [Nat]Absence check using 513 positive place invariants in 182 ms returned sat
[2024-05-21 13:38:49] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 13:38:51] [INFO ] After 1844ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-21 13:38:52] [INFO ] After 311ms SMT Verify possible using 384 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-21 13:38:53] [INFO ] After 1205ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 355 ms.
[2024-05-21 13:38:53] [INFO ] After 4227ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 478 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 15 ms.
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2251 transition count 1404
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1814 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1813 transition count 1403
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 876 place count 1813 transition count 1267
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 1148 place count 1677 transition count 1267
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 1436 place count 1533 transition count 1123
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 1580 place count 1533 transition count 979
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 1724 place count 1389 transition count 979
Applied a total of 1724 rules in 372 ms. Remains 1389 /2251 variables (removed 862) and now considering 979/1841 (removed 862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 1389/2251 places, 979/1841 transitions.
Finished random walk after 824 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 311 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 143 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:38:54] [INFO ] Invariant cache hit.
[2024-05-21 13:38:56] [INFO ] Implicit Places using invariants in 1758 ms returned []
[2024-05-21 13:38:56] [INFO ] Invariant cache hit.
[2024-05-21 13:38:58] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 3838 ms to find 0 implicit places.
[2024-05-21 13:38:58] [INFO ] Invariant cache hit.
[2024-05-21 13:39:01] [INFO ] Dead Transitions using invariants and state equation in 2485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6469 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 99910 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99910 steps, saw 47612 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:39:04] [INFO ] Invariant cache hit.
[2024-05-21 13:39:05] [INFO ] [Real]Absence check using 513 positive place invariants in 185 ms returned sat
[2024-05-21 13:39:05] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-21 13:39:07] [INFO ] After 1865ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2024-05-21 13:39:07] [INFO ] State equation strengthened by 384 read => feed constraints.
[2024-05-21 13:39:07] [INFO ] After 160ms SMT Verify possible using 384 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 13:39:07] [INFO ] After 2877ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 13:39:08] [INFO ] [Nat]Absence check using 513 positive place invariants in 180 ms returned sat
[2024-05-21 13:39:08] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 13:39:10] [INFO ] After 1534ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 13:39:10] [INFO ] After 315ms SMT Verify possible using 384 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 13:39:11] [INFO ] After 1219ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-21 13:39:11] [INFO ] After 3875ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 282 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 41 ms.
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2251 transition count 1404
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1814 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1813 transition count 1403
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 876 place count 1813 transition count 1267
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 1148 place count 1677 transition count 1267
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 1436 place count 1533 transition count 1123
Free-agglomeration rule applied 144 times.
Iterating global reduction 3 with 144 rules applied. Total rules applied 1580 place count 1533 transition count 979
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 1724 place count 1389 transition count 979
Applied a total of 1724 rules in 371 ms. Remains 1389 /2251 variables (removed 862) and now considering 979/1841 (removed 862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 1389/2251 places, 979/1841 transitions.
Finished random walk after 74 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 385 reset in 2082 ms.
Product exploration explored 100000 steps with 379 reset in 2431 ms.
Built C files in :
/tmp/ltsmin3899649076325537581
[2024-05-21 13:39:17] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3899649076325537581
Running compilation step : cd /tmp/ltsmin3899649076325537581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3899649076325537581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3899649076325537581;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 142 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:39:20] [INFO ] Invariant cache hit.
[2024-05-21 13:39:22] [INFO ] Implicit Places using invariants in 1996 ms returned []
[2024-05-21 13:39:22] [INFO ] Invariant cache hit.
[2024-05-21 13:39:24] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 3650 ms to find 0 implicit places.
[2024-05-21 13:39:24] [INFO ] Invariant cache hit.
[2024-05-21 13:39:26] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5654 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Built C files in :
/tmp/ltsmin4072208716530604241
[2024-05-21 13:39:26] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4072208716530604241
Running compilation step : cd /tmp/ltsmin4072208716530604241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4072208716530604241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4072208716530604241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 13:39:29] [INFO ] Flatten gal took : 100 ms
[2024-05-21 13:39:29] [INFO ] Flatten gal took : 98 ms
[2024-05-21 13:39:29] [INFO ] Time to serialize gal into /tmp/LTL16208231534692901438.gal : 11 ms
[2024-05-21 13:39:29] [INFO ] Time to serialize properties into /tmp/LTL15152905570422891238.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16208231534692901438.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6359897879295192257.hoa' '-atoms' '/tmp/LTL15152905570422891238.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/LTL15152905570422891238.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6359897879295192257.hoa
Detected timeout of ITS tools.
[2024-05-21 13:39:44] [INFO ] Flatten gal took : 90 ms
[2024-05-21 13:39:44] [INFO ] Flatten gal took : 88 ms
[2024-05-21 13:39:44] [INFO ] Time to serialize gal into /tmp/LTL7498549613488856266.gal : 25 ms
[2024-05-21 13:39:44] [INFO ] Time to serialize properties into /tmp/LTL15446218575347622365.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/LTL7498549613488856266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15446218575347622365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(("(p1165==1)")||((G("(p1165==0)"))&&(X("((p476==0)||(p1643==0))")))))&&(F("((p476==0)||(p1643==0))"))))
Formula 0 simplified : G(!"(p1165==1)" & (F!"(p1165==0)" | X!"((p476==0)||(p1643==0))")) | G!"((p476==0)||(p1643==0))"
Detected timeout of ITS tools.
[2024-05-21 13:40:00] [INFO ] Flatten gal took : 89 ms
[2024-05-21 13:40:00] [INFO ] Applying decomposition
[2024-05-21 13:40:00] [INFO ] Flatten gal took : 86 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/graph17391662723536897340.txt' '-o' '/tmp/graph17391662723536897340.bin' '-w' '/tmp/graph17391662723536897340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17391662723536897340.bin' '-l' '-1' '-v' '-w' '/tmp/graph17391662723536897340.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:40:00] [INFO ] Decomposing Gal with order
[2024-05-21 13:40:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:40:00] [INFO ] Removed a total of 142 redundant transitions.
[2024-05-21 13:40:01] [INFO ] Flatten gal took : 174 ms
[2024-05-21 13:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 54 ms.
[2024-05-21 13:40:01] [INFO ] Time to serialize gal into /tmp/LTL447270657157836854.gal : 58 ms
[2024-05-21 13:40:01] [INFO ] Time to serialize properties into /tmp/LTL17391429232414505330.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/LTL447270657157836854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17391429232414505330.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 : !(((F(("(i43.u477.p1165==1)")||((G("(i43.u477.p1165==0)"))&&(X("((i35.u515.p476==0)||(i35.u687.p1643==0))")))))&&(F("((i35.u515.p476==...184
Formula 0 simplified : G(!"(i43.u477.p1165==1)" & (F!"(i43.u477.p1165==0)" | X!"((i35.u515.p476==0)||(i35.u687.p1643==0))")) | G!"((i35.u515.p476==0)||(i35...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13657736653172503953
[2024-05-21 13:40:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13657736653172503953
Running compilation step : cd /tmp/ltsmin13657736653172503953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13657736653172503953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13657736653172503953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-96a-LTLFireability-12 finished in 108951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(p1||F(p2))))))'
Support contains 5 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 145 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:40:19] [INFO ] Invariant cache hit.
[2024-05-21 13:40:21] [INFO ] Implicit Places using invariants in 1929 ms returned []
[2024-05-21 13:40:21] [INFO ] Invariant cache hit.
[2024-05-21 13:40:22] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2024-05-21 13:40:22] [INFO ] Invariant cache hit.
[2024-05-21 13:40:24] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5630 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s828 1), p1:(AND (EQ s705 1) (EQ s2073 1)), p2:(AND (EQ s718 1) (EQ s2102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-14 finished in 5811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1) U (X(X(X(F(p2)))) U X(p2))))))'
Support contains 4 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 168 places and 0 transitions.
Drop transitions removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 901 rules applied. Total rules applied 901 place count 2082 transition count 1107
Reduce places removed 733 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 734 rules applied. Total rules applied 1635 place count 1349 transition count 1106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1636 place count 1348 transition count 1106
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 1636 place count 1348 transition count 882
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 2180 place count 1028 transition count 882
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 2180 place count 1028 transition count 786
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 2372 place count 932 transition count 786
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 2658 place count 789 transition count 643
Applied a total of 2658 rules in 166 ms. Remains 789 /2251 variables (removed 1462) and now considering 643/1841 (removed 1198) transitions.
// Phase 1: matrix 643 rows 789 cols
[2024-05-21 13:40:25] [INFO ] Computed 250 invariants in 4 ms
[2024-05-21 13:40:26] [INFO ] Implicit Places using invariants in 795 ms returned [314, 340, 354, 368, 394, 420, 434, 450, 454, 458, 462, 466, 470, 474, 478, 482, 486, 490, 494, 498, 502, 506, 510, 514, 518, 522, 526, 530, 534, 538, 542, 546, 550, 554, 558, 562, 566, 570, 574, 578, 582, 586, 590, 594, 598, 602, 606, 610, 614, 618, 622, 626, 630, 634, 638, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 670, 674, 678, 682, 686, 690, 694, 698, 702, 706, 710, 714, 716, 718, 720, 722, 724, 726, 728, 730, 732, 734, 736, 738, 742, 746, 750, 754, 758, 762, 766, 770, 774, 778, 782, 786, 788]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 800 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 684/2251 places, 643/1841 transitions.
Graph (trivial) has 351 edges and 684 vertex of which 25 / 684 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 660 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 659 transition count 595
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 81 place count 581 transition count 517
Iterating global reduction 2 with 78 rules applied. Total rules applied 159 place count 581 transition count 517
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 580 transition count 516
Applied a total of 161 rules in 43 ms. Remains 580 /684 variables (removed 104) and now considering 516/643 (removed 127) transitions.
// Phase 1: matrix 516 rows 580 cols
[2024-05-21 13:40:26] [INFO ] Computed 145 invariants in 4 ms
[2024-05-21 13:40:26] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-21 13:40:26] [INFO ] Invariant cache hit.
[2024-05-21 13:40:27] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/2251 places, 516/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2405 ms. Remains : 580/2251 places, 516/1841 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s421 1), p0:(NEQ s25 1), p2:(AND (EQ s41 1) (EQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLFireability-15 finished in 2755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||(G(p1)&&X(p2))))&&F(p2)))'
Found a Shortening insensitive property : AutoFlight-PT-96a-LTLFireability-12
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2251 transition count 1404
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1814 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1813 transition count 1403
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 876 place count 1813 transition count 1267
Deduced a syphon composed of 136 places in 2 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 1148 place count 1677 transition count 1267
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 1436 place count 1533 transition count 1123
Applied a total of 1436 rules in 266 ms. Remains 1533 /2251 variables (removed 718) and now considering 1123/1841 (removed 718) transitions.
// Phase 1: matrix 1123 rows 1533 cols
[2024-05-21 13:40:28] [INFO ] Computed 514 invariants in 7 ms
[2024-05-21 13:40:54] [INFO ] Implicit Places using invariants in 25527 ms returned [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275, 280, 285, 290, 295, 300, 305, 310, 315, 320, 325, 330, 335, 345, 350, 355, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 626, 700, 738, 778, 852, 926, 964, 1002, 1008, 1014, 1020, 1026, 1032, 1038, 1044, 1050, 1056, 1062, 1068, 1074, 1080, 1086, 1092, 1098, 1104, 1110, 1116, 1122, 1128, 1134, 1140, 1146, 1152, 1158, 1164, 1170, 1176, 1182, 1188, 1194, 1200, 1206, 1212, 1218, 1224, 1230, 1236, 1242, 1248, 1254, 1260, 1266, 1272, 1278, 1284, 1290, 1294, 1298, 1302, 1306, 1310, 1314, 1318, 1322, 1326, 1330, 1334, 1338, 1344, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1398, 1404, 1410, 1414, 1418, 1422, 1426, 1430, 1434, 1438, 1442, 1446, 1450, 1454, 1458, 1464, 1470, 1476, 1482, 1488, 1494, 1500, 1506, 1512, 1518, 1524, 1530, 1532]
Discarding 368 places :
Implicit Place search using SMT only with invariants took 25536 ms to find 368 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1165/2251 places, 1123/1841 transitions.
Graph (trivial) has 827 edges and 1165 vertex of which 73 / 1165 are part of one of the 1 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 423 place count 1093 transition count 606
Reduce places removed 422 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 671 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 847 place count 670 transition count 605
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 847 place count 670 transition count 600
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 857 place count 665 transition count 600
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 935 place count 587 transition count 522
Iterating global reduction 3 with 78 rules applied. Total rules applied 1013 place count 587 transition count 522
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1015 place count 586 transition count 521
Applied a total of 1015 rules in 57 ms. Remains 586 /1165 variables (removed 579) and now considering 521/1123 (removed 602) transitions.
// Phase 1: matrix 521 rows 586 cols
[2024-05-21 13:40:54] [INFO ] Computed 146 invariants in 3 ms
[2024-05-21 13:40:54] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-21 13:40:54] [INFO ] Invariant cache hit.
[2024-05-21 13:40:55] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 13:40:56] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 586/2251 places, 521/1841 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 27861 ms. Remains : 586/2251 places, 521/1841 transitions.
Running random walk in product with property : AutoFlight-PT-96a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s350 1), p1:(EQ s350 0), p2:(OR (EQ s273 0) (EQ s427 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1302 reset in 954 ms.
Product exploration explored 100000 steps with 1296 reset in 1037 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:40:58] [INFO ] Invariant cache hit.
[2024-05-21 13:40:58] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 13:40:59] [INFO ] [Nat]Absence check using 146 positive place invariants in 40 ms returned sat
[2024-05-21 13:40:59] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 13:40:59] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 13:40:59] [INFO ] After 84ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 13:40:59] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 13:40:59] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 521/521 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 586 transition count 520
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 586 transition count 519
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 585 transition count 519
Free-agglomeration rule applied 224 times.
Iterating global reduction 1 with 224 rules applied. Total rules applied 227 place count 585 transition count 295
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 451 place count 361 transition count 295
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 454 place count 358 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 457 place count 358 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 458 place count 357 transition count 291
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t985.t379.t744.t743.t742.t741.t740.t739.t738.t737.t736.t735.t734.t733.t732.t731.t730.t729.t728.t727.t726.t725.t724.t723.t722.t721.t1392.t1391.t1390.t1389.t1388.t1387.t1386.t1385.t1384.t1383.t1382.t1381.t1380.t1379.t1378.t1377.t1376.t1375.t1374.t1373.t1372.t1371.t1370.t1369.t1368.t1367.t1366.t1365.t1364.t1363.t1362.t1361.t1360.t1359.t1358.t1357.t1356.t1355.t1354.t1353.t1352.t1351.t1350.t1349.t1348.t1347.t1346.t1345.t720.t719.t718.t717.t716.t715.t714.t713.t712.t711.t710.t709.t708.t707.t706.t705.t704.t703.t702.t701.t700.t699.t698.t697.t1685 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 287 edges and 211 vertex of which 196 / 211 are part of one of the 1 SCC in 0 ms
Free SCC test removed 195 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 474 place count 16 transition count 276
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 273 transitions
Reduce isomorphic transitions removed 273 transitions.
Iterating post reduction 3 with 286 rules applied. Total rules applied 760 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 760 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 762 place count 2 transition count 2
Applied a total of 762 rules in 47 ms. Remains 2 /586 variables (removed 584) and now considering 2/521 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 2/586 places, 2/521 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 395 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 521/521 transitions.
Applied a total of 0 rules in 12 ms. Remains 586 /586 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-21 13:41:00] [INFO ] Invariant cache hit.
[2024-05-21 13:41:00] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-21 13:41:00] [INFO ] Invariant cache hit.
[2024-05-21 13:41:01] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 13:41:02] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-05-21 13:41:02] [INFO ] Invariant cache hit.
[2024-05-21 13:41:02] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2655 ms. Remains : 586/586 places, 521/521 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 13:41:03] [INFO ] Invariant cache hit.
[2024-05-21 13:41:03] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 13:41:03] [INFO ] [Nat]Absence check using 146 positive place invariants in 41 ms returned sat
[2024-05-21 13:41:04] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 13:41:04] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 13:41:04] [INFO ] After 81ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 13:41:04] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 13:41:04] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 521/521 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 586 transition count 520
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 586 transition count 519
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 585 transition count 519
Free-agglomeration rule applied 224 times.
Iterating global reduction 1 with 224 rules applied. Total rules applied 227 place count 585 transition count 295
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 451 place count 361 transition count 295
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 454 place count 358 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 457 place count 358 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 458 place count 357 transition count 291
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t985.t379.t744.t743.t742.t741.t740.t739.t738.t737.t736.t735.t734.t733.t732.t731.t730.t729.t728.t727.t726.t725.t724.t723.t722.t721.t1392.t1391.t1390.t1389.t1388.t1387.t1386.t1385.t1384.t1383.t1382.t1381.t1380.t1379.t1378.t1377.t1376.t1375.t1374.t1373.t1372.t1371.t1370.t1369.t1368.t1367.t1366.t1365.t1364.t1363.t1362.t1361.t1360.t1359.t1358.t1357.t1356.t1355.t1354.t1353.t1352.t1351.t1350.t1349.t1348.t1347.t1346.t1345.t720.t719.t718.t717.t716.t715.t714.t713.t712.t711.t710.t709.t708.t707.t706.t705.t704.t703.t702.t701.t700.t699.t698.t697.t1685 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 287 edges and 211 vertex of which 196 / 211 are part of one of the 1 SCC in 1 ms
Free SCC test removed 195 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 474 place count 16 transition count 276
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 273 transitions
Reduce isomorphic transitions removed 273 transitions.
Iterating post reduction 3 with 286 rules applied. Total rules applied 760 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 760 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 762 place count 2 transition count 2
Applied a total of 762 rules in 43 ms. Remains 2 /586 variables (removed 584) and now considering 2/521 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 2/586 places, 2/521 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 659 reset in 915 ms.
Product exploration explored 100000 steps with 656 reset in 1020 ms.
Built C files in :
/tmp/ltsmin6464208608587567818
[2024-05-21 13:41:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6464208608587567818
Running compilation step : cd /tmp/ltsmin6464208608587567818;'/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 1273 ms.
Running link step : cd /tmp/ltsmin6464208608587567818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6464208608587567818;'/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/stateBased9311170498417332265.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 521/521 transitions.
Applied a total of 0 rules in 11 ms. Remains 586 /586 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2024-05-21 13:41:22] [INFO ] Invariant cache hit.
[2024-05-21 13:41:22] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-21 13:41:22] [INFO ] Invariant cache hit.
[2024-05-21 13:41:22] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-21 13:41:24] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-05-21 13:41:24] [INFO ] Invariant cache hit.
[2024-05-21 13:41:24] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2383 ms. Remains : 586/586 places, 521/521 transitions.
Built C files in :
/tmp/ltsmin10027196882773119511
[2024-05-21 13:41:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10027196882773119511
Running compilation step : cd /tmp/ltsmin10027196882773119511;'/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 1381 ms.
Running link step : cd /tmp/ltsmin10027196882773119511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10027196882773119511;'/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/stateBased8027442694679614629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:41:39] [INFO ] Flatten gal took : 16 ms
[2024-05-21 13:41:39] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:41:39] [INFO ] Time to serialize gal into /tmp/LTL11834753829599936976.gal : 6 ms
[2024-05-21 13:41:39] [INFO ] Time to serialize properties into /tmp/LTL9359078364274939817.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11834753829599936976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12495449098513810405.hoa' '-atoms' '/tmp/LTL9359078364274939817.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/LTL9359078364274939817.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12495449098513810405.hoa
Detected timeout of ITS tools.
[2024-05-21 13:41:54] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:41:54] [INFO ] Flatten gal took : 17 ms
[2024-05-21 13:41:54] [INFO ] Time to serialize gal into /tmp/LTL7518019550879745891.gal : 4 ms
[2024-05-21 13:41:54] [INFO ] Time to serialize properties into /tmp/LTL9682462517779307311.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/LTL7518019550879745891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9682462517779307311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(("(p1165==1)")||((G("(p1165==0)"))&&(X("((p476==0)||(p1643==0))")))))&&(F("((p476==0)||(p1643==0))"))))
Formula 0 simplified : G(!"(p1165==1)" & (F!"(p1165==0)" | X!"((p476==0)||(p1643==0))")) | G!"((p476==0)||(p1643==0))"
Detected timeout of ITS tools.
[2024-05-21 13:42:09] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:42:09] [INFO ] Applying decomposition
[2024-05-21 13:42:09] [INFO ] Flatten gal took : 14 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/graph10658983109290601019.txt' '-o' '/tmp/graph10658983109290601019.bin' '-w' '/tmp/graph10658983109290601019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10658983109290601019.bin' '-l' '-1' '-v' '-w' '/tmp/graph10658983109290601019.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:42:09] [INFO ] Decomposing Gal with order
[2024-05-21 13:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:42:09] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 13:42:09] [INFO ] Flatten gal took : 39 ms
[2024-05-21 13:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 19 ms.
[2024-05-21 13:42:10] [INFO ] Time to serialize gal into /tmp/LTL1396912305572956553.gal : 11 ms
[2024-05-21 13:42:10] [INFO ] Time to serialize properties into /tmp/LTL14259253257934434400.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/LTL1396912305572956553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14259253257934434400.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(("(i19.u167.p1165==1)")||((G("(i19.u167.p1165==0)"))&&(X("((i19.u197.p476==0)||(i19.u198.p1643==0))")))))&&(F("((i19.u197.p476==...184
Formula 0 simplified : G(!"(i19.u167.p1165==1)" & (F!"(i19.u167.p1165==0)" | X!"((i19.u197.p476==0)||(i19.u198.p1643==0))")) | G!"((i19.u197.p476==0)||(i19...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 144 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
173 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.90051,61280,1,0,27475,95970,4363,50608,2812,421321,33426
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property AutoFlight-PT-96a-LTLFireability-12 finished in 104238 ms.
FORMULA AutoFlight-PT-96a-LTLFireability-12 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-21 13:42:12] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4128214063032476595
[2024-05-21 13:42:12] [INFO ] Too many transitions (1841) to apply POR reductions. Disabling POR matrices.
[2024-05-21 13:42:12] [INFO ] Applying decomposition
[2024-05-21 13:42:12] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4128214063032476595
Running compilation step : cd /tmp/ltsmin4128214063032476595;'/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'
[2024-05-21 13:42:12] [INFO ] Flatten gal took : 74 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/graph9138397346757912626.txt' '-o' '/tmp/graph9138397346757912626.bin' '-w' '/tmp/graph9138397346757912626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9138397346757912626.bin' '-l' '-1' '-v' '-w' '/tmp/graph9138397346757912626.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:42:12] [INFO ] Decomposing Gal with order
[2024-05-21 13:42:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:42:12] [INFO ] Removed a total of 145 redundant transitions.
[2024-05-21 13:42:12] [INFO ] Flatten gal took : 132 ms
[2024-05-21 13:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 51 ms.
[2024-05-21 13:42:13] [INFO ] Time to serialize gal into /tmp/LTLFireability10060010434663151819.gal : 24 ms
[2024-05-21 13:42:13] [INFO ] Time to serialize properties into /tmp/LTLFireability2271016785657157960.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/LTLFireability10060010434663151819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2271016785657157960.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 : !((F(G("((i2.u50.p157!=1)||(i2.u752.p1806!=1))"))))
Formula 0 simplified : GF!"((i2.u50.p157!=1)||(i2.u752.p1806!=1))"
Compilation finished in 7278 ms.
Running link step : cd /tmp/ltsmin4128214063032476595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4128214063032476595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 14:05:15] [INFO ] Applying decomposition
[2024-05-21 14:05:15] [INFO ] Flatten gal took : 102 ms
[2024-05-21 14:05:15] [INFO ] Decomposing Gal with order
[2024-05-21 14:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:05:16] [INFO ] Removed a total of 422 redundant transitions.
[2024-05-21 14:05:16] [INFO ] Flatten gal took : 140 ms
[2024-05-21 14:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 288 labels/synchronizations in 84 ms.
[2024-05-21 14:05:16] [INFO ] Time to serialize gal into /tmp/LTLFireability14623629745715547151.gal : 18 ms
[2024-05-21 14:05:16] [INFO ] Time to serialize properties into /tmp/LTLFireability2936990776654049118.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14623629745715547151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2936990776654049118.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 : !((F(G("((u67.p157!=1)||(u439.p1806!=1))"))))
Formula 0 simplified : GF!"((u67.p157!=1)||(u439.p1806!=1))"
Detected timeout of ITS tools.
[2024-05-21 14:28:20] [INFO ] Flatten gal took : 225 ms
[2024-05-21 14:28:20] [INFO ] Input system was already deterministic with 1841 transitions.
[2024-05-21 14:28:20] [INFO ] Transformed 2251 places.
[2024-05-21 14:28:20] [INFO ] Transformed 1841 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-21 14:28:21] [INFO ] Time to serialize gal into /tmp/LTLFireability13352545604811544040.gal : 25 ms
[2024-05-21 14:28:21] [INFO ] Time to serialize properties into /tmp/LTLFireability2258265022246488370.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/LTLFireability13352545604811544040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2258265022246488370.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p157!=1)||(p1806!=1))"))))
Formula 0 simplified : GF!"((p157!=1)||(p1806!=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10840448 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037848 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="AutoFlight-PT-96a"
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 AutoFlight-PT-96a, 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 r043-smll-171620180200128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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