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.r026-smll-171620167100163.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 itstools
Input is AutoFlight-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 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 266K 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-12b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716275770130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 07:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:16:12] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-21 07:16:12] [INFO ] Transformed 1126 places.
[2024-05-21 07:16:12] [INFO ] Transformed 1124 transitions.
[2024-05-21 07:16:12] [INFO ] Found NUPN structural information;
[2024-05-21 07:16:12] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-12b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 153 places :
Symmetric choice reduction at 0 with 153 rule applications. Total rules 153 place count 973 transition count 971
Iterating global reduction 0 with 153 rules applied. Total rules applied 306 place count 973 transition count 971
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 330 place count 973 transition count 947
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 396 place count 907 transition count 881
Iterating global reduction 1 with 66 rules applied. Total rules applied 462 place count 907 transition count 881
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 474 place count 895 transition count 869
Iterating global reduction 1 with 12 rules applied. Total rules applied 486 place count 895 transition count 869
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 497 place count 884 transition count 858
Iterating global reduction 1 with 11 rules applied. Total rules applied 508 place count 884 transition count 858
Applied a total of 508 rules in 939 ms. Remains 884 /1126 variables (removed 242) and now considering 858/1124 (removed 266) transitions.
// Phase 1: matrix 858 rows 884 cols
[2024-05-21 07:16:13] [INFO ] Computed 76 invariants in 43 ms
[2024-05-21 07:16:14] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2024-05-21 07:16:14] [INFO ] Invariant cache hit.
[2024-05-21 07:16:16] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2024-05-21 07:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/883 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (OVERLAPS) 1/884 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/1742 variables, and 76 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/884 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/883 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (OVERLAPS) 1/884 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 857 unsolved
[2024-05-21 07:17:08] [INFO ] Deduced a trap composed of 104 places in 1236 ms of which 145 ms to minimize.
[2024-05-21 07:17:09] [INFO ] Deduced a trap composed of 35 places in 846 ms of which 14 ms to minimize.
[2024-05-21 07:17:10] [INFO ] Deduced a trap composed of 97 places in 1010 ms of which 14 ms to minimize.
[2024-05-21 07:17:11] [INFO ] Deduced a trap composed of 16 places in 1005 ms of which 14 ms to minimize.
[2024-05-21 07:17:12] [INFO ] Deduced a trap composed of 104 places in 1014 ms of which 14 ms to minimize.
[2024-05-21 07:17:13] [INFO ] Deduced a trap composed of 19 places in 1004 ms of which 14 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 113 places in 905 ms of which 14 ms to minimize.
[2024-05-21 07:17:14] [INFO ] Deduced a trap composed of 103 places in 729 ms of which 10 ms to minimize.
[2024-05-21 07:17:15] [INFO ] Deduced a trap composed of 109 places in 758 ms of which 11 ms to minimize.
[2024-05-21 07:17:16] [INFO ] Deduced a trap composed of 99 places in 633 ms of which 10 ms to minimize.
[2024-05-21 07:17:17] [INFO ] Deduced a trap composed of 21 places in 760 ms of which 12 ms to minimize.
SMT process timed out in 60873ms, After SMT, problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Starting structural reductions in LTL mode, iteration 1 : 884/1126 places, 858/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64590 ms. Remains : 884/1126 places, 858/1124 transitions.
Support contains 26 out of 884 places after structural reductions.
[2024-05-21 07:17:17] [INFO ] Flatten gal took : 191 ms
[2024-05-21 07:17:17] [INFO ] Flatten gal took : 88 ms
[2024-05-21 07:17:18] [INFO ] Input system was already deterministic with 858 transitions.
RANDOM walk for 40000 steps (72 resets) in 1819 ms. (21 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
[2024-05-21 07:17:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 289/299 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 524/823 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 61/884 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 858/1742 variables, 884/960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1742 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1742 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1742/1742 variables, and 960 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1318 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 289/299 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 524/823 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 07:17:20] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 61/884 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 07:17:21] [INFO ] Deduced a trap composed of 21 places in 459 ms of which 9 ms to minimize.
[2024-05-21 07:17:22] [INFO ] Deduced a trap composed of 118 places in 370 ms of which 5 ms to minimize.
[2024-05-21 07:17:22] [INFO ] Deduced a trap composed of 116 places in 376 ms of which 8 ms to minimize.
[2024-05-21 07:17:22] [INFO ] Deduced a trap composed of 141 places in 374 ms of which 11 ms to minimize.
[2024-05-21 07:17:23] [INFO ] Deduced a trap composed of 144 places in 315 ms of which 5 ms to minimize.
[2024-05-21 07:17:23] [INFO ] Deduced a trap composed of 54 places in 327 ms of which 6 ms to minimize.
[2024-05-21 07:17:23] [INFO ] Deduced a trap composed of 134 places in 272 ms of which 5 ms to minimize.
[2024-05-21 07:17:24] [INFO ] Deduced a trap composed of 151 places in 272 ms of which 5 ms to minimize.
[2024-05-21 07:17:24] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 858/1742 variables, 884/970 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1742 variables, 5/975 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/1742 variables, and 975 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 884/884 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 6348ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 858/858 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 309 transitions
Trivial Post-agglo rules discarded 309 transitions
Performed 309 trivial Post agglomeration. Transition count delta: 309
Iterating post reduction 0 with 309 rules applied. Total rules applied 309 place count 884 transition count 549
Reduce places removed 309 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 342 rules applied. Total rules applied 651 place count 575 transition count 516
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 676 place count 553 transition count 513
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 681 place count 550 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 682 place count 549 transition count 511
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 105 Pre rules applied. Total rules applied 682 place count 549 transition count 406
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 5 with 210 rules applied. Total rules applied 892 place count 444 transition count 406
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 895 place count 441 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 898 place count 441 transition count 403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 898 place count 441 transition count 401
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 902 place count 439 transition count 401
Performed 168 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 5 with 336 rules applied. Total rules applied 1238 place count 271 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1239 place count 271 transition count 209
Free-agglomeration rule applied 48 times.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1287 place count 271 transition count 161
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1335 place count 223 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1336 place count 222 transition count 160
Reduce places removed 55 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 7 with 145 rules applied. Total rules applied 1481 place count 167 transition count 70
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 91 rules applied. Total rules applied 1572 place count 77 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1573 place count 76 transition count 69
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 1573 place count 76 transition count 51
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1609 place count 58 transition count 51
Applied a total of 1609 rules in 234 ms. Remains 58 /884 variables (removed 826) and now considering 51/858 (removed 807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 58/884 places, 51/858 transitions.
RANDOM walk for 262 steps (0 resets) in 23 ms. (10 steps per ms) remains 0/5 properties
Computed a total of 218 stabilizing places and 218 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(!p1)||(!p1&&F(!p2)))))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 324 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 07:17:26] [INFO ] Computed 76 invariants in 13 ms
[2024-05-21 07:17:26] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-21 07:17:26] [INFO ] Invariant cache hit.
[2024-05-21 07:17:27] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-21 07:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30278ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32380 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 434 ms :[true, p2, (AND (NOT p0) p1), (AND p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-02 finished in 32924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 88 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 07:17:58] [INFO ] Computed 76 invariants in 12 ms
[2024-05-21 07:17:59] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-21 07:17:59] [INFO ] Invariant cache hit.
[2024-05-21 07:18:00] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-21 07:18:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1722 variables, and 76 constraints, problems are : Problem set: 0 solved, 847 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 847/847 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 847 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-21 07:18:56] [INFO ] Deduced a trap composed of 107 places in 930 ms of which 14 ms to minimize.
[2024-05-21 07:18:57] [INFO ] Deduced a trap composed of 15 places in 917 ms of which 13 ms to minimize.
[2024-05-21 07:18:58] [INFO ] Deduced a trap composed of 94 places in 917 ms of which 13 ms to minimize.
[2024-05-21 07:18:58] [INFO ] Deduced a trap composed of 17 places in 837 ms of which 12 ms to minimize.
[2024-05-21 07:18:59] [INFO ] Deduced a trap composed of 108 places in 859 ms of which 12 ms to minimize.
[2024-05-21 07:19:00] [INFO ] Deduced a trap composed of 111 places in 858 ms of which 12 ms to minimize.
[2024-05-21 07:19:01] [INFO ] Deduced a trap composed of 105 places in 872 ms of which 12 ms to minimize.
SMT process timed out in 60943ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 60960ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62825 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLCardinality-03 finished in 63904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 876 transition count 850
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 876 transition count 850
Applied a total of 16 rules in 81 ms. Remains 876 /884 variables (removed 8) and now considering 850/858 (removed 8) transitions.
// Phase 1: matrix 850 rows 876 cols
[2024-05-21 07:19:02] [INFO ] Computed 76 invariants in 8 ms
[2024-05-21 07:19:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-21 07:19:03] [INFO ] Invariant cache hit.
[2024-05-21 07:19:04] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-05-21 07:19:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/875 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/876 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/876 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-21 07:19:34] [INFO ] Deduced a trap composed of 35 places in 635 ms of which 8 ms to minimize.
[2024-05-21 07:19:34] [INFO ] Deduced a trap composed of 102 places in 589 ms of which 8 ms to minimize.
SMT process timed out in 30529ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 30540ms
Starting structural reductions in LTL mode, iteration 1 : 876/884 places, 850/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31962 ms. Remains : 876/884 places, 850/858 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-05 finished in 32126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 872 transition count 846
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 872 transition count 846
Applied a total of 24 rules in 96 ms. Remains 872 /884 variables (removed 12) and now considering 846/858 (removed 12) transitions.
// Phase 1: matrix 846 rows 872 cols
[2024-05-21 07:19:34] [INFO ] Computed 76 invariants in 11 ms
[2024-05-21 07:19:35] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-21 07:19:35] [INFO ] Invariant cache hit.
[2024-05-21 07:19:36] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-21 07:19:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
SMT process timed out in 30214ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Starting structural reductions in LTL mode, iteration 1 : 872/884 places, 846/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32013 ms. Remains : 872/884 places, 846/858 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08
Product exploration explored 100000 steps with 582 reset in 643 ms.
Product exploration explored 100000 steps with 561 reset in 565 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 217 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (72 resets) in 286 ms. (139 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-21 07:20:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 556/809 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1718 variables, 872/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:09] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
[2024-05-21 07:20:09] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 556/809 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/872 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:10] [INFO ] Deduced a trap composed of 23 places in 543 ms of which 12 ms to minimize.
[2024-05-21 07:20:11] [INFO ] Deduced a trap composed of 25 places in 527 ms of which 9 ms to minimize.
[2024-05-21 07:20:11] [INFO ] Deduced a trap composed of 15 places in 518 ms of which 9 ms to minimize.
[2024-05-21 07:20:12] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 9 ms to minimize.
[2024-05-21 07:20:13] [INFO ] Deduced a trap composed of 35 places in 545 ms of which 9 ms to minimize.
[2024-05-21 07:20:13] [INFO ] Deduced a trap composed of 37 places in 514 ms of which 9 ms to minimize.
[2024-05-21 07:20:14] [INFO ] Deduced a trap composed of 35 places in 519 ms of which 16 ms to minimize.
[2024-05-21 07:20:14] [INFO ] Deduced a trap composed of 57 places in 495 ms of which 9 ms to minimize.
SMT process timed out in 5913ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 846/846 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 872 transition count 540
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 342 rules applied. Total rules applied 648 place count 566 transition count 504
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 674 place count 542 transition count 502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 676 place count 540 transition count 502
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 676 place count 540 transition count 397
Deduced a syphon composed of 105 places in 2 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1226 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1274 place count 265 transition count 155
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1322 place count 217 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1323 place count 216 transition count 154
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 5 with 157 rules applied. Total rules applied 1480 place count 157 transition count 56
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 6 with 98 rules applied. Total rules applied 1578 place count 59 transition count 56
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1578 place count 59 transition count 38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1614 place count 41 transition count 38
Applied a total of 1614 rules in 137 ms. Remains 41 /872 variables (removed 831) and now considering 38/846 (removed 808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 41/872 places, 38/846 transitions.
RANDOM walk for 6696 steps (2 resets) in 37 ms. (176 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 44 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-21 07:20:15] [INFO ] Invariant cache hit.
[2024-05-21 07:20:16] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-21 07:20:16] [INFO ] Invariant cache hit.
[2024-05-21 07:20:17] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-21 07:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30223ms
Finished structural reductions in LTL mode , in 1 iterations and 32133 ms. Remains : 872/872 places, 846/846 transitions.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 201 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (71 resets) in 182 ms. (218 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-21 07:20:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 556/809 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1718 variables, 872/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 250/253 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:49] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 07:20:49] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 556/809 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:49] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/872 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:20:50] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 5 ms to minimize.
[2024-05-21 07:20:50] [INFO ] Deduced a trap composed of 25 places in 540 ms of which 8 ms to minimize.
[2024-05-21 07:20:51] [INFO ] Deduced a trap composed of 15 places in 524 ms of which 5 ms to minimize.
[2024-05-21 07:20:51] [INFO ] Deduced a trap composed of 29 places in 568 ms of which 9 ms to minimize.
[2024-05-21 07:20:52] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 6 ms to minimize.
[2024-05-21 07:20:52] [INFO ] Deduced a trap composed of 37 places in 507 ms of which 8 ms to minimize.
[2024-05-21 07:20:53] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 9 ms to minimize.
[2024-05-21 07:20:53] [INFO ] Deduced a trap composed of 57 places in 336 ms of which 6 ms to minimize.
[2024-05-21 07:20:54] [INFO ] Deduced a trap composed of 77 places in 451 ms of which 8 ms to minimize.
SMT process timed out in 5856ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 846/846 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 872 transition count 540
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 342 rules applied. Total rules applied 648 place count 566 transition count 504
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 674 place count 542 transition count 502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 676 place count 540 transition count 502
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 676 place count 540 transition count 397
Deduced a syphon composed of 105 places in 2 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1226 place count 265 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1274 place count 265 transition count 155
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1322 place count 217 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1323 place count 216 transition count 154
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 5 with 157 rules applied. Total rules applied 1480 place count 157 transition count 56
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 6 with 98 rules applied. Total rules applied 1578 place count 59 transition count 56
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1578 place count 59 transition count 38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1614 place count 41 transition count 38
Applied a total of 1614 rules in 114 ms. Remains 41 /872 variables (removed 831) and now considering 38/846 (removed 808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 41/872 places, 38/846 transitions.
RANDOM walk for 13351 steps (3 resets) in 65 ms. (202 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 549 reset in 271 ms.
Product exploration explored 100000 steps with 536 reset in 438 ms.
Built C files in :
/tmp/ltsmin14342061249659928966
[2024-05-21 07:20:56] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14342061249659928966
Running compilation step : cd /tmp/ltsmin14342061249659928966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14342061249659928966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14342061249659928966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 30 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-21 07:20:59] [INFO ] Invariant cache hit.
[2024-05-21 07:20:59] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-21 07:20:59] [INFO ] Invariant cache hit.
[2024-05-21 07:21:01] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-21 07:21:01] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Finished structural reductions in LTL mode , in 1 iterations and 32262 ms. Remains : 872/872 places, 846/846 transitions.
Built C files in :
/tmp/ltsmin16234708910204637770
[2024-05-21 07:21:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16234708910204637770
Running compilation step : cd /tmp/ltsmin16234708910204637770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2622 ms.
Running link step : cd /tmp/ltsmin16234708910204637770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16234708910204637770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2788593866487971849.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:21:46] [INFO ] Flatten gal took : 47 ms
[2024-05-21 07:21:46] [INFO ] Flatten gal took : 45 ms
[2024-05-21 07:21:46] [INFO ] Time to serialize gal into /tmp/LTL12523713247295356777.gal : 11 ms
[2024-05-21 07:21:46] [INFO ] Time to serialize properties into /tmp/LTL9527459143268875976.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12523713247295356777.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11806034964500789904.hoa' '-atoms' '/tmp/LTL9527459143268875976.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9527459143268875976.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11806034964500789904.hoa
Detected timeout of ITS tools.
[2024-05-21 07:22:01] [INFO ] Flatten gal took : 42 ms
[2024-05-21 07:22:01] [INFO ] Flatten gal took : 37 ms
[2024-05-21 07:22:01] [INFO ] Time to serialize gal into /tmp/LTL14871594798056167898.gal : 8 ms
[2024-05-21 07:22:01] [INFO ] Time to serialize properties into /tmp/LTL4571515851669299926.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14871594798056167898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4571515851669299926.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p983==0)||(p1100==1))"))&&(X("(p214==0)")))))
Formula 0 simplified : G(F!"((p983==0)||(p1100==1))" | X!"(p214==0)")
Detected timeout of ITS tools.
[2024-05-21 07:22:17] [INFO ] Flatten gal took : 31 ms
[2024-05-21 07:22:17] [INFO ] Applying decomposition
[2024-05-21 07:22:17] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15049680638071248282.txt' '-o' '/tmp/graph15049680638071248282.bin' '-w' '/tmp/graph15049680638071248282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15049680638071248282.bin' '-l' '-1' '-v' '-w' '/tmp/graph15049680638071248282.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:22:17] [INFO ] Decomposing Gal with order
[2024-05-21 07:22:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:22:17] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-21 07:22:17] [INFO ] Flatten gal took : 142 ms
[2024-05-21 07:22:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 07:22:17] [INFO ] Time to serialize gal into /tmp/LTL2256693147592093221.gal : 23 ms
[2024-05-21 07:22:17] [INFO ] Time to serialize properties into /tmp/LTL6029889074095958898.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2256693147592093221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6029889074095958898.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i26.u309.p983==0)||(i28.i1.i0.u357.p1100==1))"))&&(X("(i7.u65.p214==0)")))))
Formula 0 simplified : G(F!"((i26.u309.p983==0)||(i28.i1.i0.u357.p1100==1))" | X!"(i7.u65.p214==0)")
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 177917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(p2)))&&p0)))'
Support contains 5 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 89 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 07:22:32] [INFO ] Computed 76 invariants in 10 ms
[2024-05-21 07:22:33] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-21 07:22:33] [INFO ] Invariant cache hit.
[2024-05-21 07:22:34] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-21 07:22:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
SMT process timed out in 30236ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30251ms
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32239 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-09 finished in 32480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 883 transition count 542
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 666 place count 568 transition count 506
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 690 place count 544 transition count 506
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 690 place count 544 transition count 402
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 898 place count 440 transition count 402
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 903 place count 435 transition count 397
Iterating global reduction 3 with 5 rules applied. Total rules applied 908 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 908 place count 435 transition count 395
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 912 place count 433 transition count 395
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1254 place count 262 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1255 place count 261 transition count 199
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 253 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1269 place count 250 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1269 place count 250 transition count 191
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1279 place count 245 transition count 191
Applied a total of 1279 rules in 95 ms. Remains 245 /884 variables (removed 639) and now considering 191/858 (removed 667) transitions.
// Phase 1: matrix 191 rows 245 cols
[2024-05-21 07:23:05] [INFO ] Computed 68 invariants in 2 ms
[2024-05-21 07:23:05] [INFO ] Implicit Places using invariants in 308 ms returned [103, 141, 179, 185, 191, 197, 203, 209, 215, 221, 226, 231, 235, 239, 244]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 313 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/884 places, 191/858 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 216 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 216 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 215 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 215 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 214 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 214 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 213 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 213 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 212 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 212 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 211 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 211 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 210 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 210 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 209 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 209 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 206 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 206 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 166
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 0 with 2 rules applied. Total rules applied 52 place count 204 transition count 165
Applied a total of 52 rules in 69 ms. Remains 204 /230 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 204 cols
[2024-05-21 07:23:05] [INFO ] Computed 53 invariants in 2 ms
[2024-05-21 07:23:05] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 07:23:05] [INFO ] Invariant cache hit.
[2024-05-21 07:23:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 07:23:06] [INFO ] Implicit Places using invariants and state equation in 470 ms returned [85, 87, 89, 91, 93, 95, 97]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 671 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/884 places, 165/858 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 197 transition count 158
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 190 transition count 158
Applied a total of 14 rules in 10 ms. Remains 190 /197 variables (removed 7) and now considering 158/165 (removed 7) transitions.
// Phase 1: matrix 158 rows 190 cols
[2024-05-21 07:23:06] [INFO ] Computed 46 invariants in 2 ms
[2024-05-21 07:23:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 07:23:06] [INFO ] Invariant cache hit.
[2024-05-21 07:23:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 07:23:07] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 190/884 places, 158/858 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1992 ms. Remains : 190/884 places, 158/858 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-10
Product exploration explored 100000 steps with 33726 reset in 686 ms.
Product exploration explored 100000 steps with 33738 reset in 493 ms.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-21 07:23:08] [INFO ] Invariant cache hit.
[2024-05-21 07:23:09] [INFO ] [Real]Absence check using 46 positive place invariants in 25 ms returned sat
[2024-05-21 07:23:09] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-21 07:23:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:23:09] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 07:23:09] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-05-21 07:23:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 07:23:09] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2024-05-21 07:23:09] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 07:23:10] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 158/158 transitions.
Applied a total of 0 rules in 10 ms. Remains 190 /190 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-05-21 07:23:10] [INFO ] Invariant cache hit.
[2024-05-21 07:23:10] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 07:23:10] [INFO ] Invariant cache hit.
[2024-05-21 07:23:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 07:23:10] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-21 07:23:10] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-21 07:23:10] [INFO ] Invariant cache hit.
[2024-05-21 07:23:10] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-21 07:23:13] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 282 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11906 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/190 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 158/348 variables, 190/237 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 143/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 425 constraints, problems are : Problem set: 0 solved, 143 unsolved in 14036 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 190/190 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
After SMT, in 25982ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 25984ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26902 ms. Remains : 190/190 places, 158/158 transitions.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2024-05-21 07:23:37] [INFO ] Invariant cache hit.
[2024-05-21 07:23:37] [INFO ] [Real]Absence check using 46 positive place invariants in 35 ms returned sat
[2024-05-21 07:23:38] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2024-05-21 07:23:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:23:38] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-05-21 07:23:38] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-05-21 07:23:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 07:23:38] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2024-05-21 07:23:38] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 07:23:38] [INFO ] Added : 0 causal constraints over 0 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33689 reset in 797 ms.
Product exploration explored 100000 steps with 33737 reset in 797 ms.
Built C files in :
/tmp/ltsmin14551993878071624818
[2024-05-21 07:23:40] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2024-05-21 07:23:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:23:40] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2024-05-21 07:23:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:23:40] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2024-05-21 07:23:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:23:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14551993878071624818
Running compilation step : cd /tmp/ltsmin14551993878071624818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 657 ms.
Running link step : cd /tmp/ltsmin14551993878071624818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14551993878071624818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6609823888889476612.hoa' '--buchi-type=spotba'
LTSmin run took 652 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLCardinality-10 finished in 36575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F(p0))))))))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 129 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-21 07:23:41] [INFO ] Computed 76 invariants in 4 ms
[2024-05-21 07:23:42] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-21 07:23:42] [INFO ] Invariant cache hit.
[2024-05-21 07:23:43] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-21 07:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30196ms
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32064 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-11
Product exploration explored 100000 steps with 14285 reset in 238 ms.
Product exploration explored 100000 steps with 14285 reset in 259 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (71 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384477 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384477 steps, saw 91842 distinct states, run finished after 3007 ms. (steps per millisecond=127 ) properties seen :0
[2024-05-21 07:24:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:24:19] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 5 ms to minimize.
[2024-05-21 07:24:19] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 847/1720 variables, 873/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 873 transition count 533
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 559 transition count 497
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 688 place count 535 transition count 497
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 688 place count 535 transition count 394
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 894 place count 432 transition count 394
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 1238 place count 260 transition count 198
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1286 place count 260 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1334 place count 212 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 211 transition count 149
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 4 with 159 rules applied. Total rules applied 1494 place count 152 transition count 49
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 1594 place count 52 transition count 49
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1594 place count 52 transition count 33
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1626 place count 36 transition count 33
Applied a total of 1626 rules in 92 ms. Remains 36 /873 variables (removed 837) and now considering 33/847 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 36/873 places, 33/847 transitions.
RANDOM walk for 116 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 33 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-21 07:24:21] [INFO ] Invariant cache hit.
[2024-05-21 07:24:21] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-21 07:24:21] [INFO ] Invariant cache hit.
[2024-05-21 07:24:23] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-21 07:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Finished structural reductions in LTL mode , in 1 iterations and 31888 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326219 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326219 steps, saw 84049 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-21 07:24:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 1 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 739/810 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:24:58] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 5 ms to minimize.
[2024-05-21 07:24:58] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/873 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 847/1720 variables, 873/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1720 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2462ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 873 transition count 533
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 664 place count 559 transition count 497
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 688 place count 535 transition count 497
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 688 place count 535 transition count 394
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 894 place count 432 transition count 394
Performed 172 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 1238 place count 260 transition count 198
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1286 place count 260 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1334 place count 212 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1335 place count 211 transition count 149
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 4 with 159 rules applied. Total rules applied 1494 place count 152 transition count 49
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 1594 place count 52 transition count 49
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1594 place count 52 transition count 33
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1626 place count 36 transition count 33
Applied a total of 1626 rules in 86 ms. Remains 36 /873 variables (removed 837) and now considering 33/847 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 36/873 places, 33/847 transitions.
RANDOM walk for 72 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 228 ms.
Product exploration explored 100000 steps with 14285 reset in 248 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 302 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 302 place count 873 transition count 835
Deduced a syphon composed of 404 places in 3 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 416 place count 873 transition count 835
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 655 place count 634 transition count 596
Deduced a syphon composed of 165 places in 2 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 894 place count 634 transition count 596
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1103 place count 634 transition count 572
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1237 place count 500 transition count 438
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1371 place count 500 transition count 438
Deduced a syphon composed of 240 places in 0 ms
Applied a total of 1371 rules in 396 ms. Remains 500 /873 variables (removed 373) and now considering 438/847 (removed 409) transitions.
[2024-05-21 07:25:02] [INFO ] Redundant transitions in 43 ms returned []
Running 437 sub problems to find dead transitions.
// Phase 1: matrix 438 rows 500 cols
[2024-05-21 07:25:02] [INFO ] Computed 76 invariants in 9 ms
[2024-05-21 07:25:02] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 07:25:22] [INFO ] Deduced a trap composed of 2 places in 431 ms of which 7 ms to minimize.
[2024-05-21 07:25:23] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 7 ms to minimize.
[2024-05-21 07:25:23] [INFO ] Deduced a trap composed of 2 places in 385 ms of which 6 ms to minimize.
[2024-05-21 07:25:24] [INFO ] Deduced a trap composed of 2 places in 374 ms of which 6 ms to minimize.
[2024-05-21 07:25:24] [INFO ] Deduced a trap composed of 2 places in 397 ms of which 6 ms to minimize.
[2024-05-21 07:25:24] [INFO ] Deduced a trap composed of 2 places in 395 ms of which 6 ms to minimize.
[2024-05-21 07:25:25] [INFO ] Deduced a trap composed of 2 places in 416 ms of which 7 ms to minimize.
[2024-05-21 07:25:25] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 6 ms to minimize.
[2024-05-21 07:25:26] [INFO ] Deduced a trap composed of 2 places in 289 ms of which 6 ms to minimize.
[2024-05-21 07:25:26] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 6 ms to minimize.
[2024-05-21 07:25:26] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 6 ms to minimize.
[2024-05-21 07:25:27] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 6 ms to minimize.
[2024-05-21 07:25:27] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 6 ms to minimize.
[2024-05-21 07:25:27] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 6 ms to minimize.
[2024-05-21 07:25:28] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-21 07:25:28] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 07:25:28] [INFO ] Deduced a trap composed of 2 places in 299 ms of which 6 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 07:25:28] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/96 constraints. Problems are: Problem set: 92 solved, 345 unsolved
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 07:25:29] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 07:25:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 20/116 constraints. Problems are: Problem set: 129 solved, 308 unsolved
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 16 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 07:25:31] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 4 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 07:25:32] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 4 ms to minimize.
SMT process timed out in 30583ms, After SMT, problems are : Problem set: 129 solved, 308 unsolved
Search for dead transitions found 143 dead transitions in 30591ms
Found 143 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 143 transitions
Dead transitions reduction (with SMT) removed 143 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 500/873 places, 295/847 transitions.
Graph (complete) has 911 edges and 500 vertex of which 357 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.3 ms
Discarding 143 places :
Also discarding 0 output transitions
Deduced a syphon composed of 97 places in 1 ms
Applied a total of 1 rules in 21 ms. Remains 357 /500 variables (removed 143) and now considering 295/295 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 357/873 places, 295/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31064 ms. Remains : 357/873 places, 295/847 transitions.
Built C files in :
/tmp/ltsmin11953370201504731031
[2024-05-21 07:25:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11953370201504731031
Running compilation step : cd /tmp/ltsmin11953370201504731031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2918 ms.
Running link step : cd /tmp/ltsmin11953370201504731031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11953370201504731031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9788096983022012772.hoa' '--buchi-type=spotba'
LTSmin run took 436 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLCardinality-11 finished in 114656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(F((!(p0 U p1)||X(p2))))))||G(X(p0))))'
Support contains 6 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 873 transition count 847
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 161 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-21 07:25:36] [INFO ] Computed 76 invariants in 6 ms
[2024-05-21 07:25:37] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-21 07:25:37] [INFO ] Invariant cache hit.
[2024-05-21 07:25:38] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-21 07:25:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
SMT process timed out in 30203ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30216ms
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32261 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15
Product exploration explored 100000 steps with 182 reset in 682 ms.
Product exploration explored 100000 steps with 182 reset in 409 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (72 resets) in 283 ms. (140 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
[2024-05-21 07:26:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 539/812 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/812 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 847/1720 variables, 873/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1720 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 949 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:26:11] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 539/812 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:26:12] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 5 ms to minimize.
[2024-05-21 07:26:12] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/812 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 61/873 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:26:13] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 8 ms to minimize.
[2024-05-21 07:26:13] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 8 ms to minimize.
[2024-05-21 07:26:14] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 8 ms to minimize.
[2024-05-21 07:26:14] [INFO ] Deduced a trap composed of 59 places in 410 ms of which 7 ms to minimize.
[2024-05-21 07:26:14] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 8 ms to minimize.
[2024-05-21 07:26:15] [INFO ] Deduced a trap composed of 72 places in 413 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/958 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 07:26:16] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1720 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 961 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 6085ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 873 transition count 539
Reduce places removed 308 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 344 rules applied. Total rules applied 652 place count 565 transition count 503
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 678 place count 541 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 680 place count 539 transition count 501
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 680 place count 539 transition count 397
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 888 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1230 place count 264 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1231 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 47 times.
Iterating global reduction 5 with 47 rules applied. Total rules applied 1278 place count 264 transition count 155
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1325 place count 217 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1326 place count 216 transition count 154
Reduce places removed 57 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 6 with 153 rules applied. Total rules applied 1479 place count 159 transition count 58
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 97 rules applied. Total rules applied 1576 place count 63 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1577 place count 62 transition count 57
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1577 place count 62 transition count 41
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1609 place count 46 transition count 41
Applied a total of 1609 rules in 79 ms. Remains 46 /873 variables (removed 827) and now considering 41/847 (removed 806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 46/873 places, 41/847 transitions.
RANDOM walk for 214 steps (3 resets) in 7 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 528 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 872 transition count 539
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 565 transition count 503
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 541 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 539 transition count 501
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 678 place count 539 transition count 397
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1228 place count 264 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1229 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1230 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 34 rules applied. Total rules applied 1264 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1275 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1275 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1299 place count 217 transition count 178
Applied a total of 1299 rules in 82 ms. Remains 217 /873 variables (removed 656) and now considering 178/847 (removed 669) transitions.
// Phase 1: matrix 178 rows 217 cols
[2024-05-21 07:26:17] [INFO ] Computed 53 invariants in 1 ms
[2024-05-21 07:26:17] [INFO ] Implicit Places using invariants in 220 ms returned [88, 126, 164, 174, 178, 182, 186, 190, 194, 198, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 223 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/873 places, 178/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 177 transition count 152
Applied a total of 52 rules in 48 ms. Remains 177 /203 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 177 cols
[2024-05-21 07:26:17] [INFO ] Computed 39 invariants in 2 ms
[2024-05-21 07:26:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 07:26:18] [INFO ] Invariant cache hit.
[2024-05-21 07:26:18] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/873 places, 152/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 901 ms. Remains : 177/873 places, 152/847 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 10869 steps (230 resets) in 196 ms. (55 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 849 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering criterion allowed to conclude after 8074 steps with 175 reset in 46 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 44391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLCardinality-08
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 883 transition count 550
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 576 transition count 514
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 552 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 550 transition count 512
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 678 place count 550 transition count 405
Deduced a syphon composed of 107 places in 2 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 892 place count 443 transition count 405
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 897 place count 438 transition count 400
Iterating global reduction 4 with 5 rules applied. Total rules applied 902 place count 438 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 902 place count 438 transition count 398
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 906 place count 436 transition count 398
Performed 169 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1244 place count 267 transition count 205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1245 place count 266 transition count 204
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 32 rules applied. Total rules applied 1277 place count 244 transition count 194
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1287 place count 234 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1287 place count 234 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1311 place count 222 transition count 182
Applied a total of 1311 rules in 114 ms. Remains 222 /884 variables (removed 662) and now considering 182/858 (removed 676) transitions.
// Phase 1: matrix 182 rows 222 cols
[2024-05-21 07:26:21] [INFO ] Computed 54 invariants in 1 ms
[2024-05-21 07:26:21] [INFO ] Implicit Places using invariants in 271 ms returned [90, 128, 166, 170, 174, 184, 188, 192, 196, 201, 206, 216, 221]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 275 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 209/884 places, 182/858 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 198 transition count 171
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 198 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 197 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 197 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 196 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 196 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 195 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 195 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 194 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 194 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 193 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 193 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 192 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 192 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 191 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 191 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 190 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 190 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 189 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 189 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 188 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 188 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 187 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 187 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 186 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 186 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 183 transition count 156
Applied a total of 52 rules in 63 ms. Remains 183 /209 variables (removed 26) and now considering 156/182 (removed 26) transitions.
// Phase 1: matrix 156 rows 183 cols
[2024-05-21 07:26:21] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 07:26:21] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 07:26:21] [INFO ] Invariant cache hit.
[2024-05-21 07:26:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:26:22] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 183/884 places, 156/858 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 892 ms. Remains : 183/884 places, 156/858 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08
Product exploration explored 100000 steps with 4284 reset in 378 ms.
Product exploration explored 100000 steps with 4305 reset in 427 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 461 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 288 steps (3 resets) in 7 ms. (36 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 719 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-21 07:26:24] [INFO ] Invariant cache hit.
[2024-05-21 07:26:24] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-21 07:26:24] [INFO ] Invariant cache hit.
[2024-05-21 07:26:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:26:25] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-21 07:26:25] [INFO ] Invariant cache hit.
[2024-05-21 07:26:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 07:26:26] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6138 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 95/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9163 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
After SMT, in 15321ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 15323ms
Finished structural reductions in LTL mode , in 1 iterations and 16063 ms. Remains : 183/183 places, 156/156 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 491 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 391 steps (4 resets) in 8 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 804 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4255 reset in 499 ms.
Product exploration explored 100000 steps with 4284 reset in 687 ms.
Built C files in :
/tmp/ltsmin17857842462492326745
[2024-05-21 07:26:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17857842462492326745
Running compilation step : cd /tmp/ltsmin17857842462492326745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin17857842462492326745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17857842462492326745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1729583345342308758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-21 07:26:59] [INFO ] Invariant cache hit.
[2024-05-21 07:26:59] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 07:26:59] [INFO ] Invariant cache hit.
[2024-05-21 07:26:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:26:59] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-21 07:26:59] [INFO ] Invariant cache hit.
[2024-05-21 07:26:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 07:27:00] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6238 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/183 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 156/339 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 95/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/339 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 183/183 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
After SMT, in 14727ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 14729ms
Finished structural reductions in LTL mode , in 1 iterations and 15227 ms. Remains : 183/183 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin16729388508707258129
[2024-05-21 07:27:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16729388508707258129
Running compilation step : cd /tmp/ltsmin16729388508707258129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 435 ms.
Running link step : cd /tmp/ltsmin16729388508707258129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16729388508707258129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2860103219594201397.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:27:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 07:27:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 07:27:29] [INFO ] Time to serialize gal into /tmp/LTL2285612616887501799.gal : 2 ms
[2024-05-21 07:27:29] [INFO ] Time to serialize properties into /tmp/LTL10739169355225124263.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2285612616887501799.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11332391544600445709.hoa' '-atoms' '/tmp/LTL10739169355225124263.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10739169355225124263.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11332391544600445709.hoa
Reverse transition relation is NOT exact ! Due to transitions t149.t194, t155.t194, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 753664 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
871 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,8.74526,262468,1,0,846,1.22742e+06,344,629,4998,1.85561e+06,1379
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 79135 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 07:27:39] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14470437627545706143
[2024-05-21 07:27:39] [INFO ] Computing symmetric may disable matrix : 858 transitions.
[2024-05-21 07:27:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:27:39] [INFO ] Computing symmetric may enable matrix : 858 transitions.
[2024-05-21 07:27:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:27:39] [INFO ] Applying decomposition
[2024-05-21 07:27:39] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12351597238777653794.txt' '-o' '/tmp/graph12351597238777653794.bin' '-w' '/tmp/graph12351597238777653794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12351597238777653794.bin' '-l' '-1' '-v' '-w' '/tmp/graph12351597238777653794.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:27:40] [INFO ] Decomposing Gal with order
[2024-05-21 07:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:27:40] [INFO ] Computing Do-Not-Accords matrix : 858 transitions.
[2024-05-21 07:27:40] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-21 07:27:40] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:27:40] [INFO ] Flatten gal took : 60 ms
[2024-05-21 07:27:40] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14470437627545706143
Running compilation step : cd /tmp/ltsmin14470437627545706143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 07:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 07:27:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality5741531710225467394.gal : 11 ms
[2024-05-21 07:27:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality6671517187172586184.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5741531710225467394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6671517187172586184.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((i27.u313.p983==0)||(i0.u361.p1100==1))"))&&(X("(i9.u62.p214==0)")))))
Formula 0 simplified : G(F!"((i27.u313.p983==0)||(i0.u361.p1100==1))" | X!"(i9.u62.p214==0)")
Compilation finished in 4442 ms.
Running link step : cd /tmp/ltsmin14470437627545706143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14470437627545706143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 07:51:30] [INFO ] Applying decomposition
[2024-05-21 07:51:30] [INFO ] Flatten gal took : 79 ms
[2024-05-21 07:51:30] [INFO ] Decomposing Gal with order
[2024-05-21 07:51:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:51:30] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-21 07:51:30] [INFO ] Flatten gal took : 122 ms
[2024-05-21 07:51:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 603 ms.
[2024-05-21 07:51:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality9094941708765229483.gal : 52 ms
[2024-05-21 07:51:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality13891052964226072276.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9094941708765229483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13891052964226072276.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u139.p983==0)||(i1.i0.i0.u146.p1100==1))"))&&(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...277
Formula 0 simplified : G(F!"((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u139.p983==0)||(i1.i0.i0.u146.p1100==1))" | X!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...269
ITS-tools command line returned an error code 137
[2024-05-21 08:11:34] [INFO ] Flatten gal took : 81 ms
[2024-05-21 08:11:34] [INFO ] Input system was already deterministic with 858 transitions.
[2024-05-21 08:11:34] [INFO ] Transformed 884 places.
[2024-05-21 08:11:34] [INFO ] Transformed 858 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 08:11:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality4832603043360195897.gal : 12 ms
[2024-05-21 08:11:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality5190292640595888621.ltl : 7 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4832603043360195897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5190292640595888621.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p983==0)||(p1100==1))"))&&(X("(p214==0)")))))
Formula 0 simplified : G(F!"((p983==0)||(p1100==1))" | X!"(p214==0)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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