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.r468-smll-171620167000116.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 ltsminxred
Input is AutoFlight-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167000116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.9K 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 Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 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 91K 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-04b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717185481138

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:58:04] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-31 19:58:04] [INFO ] Transformed 390 places.
[2024-05-31 19:58:04] [INFO ] Transformed 388 transitions.
[2024-05-31 19:58:04] [INFO ] Found NUPN structural information;
[2024-05-31 19:58:04] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 342 transition count 340
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 342 transition count 340
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 342 transition count 333
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 121 place count 324 transition count 315
Iterating global reduction 1 with 18 rules applied. Total rules applied 139 place count 324 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 322 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 322 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 320 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 320 transition count 311
Applied a total of 147 rules in 260 ms. Remains 320 /390 variables (removed 70) and now considering 311/388 (removed 77) transitions.
// Phase 1: matrix 311 rows 320 cols
[2024-05-31 19:58:04] [INFO ] Computed 28 invariants in 40 ms
[2024-05-31 19:58:05] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-31 19:58:05] [INFO ] Invariant cache hit.
[2024-05-31 19:58:06] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-05-31 19:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 69 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 6 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 5 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 4 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 5 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 5 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 10 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:58:17] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:58:17] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:58:17] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:58:17] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:58:18] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:58:19] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:23] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
[2024-05-31 19:58:23] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:58:23] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:58:24] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:58:24] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:58:24] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:58:24] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 5 ms to minimize.
[2024-05-31 19:58:24] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 4 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 3 ms to minimize.
[2024-05-31 19:58:25] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:58:26] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 11 ms to minimize.
[2024-05-31 19:58:26] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 6 ms to minimize.
[2024-05-31 19:58:26] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 4 ms to minimize.
[2024-05-31 19:58:26] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 4 ms to minimize.
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 4 ms to minimize.
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 5 ms to minimize.
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 4 ms to minimize.
[2024-05-31 19:58:29] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:58:29] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 4 ms to minimize.
[2024-05-31 19:58:29] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 4 ms to minimize.
[2024-05-31 19:58:29] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 5 ms to minimize.
[2024-05-31 19:58:30] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 5 ms to minimize.
[2024-05-31 19:58:30] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 4 ms to minimize.
[2024-05-31 19:58:30] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 5 ms to minimize.
[2024-05-31 19:58:30] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 4 ms to minimize.
[2024-05-31 19:58:30] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 3 ms to minimize.
[2024-05-31 19:58:31] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:58:31] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:58:31] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 4 ms to minimize.
[2024-05-31 19:58:31] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 4 ms to minimize.
[2024-05-31 19:58:31] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:58:32] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:58:32] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:32] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:58:33] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 4 ms to minimize.
[2024-05-31 19:58:33] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:58:34] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:58:34] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:58:34] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:58:34] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:58:35] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:58:35] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/631 variables, and 97 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 69/97 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 3 ms to minimize.
[2024-05-31 19:58:41] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 4 ms to minimize.
[2024-05-31 19:58:41] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:58:42] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 4 ms to minimize.
[2024-05-31 19:58:43] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-31 19:58:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 311/631 variables, 320/423 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 310/733 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:58:50] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:58:51] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2024-05-31 19:58:52] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 5 ms to minimize.
[2024-05-31 19:58:52] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 4 ms to minimize.
[2024-05-31 19:58:52] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 4 ms to minimize.
[2024-05-31 19:58:53] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 4 ms to minimize.
[2024-05-31 19:58:53] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 4 ms to minimize.
[2024-05-31 19:58:53] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 4 ms to minimize.
[2024-05-31 19:58:53] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 4 ms to minimize.
[2024-05-31 19:58:54] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:58:54] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:58:58] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:58:58] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:58:59] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 14/747 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 19:59:05] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:59:06] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 749 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 91/91 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 320/390 places, 311/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61842 ms. Remains : 320/390 places, 311/388 transitions.
Support contains 41 out of 320 places after structural reductions.
[2024-05-31 19:59:06] [INFO ] Flatten gal took : 107 ms
[2024-05-31 19:59:06] [INFO ] Flatten gal took : 48 ms
[2024-05-31 19:59:07] [INFO ] Input system was already deterministic with 311 transitions.
RANDOM walk for 40000 steps (194 resets) in 3305 ms. (12 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40004 steps (18 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (19 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2024-05-31 19:59:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 143/299 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/320 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 311/631 variables, 320/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/631 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 356 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 143/299 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 21/320 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 311/631 variables, 320/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/631 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/631 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/631 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 4 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/631 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/631 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/631 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 371 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1949 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 3317ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 3676 ms.
Support contains 8 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 311/311 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 320 transition count 206
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 119 rules applied. Total rules applied 224 place count 215 transition count 192
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 235 place count 207 transition count 189
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 238 place count 204 transition count 189
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 238 place count 204 transition count 150
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 316 place count 165 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 320 place count 161 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 161 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 324 place count 161 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 330 place count 158 transition count 143
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 442 place count 102 transition count 80
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 455 place count 102 transition count 67
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 468 place count 89 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 469 place count 88 transition count 66
Reduce places removed 17 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 33 rules applied. Total rules applied 502 place count 71 transition count 50
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 17 rules applied. Total rules applied 519 place count 55 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 520 place count 54 transition count 49
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 520 place count 54 transition count 37
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 544 place count 42 transition count 37
Applied a total of 544 rules in 83 ms. Remains 42 /320 variables (removed 278) and now considering 37/311 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 42/320 places, 37/311 transitions.
RANDOM walk for 24933 steps (1556 resets) in 466 ms. (53 steps per ms) remains 0/4 properties
FORMULA AutoFlight-PT-04b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 84 stabilizing places and 84 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((F((G(p0)||G(p1))) U p2)))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 66 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-31 19:59:16] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 19:59:16] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-31 19:59:16] [INFO ] Invariant cache hit.
[2024-05-31 19:59:16] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 19:59:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:22] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 6 ms to minimize.
[2024-05-31 19:59:23] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 5 ms to minimize.
[2024-05-31 19:59:23] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 5 ms to minimize.
[2024-05-31 19:59:23] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 4 ms to minimize.
[2024-05-31 19:59:23] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 4 ms to minimize.
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 4 ms to minimize.
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 5 ms to minimize.
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 4 ms to minimize.
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:59:25] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 4 ms to minimize.
[2024-05-31 19:59:25] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 5 ms to minimize.
[2024-05-31 19:59:25] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 5 ms to minimize.
[2024-05-31 19:59:26] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 5 ms to minimize.
[2024-05-31 19:59:26] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:59:26] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 4 ms to minimize.
[2024-05-31 19:59:26] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 5 ms to minimize.
[2024-05-31 19:59:26] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 4 ms to minimize.
[2024-05-31 19:59:27] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:59:27] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:59:27] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:31] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 4 ms to minimize.
[2024-05-31 19:59:31] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 3 ms to minimize.
[2024-05-31 19:59:31] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:59:31] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:59:31] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 4 ms to minimize.
[2024-05-31 19:59:32] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 5 ms to minimize.
[2024-05-31 19:59:32] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:59:32] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 4 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:59:33] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:59:34] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 4 ms to minimize.
[2024-05-31 19:59:34] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:59:34] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:59:34] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 4 ms to minimize.
[2024-05-31 19:59:34] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:35] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:59:35] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-31 19:59:36] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 4 ms to minimize.
[2024-05-31 19:59:36] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:59:36] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 4 ms to minimize.
[2024-05-31 19:59:36] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 4 ms to minimize.
[2024-05-31 19:59:37] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 3 ms to minimize.
[2024-05-31 19:59:37] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 4 ms to minimize.
[2024-05-31 19:59:37] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 3 ms to minimize.
[2024-05-31 19:59:40] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 4 ms to minimize.
[2024-05-31 19:59:40] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:59:40] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:59:40] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 4 ms to minimize.
[2024-05-31 19:59:40] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:41] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:59:41] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:59:42] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 5 ms to minimize.
[2024-05-31 19:59:42] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 4 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:51] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:59:51] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:59:51] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:59:51] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:54] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:59:55] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:59:58] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:59:58] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:59:58] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:10] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 4 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 4 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 454 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 9 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-00 finished in 61351 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(F((X(F(p0))||G(p1)))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 58 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
[2024-05-31 20:00:17] [INFO ] Invariant cache hit.
[2024-05-31 20:00:17] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 20:00:17] [INFO ] Invariant cache hit.
[2024-05-31 20:00:17] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 20:00:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 5 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 5 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 5 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 5 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 4 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 4 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 4 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 4 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 5 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:32] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:00:32] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:00:32] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:00:32] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:00:33] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:00:33] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
[2024-05-31 20:00:33] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:00:34] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:00:34] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:00:34] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:00:34] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 4 ms to minimize.
[2024-05-31 20:00:34] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 4 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:00:35] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:00:36] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:00:36] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:37] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 5 ms to minimize.
[2024-05-31 20:00:37] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:00:37] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:00:37] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 4 ms to minimize.
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 4 ms to minimize.
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 4 ms to minimize.
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:00:39] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:00:40] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 4 ms to minimize.
[2024-05-31 20:00:40] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:00:40] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:00:41] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-31 20:00:41] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:00:41] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:00:41] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 4 ms to minimize.
[2024-05-31 20:00:41] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 5 ms to minimize.
[2024-05-31 20:00:42] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:00:42] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:43] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:00:43] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:00:43] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:00:44] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 4 ms to minimize.
[2024-05-31 20:00:44] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 5 ms to minimize.
[2024-05-31 20:00:45] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:00:53] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:55] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:00:56] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:00:59] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:00:59] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:01:00] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:04] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:11] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:01:12] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 4 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 550 reset in 533 ms.
Product exploration explored 100000 steps with 552 reset in 362 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32911 steps (159 resets) in 331 ms. (99 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 20:01:20] [INFO ] Invariant cache hit.
[2024-05-31 20:01:20] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2024-05-31 20:01:20] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:01:20] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-31 20:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:01:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 19 ms returned sat
[2024-05-31 20:01:20] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 20:01:21] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2024-05-31 20:01:21] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-31 20:01:23] [INFO ] Added : 277 causal constraints over 56 iterations in 1772 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-31 20:01:23] [INFO ] Invariant cache hit.
[2024-05-31 20:01:23] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 20:01:23] [INFO ] Invariant cache hit.
[2024-05-31 20:01:23] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 20:01:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 6 ms to minimize.
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 57 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 5 ms to minimize.
[2024-05-31 20:01:31] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:01:31] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:01:31] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 5 ms to minimize.
[2024-05-31 20:01:31] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:01:31] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 5 ms to minimize.
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:01:33] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 5 ms to minimize.
[2024-05-31 20:01:33] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 5 ms to minimize.
[2024-05-31 20:01:33] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:01:33] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 5 ms to minimize.
[2024-05-31 20:01:34] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:01:34] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:01:34] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:01:34] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:01:35] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:38] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:01:38] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:01:38] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:01:39] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:01:39] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 4 ms to minimize.
[2024-05-31 20:01:39] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 4 ms to minimize.
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 4 ms to minimize.
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 5 ms to minimize.
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:01:42] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:01:42] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:01:42] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:01:42] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:43] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:01:43] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:01:43] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 4 ms to minimize.
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:01:45] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:01:45] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:01:46] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 4 ms to minimize.
[2024-05-31 20:01:46] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 4 ms to minimize.
[2024-05-31 20:01:47] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:01:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-31 20:01:47] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:01:47] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:01:47] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:01:48] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:01:48] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 4 ms to minimize.
[2024-05-31 20:01:48] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:01:51] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:01:51] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:01:57] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:01] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:02:01] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:05] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:02:05] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 4 ms to minimize.
[2024-05-31 20:02:05] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:09] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:17] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:02:19] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:02:19] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:02:19] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:02:19] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:02:20] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 304/304 places, 294/294 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (197 resets) in 203 ms. (196 steps per ms) remains 2/4 properties
BEST_FIRST walk for 35745 steps (16 resets) in 143 ms. (248 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 20:02:24] [INFO ] Invariant cache hit.
[2024-05-31 20:02:25] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2024-05-31 20:02:25] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 20:02:25] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-31 20:02:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:02:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2024-05-31 20:02:25] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 20:02:26] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2024-05-31 20:02:26] [INFO ] Computed and/alt/rep : 293/419/293 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-31 20:02:28] [INFO ] Added : 277 causal constraints over 56 iterations in 2408 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 551 reset in 290 ms.
Product exploration explored 100000 steps with 552 reset in 301 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 304 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 100 place count 304 transition count 290
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 304 transition count 290
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 143 place count 304 transition count 290
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 225 transition count 211
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 225 transition count 211
Performed 72 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 373 place count 225 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 225 transition count 203
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 418 place count 181 transition count 159
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 3 with 44 rules applied. Total rules applied 462 place count 181 transition count 159
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 462 rules in 60 ms. Remains 181 /304 variables (removed 123) and now considering 159/294 (removed 135) transitions.
[2024-05-31 20:02:29] [INFO ] Redundant transitions in 6 ms returned []
Running 158 sub problems to find dead transitions.
// Phase 1: matrix 159 rows 181 cols
[2024-05-31 20:02:29] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 20:02:29] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-31 20:02:32] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 4 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 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 TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 67 solved, 91 unsolved
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 20:02:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-31 20:02:35] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 10/58 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/58 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 159/340 variables, 181/239 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 29/268 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/268 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/268 constraints. Problems are: Problem set: 88 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 268 constraints, problems are : Problem set: 88 solved, 70 unsolved in 8731 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 88 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 85/177 variables, 26/26 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 30/56 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/56 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/181 variables, 2/58 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/58 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 159/340 variables, 181/239 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 29/268 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 70/338 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/338 constraints. Problems are: Problem set: 88 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/338 constraints. Problems are: Problem set: 88 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 338 constraints, problems are : Problem set: 88 solved, 70 unsolved in 5997 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/158 constraints, Known Traps: 30/30 constraints]
After SMT, in 14791ms problems are : Problem set: 88 solved, 70 unsolved
Search for dead transitions found 88 dead transitions in 14794ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/304 places, 71/294 transitions.
Graph (complete) has 239 edges and 181 vertex of which 93 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.2 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 93 /181 variables (removed 88) and now considering 71/71 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/304 places, 71/294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14879 ms. Remains : 93/304 places, 71/294 transitions.
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 294/294 transitions.
Applied a total of 0 rules in 13 ms. Remains 304 /304 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-31 20:02:44] [INFO ] Computed 28 invariants in 5 ms
[2024-05-31 20:02:44] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 20:02:44] [INFO ] Invariant cache hit.
[2024-05-31 20:02:45] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 20:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 5 ms to minimize.
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 5 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 5 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 6 ms to minimize.
[2024-05-31 20:02:53] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:02:53] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:02:53] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 5 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 5 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 6 ms to minimize.
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 5 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:02:56] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:02:59] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:02:59] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:03:00] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:03:00] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:03:00] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:03:01] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 4 ms to minimize.
[2024-05-31 20:03:01] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:03:01] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 4 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 4 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 4 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 6 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:03:02] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:03:03] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:03:03] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:03:03] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 3 ms to minimize.
[2024-05-31 20:03:03] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:03:07] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-31 20:03:08] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:03:09] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:03:10] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:03:11] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:03:12] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:19] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:03:20] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:03:20] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:03:20] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:03:39] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-31 20:03:41] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:03:41] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:03:41] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:03:41] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:03:42] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 60775 ms. Remains : 304/304 places, 294/294 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 208198 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(F(p0))&&F(p1)))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 312 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 307 transition count 297
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Applied a total of 31 rules in 69 ms. Remains 305 /320 variables (removed 15) and now considering 295/311 (removed 16) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-31 20:03:45] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:03:45] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 20:03:45] [INFO ] Invariant cache hit.
[2024-05-31 20:03:46] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 20:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 5 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 5 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 4 ms to minimize.
[2024-05-31 20:03:53] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 5 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 5 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 4 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 4 ms to minimize.
[2024-05-31 20:03:54] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 5 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 4 ms to minimize.
[2024-05-31 20:03:55] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 4 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:03:56] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 5 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:03:57] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:03] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:04:04] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:04:04] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:04:04] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:04:05] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:04:05] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:06] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:04:07] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:04:07] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:04:07] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
[2024-05-31 20:04:07] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 4 ms to minimize.
[2024-05-31 20:04:07] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-31 20:04:08] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:04:08] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 3 ms to minimize.
[2024-05-31 20:04:08] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:04:08] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 4 ms to minimize.
[2024-05-31 20:04:08] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2024-05-31 20:04:09] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 4 ms to minimize.
[2024-05-31 20:04:09] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:04:09] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 4 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:04:11] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:12] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:04:13] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:04:13] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:04:13] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:04:13] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:04:13] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:04:15] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 79 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 51/79 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 4 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:24] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2024-05-31 20:04:24] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:04:25] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:04:25] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 295/600 variables, 305/394 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 294/688 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:33] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:04:34] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:04:34] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 4 ms to minimize.
[2024-05-31 20:04:39] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:04:40] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 3 ms to minimize.
[2024-05-31 20:04:41] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 6/694 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:46] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 4 ms to minimize.
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 305/320 places, 295/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60911 ms. Remains : 305/320 places, 295/311 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-02
Stuttering criterion allowed to conclude after 195 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-02 finished in 61117 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&&X(p1)))&&X(F(p2)))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 39 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-31 20:04:46] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:04:46] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 20:04:46] [INFO ] Invariant cache hit.
[2024-05-31 20:04:47] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 20:04:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:04:53] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 6 ms to minimize.
[2024-05-31 20:04:54] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 5 ms to minimize.
[2024-05-31 20:04:54] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:04:54] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:04:54] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 4 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 5 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 4 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 4 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:04:56] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:04:56] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:04:56] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 5 ms to minimize.
[2024-05-31 20:04:57] [INFO ] Deduced a trap composed of 53 places in 249 ms of which 5 ms to minimize.
[2024-05-31 20:04:57] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 5 ms to minimize.
[2024-05-31 20:04:57] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 4 ms to minimize.
[2024-05-31 20:04:57] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:04:58] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:04:58] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2024-05-31 20:04:58] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:02] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:05:02] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:05:02] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:05:02] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:05:02] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:05:03] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:05:03] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:05:03] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 5 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 4 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:06] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:05:06] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:05:07] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:05:07] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 4 ms to minimize.
[2024-05-31 20:05:07] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:05:07] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:05:08] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:05:08] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:05:08] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:05:09] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:05:09] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 4 ms to minimize.
[2024-05-31 20:05:10] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:05:10] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:05:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:05:10] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:05:11] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:05:11] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:05:11] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:05:11] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:05:11] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:12] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:05:12] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:05:14] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2024-05-31 20:05:14] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.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 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.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 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 94 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:05:22] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 4 ms to minimize.
[2024-05-31 20:05:22] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:05:22] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:25] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:05:25] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:29] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:05:29] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-31 20:05:29] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:32] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:05:39] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:05:40] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 4 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 4 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 4 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 4 ms to minimize.
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 598/598 variables, and 707 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 82/82 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-03 finished in 61142 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(F(p0)))'
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 319 transition count 198
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 238 place count 207 transition count 184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 199 transition count 184
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 246 place count 199 transition count 145
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 329 place count 155 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 334 place count 155 transition count 135
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 483 place count 76 transition count 62
Applied a total of 483 rules in 64 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-31 20:05:47] [INFO ] Computed 20 invariants in 2 ms
[2024-05-31 20:05:47] [INFO ] Implicit Places using invariants in 153 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 158 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
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 14 place count 62 transition count 55
Applied a total of 14 rules in 10 ms. Remains 62 /69 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 62 cols
[2024-05-31 20:05:47] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 20:05:48] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 20:05:48] [INFO ] Invariant cache hit.
[2024-05-31 20:05:48] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/320 places, 55/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 582 ms. Remains : 62/320 places, 55/311 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-04
Product exploration explored 100000 steps with 5535 reset in 336 ms.
Product exploration explored 100000 steps with 5543 reset in 489 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2196 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (241 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 114239 steps, run visited all 1 properties in 278 ms. (steps per millisecond=410 )
Probabilistic random walk after 114239 steps, saw 21519 distinct states, run finished after 286 ms. (steps per millisecond=399 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-31 20:05:50] [INFO ] Invariant cache hit.
[2024-05-31 20:05:50] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 20:05:50] [INFO ] Invariant cache hit.
[2024-05-31 20:05:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 20:05:50] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-31 20:05:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-31 20:05:50] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 55/117 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 76 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 55/117 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 109 constraints, problems are : Problem set: 0 solved, 33 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 1914ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2108 ms. Remains : 62/62 places, 55/55 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2204 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (240 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 114239 steps, run visited all 1 properties in 204 ms. (steps per millisecond=559 )
Probabilistic random walk after 114239 steps, saw 21519 distinct states, run finished after 205 ms. (steps per millisecond=557 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5537 reset in 212 ms.
Product exploration explored 100000 steps with 5542 reset in 521 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-31 20:05:53] [INFO ] Invariant cache hit.
[2024-05-31 20:05:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 20:05:54] [INFO ] Invariant cache hit.
[2024-05-31 20:05:54] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-31 20:05:54] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-31 20:05:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-31 20:05:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 55/117 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 76 constraints, problems are : Problem set: 0 solved, 33 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 55/117 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 109 constraints, problems are : Problem set: 0 solved, 33 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1589 ms. Remains : 62/62 places, 55/55 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-04 finished in 7813 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(G((G(p0)||X((X(p2)&&p1)))))))'
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 312 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 308 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 306 transition count 296
Applied a total of 29 rules in 39 ms. Remains 306 /320 variables (removed 14) and now considering 296/311 (removed 15) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-31 20:05:55] [INFO ] Computed 28 invariants in 2 ms
[2024-05-31 20:05:55] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-31 20:05:55] [INFO ] Invariant cache hit.
[2024-05-31 20:05:56] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 20:05:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:02] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 6 ms to minimize.
[2024-05-31 20:06:03] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:06:03] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 4 ms to minimize.
[2024-05-31 20:06:03] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 4 ms to minimize.
[2024-05-31 20:06:03] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:06:04] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:06:04] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-05-31 20:06:04] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:06:04] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:06:05] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:06:05] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:06:05] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 5 ms to minimize.
[2024-05-31 20:06:05] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:06:06] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:06:06] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 4 ms to minimize.
[2024-05-31 20:06:06] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:06:06] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 5 ms to minimize.
[2024-05-31 20:06:07] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 4 ms to minimize.
[2024-05-31 20:06:07] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 4 ms to minimize.
[2024-05-31 20:06:07] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:12] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 4 ms to minimize.
[2024-05-31 20:06:13] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:06:13] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:14] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:06:15] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 4 ms to minimize.
[2024-05-31 20:06:15] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 4 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:06:16] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 4 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:06:17] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:06:19] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 4 ms to minimize.
[2024-05-31 20:06:19] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:21] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:06:21] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:06:21] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 4 ms to minimize.
[2024-05-31 20:06:22] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:06:22] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:06:22] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 74 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 46/74 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:30] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:06:30] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:06:31] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:34] [INFO ] Deduced a trap composed of 53 places in 231 ms of which 5 ms to minimize.
[2024-05-31 20:06:35] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:06:35] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:39] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:06:40] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:06:40] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:06:40] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 4 ms to minimize.
[2024-05-31 20:06:40] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-05-31 20:06:40] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:42] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:06:42] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:06:42] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:06:42] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:49] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:06:50] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:06:50] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:06:54] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:06:55] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
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 306/602 variables, and 96 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 0/295 constraints, Known Traps: 68/68 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 306/320 places, 296/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 306/320 places, 296/311 transitions.
Stuttering acceptance computed with spot in 469 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-05 finished in 61224 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 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 319 transition count 198
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 238 place count 207 transition count 184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 199 transition count 184
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 246 place count 199 transition count 145
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 329 place count 155 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 334 place count 155 transition count 136
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 342 place count 151 transition count 136
Performed 58 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 483 place count 76 transition count 62
Applied a total of 483 rules in 46 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-31 20:06:56] [INFO ] Computed 20 invariants in 1 ms
[2024-05-31 20:06:56] [INFO ] Implicit Places using invariants in 131 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 142 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 53
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 20 place count 59 transition count 52
Applied a total of 20 rules in 16 ms. Remains 59 /69 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 59 cols
[2024-05-31 20:06:56] [INFO ] Computed 13 invariants in 0 ms
[2024-05-31 20:06:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 20:06:57] [INFO ] Invariant cache hit.
[2024-05-31 20:06:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:06:57] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/320 places, 52/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 463 ms. Remains : 59/320 places, 52/311 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-06
Product exploration explored 100000 steps with 10631 reset in 470 ms.
Stack based approach found an accepted trace after 720 steps with 77 reset with depth 3 and stack size 3 in 5 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-06 finished in 1011 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)||X((p1&&G(p2)&&F(p3)))) U !p2))'
Support contains 2 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 319 transition count 201
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 120 rules applied. Total rules applied 229 place count 210 transition count 190
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 236 place count 204 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 203 transition count 189
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 237 place count 203 transition count 149
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 317 place count 163 transition count 149
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 323 place count 157 transition count 143
Iterating global reduction 4 with 6 rules applied. Total rules applied 329 place count 157 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 329 place count 157 transition count 138
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 339 place count 152 transition count 138
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 447 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 448 place count 97 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 452 place count 94 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 453 place count 93 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 453 place count 93 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 457 place count 91 transition count 73
Applied a total of 457 rules in 38 ms. Remains 91 /320 variables (removed 229) and now considering 73/311 (removed 238) transitions.
// Phase 1: matrix 73 rows 91 cols
[2024-05-31 20:06:57] [INFO ] Computed 25 invariants in 1 ms
[2024-05-31 20:06:57] [INFO ] Implicit Places using invariants in 97 ms returned [37, 51, 73, 79, 84, 90]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/320 places, 73/311 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 81 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 81 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 80 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 80 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 79 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 79 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 78 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 78 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 77 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 77 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 75 transition count 63
Applied a total of 20 rules in 11 ms. Remains 75 /85 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 75 cols
[2024-05-31 20:06:57] [INFO ] Computed 19 invariants in 0 ms
[2024-05-31 20:06:58] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 20:06:58] [INFO ] Invariant cache hit.
[2024-05-31 20:06:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-31 20:06:58] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 332 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/320 places, 63/311 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 62
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 2 place count 73 transition count 62
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 73 cols
[2024-05-31 20:06:58] [INFO ] Computed 18 invariants in 0 ms
[2024-05-31 20:06:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 20:06:58] [INFO ] Invariant cache hit.
[2024-05-31 20:06:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:06:58] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 73/320 places, 62/311 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 680 ms. Remains : 73/320 places, 62/311 transitions.
Stuttering acceptance computed with spot in 110 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-07
Product exploration explored 100000 steps with 15868 reset in 144 ms.
Product exploration explored 100000 steps with 15770 reset in 165 ms.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/73 stabilizing places and 4/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 8 factoid took 531 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
RANDOM walk for 3185 steps (125 resets) in 20 ms. (151 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 8 factoid took 793 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 150 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
[2024-05-31 20:07:00] [INFO ] Invariant cache hit.
[2024-05-31 20:07:00] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-31 20:07:00] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:07:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-31 20:07:01] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 20:07:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:07:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:07:01] [INFO ] Computed and/alt/rep : 53/128/53 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 20:07:01] [INFO ] Added : 37 causal constraints over 8 iterations in 111 ms. Result :sat
Could not prove EG p2
Support contains 2 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 20:07:01] [INFO ] Invariant cache hit.
[2024-05-31 20:07:01] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 20:07:01] [INFO ] Invariant cache hit.
[2024-05-31 20:07:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:07:01] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-31 20:07:01] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-31 20:07:01] [INFO ] Invariant cache hit.
[2024-05-31 20:07:01] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/73 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 20:07:02] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/135 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 107 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/73 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/135 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 15/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 53/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 160 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 3932ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4287 ms. Remains : 73/73 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 4 stable transitions
Computed a total of 7 stabilizing places and 4 stable transitions
Detected a total of 7/73 stabilizing places and 4/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 8 factoid took 665 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
RANDOM walk for 3940 steps (161 resets) in 41 ms. (93 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 8 factoid took 906 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Stuttering acceptance computed with spot in 146 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
[2024-05-31 20:07:07] [INFO ] Invariant cache hit.
[2024-05-31 20:07:07] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-31 20:07:07] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 20:07:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:07:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-31 20:07:07] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 20:07:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:07:07] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:07:07] [INFO ] Computed and/alt/rep : 53/128/53 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 20:07:07] [INFO ] Added : 37 causal constraints over 8 iterations in 105 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 146 ms :[p2, (NOT p0), (OR (NOT p0) p2)]
Product exploration explored 100000 steps with 15693 reset in 251 ms.
Product exploration explored 100000 steps with 15690 reset in 269 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 71 transition count 59
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 69 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 69 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 67 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 67 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 66 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12 place count 65 transition count 55
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 16 place count 63 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 18 place count 61 transition count 53
Applied a total of 18 rules in 15 ms. Remains 61 /73 variables (removed 12) and now considering 53/62 (removed 9) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-31 20:07:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 20:07:08] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 20:07:08] [INFO ] Invariant cache hit.
[2024-05-31 20:07:08] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-31 20:07:08] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-31 20:07:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 31 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 106 constraints, problems are : Problem set: 0 solved, 31 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 1846ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/73 places, 53/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2142 ms. Remains : 61/73 places, 53/62 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-07 finished in 13038 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((F(p0)||G((G((p1 U p0)) U (p0 U p2))))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 311 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 306 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 304 transition count 294
Applied a total of 33 rules in 46 ms. Remains 304 /320 variables (removed 16) and now considering 294/311 (removed 17) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-31 20:07:10] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:07:11] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 20:07:11] [INFO ] Invariant cache hit.
[2024-05-31 20:07:11] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 20:07:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:07:16] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 4 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:07:17] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:07:18] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:20] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:07:21] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:07:22] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:23] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 3 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 3 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:07:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:07:25] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:07:25] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:07:25] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 3 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:07:26] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:27] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:07:27] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:07:27] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:07:28] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:28] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:07:28] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:32] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:07:32] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:34] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:07:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:07:34] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:07:35] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:07:36] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 294/598 variables, 304/405 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 405 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:44] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:07:45] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-31 20:07:45] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/598 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 293/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 20:07:50] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:07:51] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:07:51] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:07:51] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 705 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 80/80 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 304/320 places, 294/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60833 ms. Remains : 304/320 places, 294/311 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-09 finished in 61052 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 U p1))))'
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 319 transition count 203
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 118 rules applied. Total rules applied 225 place count 212 transition count 192
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 232 place count 206 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 205 transition count 191
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 233 place count 205 transition count 152
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 311 place count 166 transition count 152
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 316 place count 161 transition count 147
Iterating global reduction 4 with 5 rules applied. Total rules applied 321 place count 161 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 321 place count 161 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 329 place count 157 transition count 143
Performed 58 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 445 place count 99 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 98 transition count 78
Applied a total of 447 rules in 25 ms. Remains 98 /320 variables (removed 222) and now considering 78/311 (removed 233) transitions.
// Phase 1: matrix 78 rows 98 cols
[2024-05-31 20:08:11] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 112 ms returned [33, 34, 38, 39, 40, 41, 42, 43, 57, 71, 77, 83, 89, 97]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 128 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/320 places, 78/311 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 71
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 77 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 72 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 72 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 71 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 71 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 70 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 70 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 69 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 69 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 68 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 68 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 67 transition count 61
Applied a total of 34 rules in 11 ms. Remains 67 /84 variables (removed 17) and now considering 61/78 (removed 17) transitions.
// Phase 1: matrix 61 rows 67 cols
[2024-05-31 20:08:12] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 20:08:12] [INFO ] Invariant cache hit.
[2024-05-31 20:08:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/320 places, 61/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 67/320 places, 61/311 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-10 finished in 427 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)))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 319 transition count 197
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 127 rules applied. Total rules applied 240 place count 206 transition count 183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 248 place count 198 transition count 183
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 248 place count 198 transition count 145
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 324 place count 160 transition count 145
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 330 place count 154 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 336 place count 154 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 336 place count 154 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 346 place count 149 transition count 134
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 460 place count 92 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 91 transition count 69
Reduce places removed 7 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 10 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 474 place count 81 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 474 place count 81 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 482 place count 77 transition count 62
Applied a total of 482 rules in 32 ms. Remains 77 /320 variables (removed 243) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 77 cols
[2024-05-31 20:08:12] [INFO ] Computed 21 invariants in 0 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 171 ms returned [30, 44, 58, 63, 67, 71, 76]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 173 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 53
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 20 place count 60 transition count 52
Applied a total of 20 rules in 6 ms. Remains 60 /70 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 60 cols
[2024-05-31 20:08:12] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:08:12] [INFO ] Invariant cache hit.
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/320 places, 52/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 60/320 places, 52/311 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-11
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-11 finished in 393 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(F(p0)))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 124 rules applied. Total rules applied 234 place count 209 transition count 186
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 243 place count 201 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 200 transition count 185
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 244 place count 200 transition count 146
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 322 place count 161 transition count 146
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 328 place count 155 transition count 140
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 155 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 334 place count 155 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 456 place count 94 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 93 transition count 71
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 469 place count 85 transition count 67
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 473 place count 81 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 473 place count 81 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 481 place count 77 transition count 63
Applied a total of 481 rules in 17 ms. Remains 77 /320 variables (removed 243) and now considering 63/311 (removed 248) transitions.
// Phase 1: matrix 63 rows 77 cols
[2024-05-31 20:08:12] [INFO ] Computed 20 invariants in 0 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 75 ms returned [29, 43, 57, 67, 71, 76]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 76 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/320 places, 63/311 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 61 transition count 53
Applied a total of 20 rules in 4 ms. Remains 61 /71 variables (removed 10) and now considering 53/63 (removed 10) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-31 20:08:12] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:08:12] [INFO ] Invariant cache hit.
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/320 places, 53/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 61/320 places, 53/311 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 4740 reset in 144 ms.
Product exploration explored 100000 steps with 4739 reset in 160 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 613 steps (26 resets) in 5 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 20:08:13] [INFO ] Invariant cache hit.
[2024-05-31 20:08:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:08:13] [INFO ] Invariant cache hit.
[2024-05-31 20:08:13] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-31 20:08:13] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-31 20:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 31 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 106 constraints, problems are : Problem set: 0 solved, 31 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1271ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1427 ms. Remains : 61/61 places, 53/53 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 579 steps (27 resets) in 6 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4701 reset in 148 ms.
Product exploration explored 100000 steps with 4730 reset in 165 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-31 20:08:15] [INFO ] Invariant cache hit.
[2024-05-31 20:08:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:08:16] [INFO ] Invariant cache hit.
[2024-05-31 20:08:16] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-31 20:08:16] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-31 20:08:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 75 constraints, problems are : Problem set: 0 solved, 31 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 53/114 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 106 constraints, problems are : Problem set: 0 solved, 31 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 61/61 places, 53/53 transitions.
Treatment of property AutoFlight-PT-04b-LTLFireability-13 finished in 4724 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(F((p0||((p1 U p2)&&G(p1))))))'
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 117 rules applied. Total rules applied 227 place count 209 transition count 193
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 231 place count 205 transition count 193
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 231 place count 205 transition count 152
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 313 place count 164 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 319 place count 158 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 325 place count 158 transition count 146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 325 place count 158 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 335 place count 153 transition count 141
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 449 place count 96 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 95 transition count 76
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 458 place count 89 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 460 place count 87 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 460 place count 87 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 468 place count 83 transition count 70
Applied a total of 468 rules in 16 ms. Remains 83 /320 variables (removed 237) and now considering 70/311 (removed 241) transitions.
// Phase 1: matrix 70 rows 83 cols
[2024-05-31 20:08:17] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:08:17] [INFO ] Implicit Places using invariants in 91 ms returned [35, 49, 63, 68, 72, 77, 82]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 92 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/320 places, 70/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 70 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 70 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 69 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 69 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 68 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 68 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 67 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 67 transition count 61
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 20 place count 66 transition count 60
Applied a total of 20 rules in 5 ms. Remains 66 /76 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 66 cols
[2024-05-31 20:08:17] [INFO ] Computed 15 invariants in 0 ms
[2024-05-31 20:08:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:08:17] [INFO ] Invariant cache hit.
[2024-05-31 20:08:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/320 places, 60/311 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 66/320 places, 60/311 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-15
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLFireability-15 finished in 468 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(F((X(F(p0))||G(p1)))))'
Found a Shortening insensitive property : AutoFlight-PT-04b-LTLFireability-01
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 123 rules applied. Total rules applied 233 place count 209 transition count 187
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 242 place count 201 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 200 transition count 186
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 243 place count 200 transition count 147
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 321 place count 161 transition count 147
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 328 place count 154 transition count 140
Iterating global reduction 4 with 7 rules applied. Total rules applied 335 place count 154 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 154 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 336 place count 154 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 57 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 12 rules applied. Total rules applied 471 place count 84 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 475 place count 80 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 475 place count 80 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 483 place count 76 transition count 62
Applied a total of 483 rules in 18 ms. Remains 76 /320 variables (removed 244) and now considering 62/311 (removed 249) transitions.
// Phase 1: matrix 62 rows 76 cols
[2024-05-31 20:08:18] [INFO ] Computed 20 invariants in 0 ms
[2024-05-31 20:08:18] [INFO ] Implicit Places using invariants in 86 ms returned [30, 44, 58, 62, 66, 70, 75]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 102 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 69/320 places, 62/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 53
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 20 place count 59 transition count 52
Applied a total of 20 rules in 4 ms. Remains 59 /69 variables (removed 10) and now considering 52/62 (removed 10) transitions.
// Phase 1: matrix 52 rows 59 cols
[2024-05-31 20:08:18] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 20:08:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:08:18] [INFO ] Invariant cache hit.
[2024-05-31 20:08:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 59/320 places, 52/311 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 276 ms. Remains : 59/320 places, 52/311 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLFireability-01
Stuttering criterion allowed to conclude after 2597 steps with 267 reset in 4 ms.
Treatment of property AutoFlight-PT-04b-LTLFireability-01 finished in 527 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(F(p0)))'
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)||X((p1&&G(p2)&&F(p3)))) U !p2))'
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(F(p0)))'
[2024-05-31 20:08:18] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:08:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 20:08:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 320 places, 311 transitions and 752 arcs took 23 ms.
Total runtime 615173 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-04b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-04b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-04b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-04b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717186860662

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-04b-LTLFireability-01
ltl formula formula --ltl=/tmp/3969/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 320 places, 311 transitions and 752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3969/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3969/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3969/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3969/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 321 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 321, there are 333 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~197 levels ~10000 states ~26172 transitions
pnml2lts-mc( 2/ 4): ~197 levels ~20000 states ~49472 transitions
pnml2lts-mc( 2/ 4): ~197 levels ~40000 states ~100060 transitions
pnml2lts-mc( 2/ 4): ~197 levels ~80000 states ~235660 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~160000 states ~442720 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~320000 states ~942660 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~640000 states ~1934448 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~1280000 states ~3983324 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~2560000 states ~8540764 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~5120000 states ~17655860 transitions
pnml2lts-mc( 1/ 4): ~208 levels ~10240000 states ~35820128 transitions
pnml2lts-mc( 0/ 4): ~196 levels ~20480000 states ~75980628 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~200!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 23440705
pnml2lts-mc( 0/ 4): unique states count: 23441431
pnml2lts-mc( 0/ 4): unique transitions count: 115065330
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 91614200
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 23441445
pnml2lts-mc( 0/ 4): - cum. max stack depth: 833
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23441445 states 115065368 transitions, fanout: 4.909
pnml2lts-mc( 0/ 4): Total exploration time 189.760 sec (189.760 sec minimum, 189.760 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123532, Transitions per second: 606373
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 183.4MB, 8.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 69.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 314 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 183.4MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-04b-LTLFireability-04
ltl formula formula --ltl=/tmp/3969/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 320 places, 311 transitions and 752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3969/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3969/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3969/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3969/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 321, there are 316 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~196 levels ~10000 states ~38196 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~20000 states ~81292 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~40000 states ~167120 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~80000 states ~360276 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~160000 states ~777168 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~320000 states ~1595780 transitions
pnml2lts-mc( 3/ 4): ~197 levels ~640000 states ~3189616 transitions
pnml2lts-mc( 3/ 4): ~197 levels ~1280000 states ~7323480 transitions
pnml2lts-mc( 3/ 4): ~197 levels ~2560000 states ~14990068 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~5120000 states ~31640584 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~10240000 states ~65289612 transitions
pnml2lts-mc( 3/ 4): ~202 levels ~20480000 states ~137840052 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33546783
pnml2lts-mc( 0/ 4): unique states count: 33547477
pnml2lts-mc( 0/ 4): unique transitions count: 246063089
pnml2lts-mc( 0/ 4): - self-loop count: 24
pnml2lts-mc( 0/ 4): - claim dead count: 212508674
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33547494
pnml2lts-mc( 0/ 4): - cum. max stack depth: 828
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547494 states 246063121 transitions, fanout: 7.335
pnml2lts-mc( 0/ 4): Total exploration time 281.460 sec (281.440 sec minimum, 281.448 sec on average)
pnml2lts-mc( 0/ 4): States per second: 119191, Transitions per second: 874238
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.1MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 314 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.1MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-04b-LTLFireability-07
ltl formula formula --ltl=/tmp/3969/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 320 places, 311 transitions and 752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3969/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3969/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3969/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3969/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 321, there are 325 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~192 levels ~10000 states ~24112 transitions
pnml2lts-mc( 2/ 4): ~192 levels ~20000 states ~48512 transitions
pnml2lts-mc( 1/ 4): ~238 levels ~40000 states ~90764 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~80000 states ~182556 transitions
pnml2lts-mc( 1/ 4): ~250 levels ~160000 states ~382356 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~273!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 308404
pnml2lts-mc( 0/ 4): unique states count: 309275
pnml2lts-mc( 0/ 4): unique transitions count: 839513
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 525186
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 309293
pnml2lts-mc( 0/ 4): - cum. max stack depth: 949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 309293 states 839552 transitions, fanout: 2.714
pnml2lts-mc( 0/ 4): Total exploration time 3.010 sec (3.010 sec minimum, 3.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 102755, Transitions per second: 278921
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.2MB, 10.5 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 314 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.2MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-04b-LTLFireability-13
ltl formula formula --ltl=/tmp/3969/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 320 places, 311 transitions and 752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3969/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3969/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3969/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3969/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 322 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 321, there are 328 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~198 levels ~10000 states ~37540 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~20000 states ~77196 transitions
pnml2lts-mc( 1/ 4): ~200 levels ~40000 states ~182008 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~80000 states ~338876 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~160000 states ~730696 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~320000 states ~1568064 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~640000 states ~3245048 transitions
pnml2lts-mc( 1/ 4): ~200 levels ~1280000 states ~7542700 transitions
pnml2lts-mc( 1/ 4): ~200 levels ~2560000 states ~16161960 transitions
pnml2lts-mc( 1/ 4): ~200 levels ~5120000 states ~32806672 transitions
pnml2lts-mc( 3/ 4): ~198 levels ~10240000 states ~66420488 transitions
pnml2lts-mc( 1/ 4): ~200 levels ~20480000 states ~146004520 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33547879
pnml2lts-mc( 0/ 4): unique states count: 33548593
pnml2lts-mc( 0/ 4): unique transitions count: 243419643
pnml2lts-mc( 0/ 4): - self-loop count: 25
pnml2lts-mc( 0/ 4): - claim dead count: 209865216
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33548610
pnml2lts-mc( 0/ 4): - cum. max stack depth: 839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33548610 states 243419678 transitions, fanout: 7.256
pnml2lts-mc( 0/ 4): Total exploration time 285.330 sec (285.320 sec minimum, 285.327 sec on average)
pnml2lts-mc( 0/ 4): States per second: 117578, Transitions per second: 853116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.6MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 314 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.6MB (~256.0MB paged-in)

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-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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