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.r070-tall-171620505700372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CircularTrains-PT-768, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 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 591K 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 CircularTrains-PT-768-LTLFireability-00
FORMULA_NAME CircularTrains-PT-768-LTLFireability-01
FORMULA_NAME CircularTrains-PT-768-LTLFireability-02
FORMULA_NAME CircularTrains-PT-768-LTLFireability-03
FORMULA_NAME CircularTrains-PT-768-LTLFireability-04
FORMULA_NAME CircularTrains-PT-768-LTLFireability-05
FORMULA_NAME CircularTrains-PT-768-LTLFireability-06
FORMULA_NAME CircularTrains-PT-768-LTLFireability-07
FORMULA_NAME CircularTrains-PT-768-LTLFireability-08
FORMULA_NAME CircularTrains-PT-768-LTLFireability-09
FORMULA_NAME CircularTrains-PT-768-LTLFireability-10
FORMULA_NAME CircularTrains-PT-768-LTLFireability-11
FORMULA_NAME CircularTrains-PT-768-LTLFireability-12
FORMULA_NAME CircularTrains-PT-768-LTLFireability-13
FORMULA_NAME CircularTrains-PT-768-LTLFireability-14
FORMULA_NAME CircularTrains-PT-768-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716290134082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 11:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 11:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:15:35] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 11:15:35] [INFO ] Transformed 1536 places.
[2024-05-21 11:15:35] [INFO ] Transformed 768 transitions.
[2024-05-21 11:15:35] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CircularTrains-PT-768-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 768/768 transitions.
Applied a total of 0 rules in 143 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-05-21 11:15:35] [INFO ] Computed 769 invariants in 97 ms
[2024-05-21 11:15:37] [INFO ] Implicit Places using invariants in 1552 ms returned [3, 14, 18, 29, 35, 45, 47, 59, 75, 79, 81, 83, 85, 90, 94, 96, 102, 106, 110, 125, 128, 138, 144, 149, 150, 152, 155, 158, 163, 173, 180, 187, 193, 196, 197, 198, 224, 228, 243, 244, 247, 248, 250, 255, 259, 273, 276, 296, 304, 312, 318, 325, 330, 333, 350, 353, 355, 368, 380, 381, 389, 402, 409, 414, 419, 420, 421, 438, 451, 453, 463, 464, 471, 473, 480, 499, 509, 516, 519, 530, 531, 533, 535, 544, 549, 557, 558, 561, 577, 578, 580, 600, 606, 612, 622, 630, 633, 656, 658, 661, 662, 665, 666, 669, 671, 677, 679, 681, 688, 689, 693, 694, 696, 697, 699, 705, 709, 711, 715, 716, 725, 732, 750, 761, 767, 770, 776, 780, 793, 804, 807, 810, 811, 817, 820, 839, 843, 846, 856, 872, 874, 883, 884, 885, 905, 929, 934, 940, 943, 948, 952, 953, 970, 973, 975, 977, 991, 997, 1005, 1009, 1013, 1017, 1018, 1019, 1020, 1042, 1046, 1059, 1071, 1072, 1073, 1078, 1079, 1087, 1088, 1094, 1096, 1101, 1121, 1128, 1131, 1147, 1153, 1157, 1160, 1162, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1228, 1229, 1244, 1247, 1252, 1261, 1262, 1266, 1273, 1292, 1299, 1300, 1301, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1493, 1495, 1497, 1507, 1512, 1513, 1515, 1517, 1525, 1527, 1531]
Discarding 249 places :
Implicit Place search using SMT only with invariants took 1593 ms to find 249 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1536 places, 768/768 transitions.
Applied a total of 0 rules in 105 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1867 ms. Remains : 1287/1536 places, 768/768 transitions.
Support contains 56 out of 1287 places after structural reductions.
[2024-05-21 11:15:37] [INFO ] Flatten gal took : 90 ms
[2024-05-21 11:15:37] [INFO ] Flatten gal took : 48 ms
[2024-05-21 11:15:38] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 54 out of 1287 places (down from 56) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 6867 steps (0 resets) in 1364 ms. (5 steps per ms) remains 0/26 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 48 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:15:38] [INFO ] Computed 520 invariants in 44 ms
[2024-05-21 11:15:39] [INFO ] Implicit Places using invariants in 808 ms returned [92, 285, 304, 794, 968, 1183]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 810 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 55 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 914 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03
Product exploration explored 100000 steps with 479 reset in 3903 ms.
Product exploration explored 100000 steps with 459 reset in 4032 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 20408 steps (4 resets) in 786 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:15:49] [INFO ] Computed 514 invariants in 9 ms
[2024-05-21 11:15:50] [INFO ] [Real]Absence check using 510 positive place invariants in 267 ms returned sat
[2024-05-21 11:15:50] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 99 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Real]Absence check using state equation in 8732 ms returned sat
[2024-05-21 11:15:59] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-21 11:16:04] [INFO ] Added : 15 causal constraints over 3 iterations in 4762 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:16:04] [INFO ] Invariant cache hit.
[2024-05-21 11:16:05] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-21 11:16:05] [INFO ] Invariant cache hit.
[2024-05-21 11:16:06] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:16:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 512 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 2/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2049 variables, 1281/1795 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 2307 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1281/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 62121 ms. Remains : 1281/1281 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 25232 steps (6 resets) in 890 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 11:17:08] [INFO ] Invariant cache hit.
[2024-05-21 11:17:09] [INFO ] [Real]Absence check using 510 positive place invariants in 265 ms returned sat
[2024-05-21 11:17:09] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 116 ms returned sat
[2024-05-21 11:17:17] [INFO ] [Real]Absence check using state equation in 8296 ms returned sat
[2024-05-21 11:17:18] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-21 11:17:22] [INFO ] Added : 15 causal constraints over 3 iterations in 4672 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 439 reset in 3784 ms.
Product exploration explored 100000 steps with 471 reset in 4056 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1281 transition count 768
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 252 place count 1281 transition count 768
Deduced a syphon composed of 254 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 255 rules in 281 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:17:31] [INFO ] Redundant transitions in 38 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:17:31] [INFO ] Computed 514 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 23 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 3 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 3 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 3 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 2 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 3 ms to minimize.
[2024-05-21 11:17:52] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 3 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 3 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 8 ms to minimize.
[2024-05-21 11:17:53] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-21 11:17:54] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-21 11:17:54] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 3 ms to minimize.
[2024-05-21 11:17:54] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-21 11:17:54] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:17:54] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 1 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 1 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:17:58] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 3 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-21 11:17:59] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-21 11:18:00] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 3 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 1 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 3 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-21 11:18:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 40 solved, 472 unsolved
Search for dead transitions found 40 dead transitions in 30174ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 728/768 transitions.
Graph (complete) has 2482 edges and 1281 vertex of which 1241 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 0 output transitions
Deduced a syphon composed of 215 places in 0 ms
Applied a total of 1 rules in 56 ms. Remains 1241 /1281 variables (removed 40) and now considering 728/728 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1241/1281 places, 728/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30559 ms. Remains : 1241/1281 places, 728/768 transitions.
Built C files in :
/tmp/ltsmin2186414618983339220
[2024-05-21 11:18:01] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2186414618983339220
Running compilation step : cd /tmp/ltsmin2186414618983339220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1818 ms.
Running link step : cd /tmp/ltsmin2186414618983339220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2186414618983339220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16645432868002579428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 45 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:18:17] [INFO ] Computed 514 invariants in 10 ms
[2024-05-21 11:18:17] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-21 11:18:17] [INFO ] Invariant cache hit.
[2024-05-21 11:18:18] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:18:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 512 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/4 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 510/1279 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 2/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2049 variables, 1281/1795 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 512/2307 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 2307 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1281/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin15400057088725754939
[2024-05-21 11:19:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15400057088725754939
Running compilation step : cd /tmp/ltsmin15400057088725754939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1767 ms.
Running link step : cd /tmp/ltsmin15400057088725754939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15400057088725754939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4106355908976550397.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:19:34] [INFO ] Flatten gal took : 39 ms
[2024-05-21 11:19:34] [INFO ] Flatten gal took : 46 ms
[2024-05-21 11:19:34] [INFO ] Time to serialize gal into /tmp/LTL3054078545835190098.gal : 19 ms
[2024-05-21 11:19:34] [INFO ] Time to serialize properties into /tmp/LTL12994437559816417675.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3054078545835190098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4669080676803974811.hoa' '-atoms' '/tmp/LTL12994437559816417675.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12994437559816417675.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4669080676803974811.hoa
Detected timeout of ITS tools.
[2024-05-21 11:19:49] [INFO ] Flatten gal took : 34 ms
[2024-05-21 11:19:49] [INFO ] Flatten gal took : 32 ms
[2024-05-21 11:19:49] [INFO ] Time to serialize gal into /tmp/LTL11179284192696142852.gal : 6 ms
[2024-05-21 11:19:49] [INFO ] Time to serialize properties into /tmp/LTL13310790856353808838.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11179284192696142852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13310790856353808838.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))")))))||(F("((Section_666<1)||(F667<1))"))))
Formula 0 simplified : XXXF!"(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))" & G!"((Section_666<1)||(F667<1))"
Detected timeout of ITS tools.
[2024-05-21 11:20:04] [INFO ] Flatten gal took : 30 ms
[2024-05-21 11:20:04] [INFO ] Applying decomposition
[2024-05-21 11:20:04] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7662016495715858738.txt' '-o' '/tmp/graph7662016495715858738.bin' '-w' '/tmp/graph7662016495715858738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7662016495715858738.bin' '-l' '-1' '-v' '-w' '/tmp/graph7662016495715858738.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:20:04] [INFO ] Decomposing Gal with order
[2024-05-21 11:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:20:04] [INFO ] Flatten gal took : 63 ms
[2024-05-21 11:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 11:20:04] [INFO ] Time to serialize gal into /tmp/LTL7144801225485753515.gal : 10 ms
[2024-05-21 11:20:04] [INFO ] Time to serialize properties into /tmp/LTL4827099096787424612.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7144801225485753515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4827099096787424612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i10.u125.Section_277>=1)&&(i10.u10.F278>=1))&&((i24.u187.F573>=1)&&(i24.u111.Section_572>=1)))")))))||(F("((i15.u225.S...193
Formula 0 simplified : XXXF!"(((i10.u125.Section_277>=1)&&(i10.u10.F278>=1))&&((i24.u187.F573>=1)&&(i24.u111.Section_572>=1)))" & G!"((i15.u225.Section_666...179
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 281043 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((G(X(p0)) U p1))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 480 place count 1047 transition count 519
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 88 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 11:20:20] [INFO ] Computed 520 invariants in 6 ms
[2024-05-21 11:20:20] [INFO ] Implicit Places using invariants in 712 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 713 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 30 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 831 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 2824 ms.
Product exploration explored 100000 steps with 0 reset in 3130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 442 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 2526 steps (0 resets) in 120 ms. (20 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 532 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:20:28] [INFO ] Computed 513 invariants in 9 ms
[2024-05-21 11:20:29] [INFO ] [Real]Absence check using 511 positive place invariants in 234 ms returned sat
[2024-05-21 11:20:29] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 32 ms returned sat
[2024-05-21 11:20:34] [INFO ] [Real]Absence check using state equation in 5485 ms returned sat
[2024-05-21 11:20:34] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 11:20:40] [INFO ] Added : 15 causal constraints over 3 iterations in 5316 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 36 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 11:20:40] [INFO ] Invariant cache hit.
[2024-05-21 11:20:40] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-21 11:20:40] [INFO ] Invariant cache hit.
[2024-05-21 11:20:41] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2024-05-21 11:20:41] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 timeout
0.0)
(s621 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 615 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 4211 steps (0 resets) in 215 ms. (19 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 776 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2024-05-21 11:21:44] [INFO ] Invariant cache hit.
[2024-05-21 11:21:44] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-05-21 11:21:44] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-21 11:21:50] [INFO ] [Real]Absence check using state equation in 5388 ms returned sat
[2024-05-21 11:21:50] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 11:21:55] [INFO ] Added : 15 causal constraints over 3 iterations in 5317 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2794 ms.
Product exploration explored 100000 steps with 0 reset in 3132 ms.
Built C files in :
/tmp/ltsmin6094400292834257137
[2024-05-21 11:22:01] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:22:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:01] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:22:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:01] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:22:01] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:22:01] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6094400292834257137
Running compilation step : cd /tmp/ltsmin6094400292834257137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1632 ms.
Running link step : cd /tmp/ltsmin6094400292834257137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6094400292834257137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12576351101522036226.hoa' '--buchi-type=spotba'
LTSmin run took 11187 ms.
FORMULA CircularTrains-PT-768-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-04 finished in 114750 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((p0 U (F(p1) U G(p2))))))'
Support contains 8 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:22:14] [INFO ] Computed 520 invariants in 14 ms
[2024-05-21 11:22:15] [INFO ] Implicit Places using invariants in 747 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 751 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 820 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-05
Product exploration explored 100000 steps with 156 reset in 3273 ms.
Product exploration explored 100000 steps with 142 reset in 3548 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
RANDOM walk for 14684 steps (2 resets) in 573 ms. (25 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2)]
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:22:24] [INFO ] Computed 513 invariants in 14 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 4 factoid took 523 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLFireability-05 finished in 10849 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)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:22:25] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 11:22:26] [INFO ] Implicit Places using invariants in 797 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 802 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 878 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07
Product exploration explored 100000 steps with 20334 reset in 3158 ms.
Product exploration explored 100000 steps with 19810 reset in 3440 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 491 steps (0 resets) in 38 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:22:34] [INFO ] Computed 513 invariants in 14 ms
[2024-05-21 11:22:34] [INFO ] Implicit Places using invariants in 737 ms returned []
[2024-05-21 11:22:34] [INFO ] Invariant cache hit.
[2024-05-21 11:22:35] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30075ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Finished structural reductions in LTL mode , in 1 iterations and 31887 ms. Remains : 1280/1280 places, 768/768 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 388 steps (0 resets) in 38 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21586 reset in 3156 ms.
Product exploration explored 100000 steps with 18422 reset in 3441 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 256 place count 1280 transition count 768
Deduced a syphon composed of 256 places in 0 ms
Applied a total of 256 rules in 100 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:23:13] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:23:13] [INFO ] Computed 513 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-21 11:23:24] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 3 ms to minimize.
[2024-05-21 11:23:24] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-21 11:23:24] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-21 11:23:24] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:23:24] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-21 11:23:25] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-21 11:23:26] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-05-21 11:23:35] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-21 11:23:35] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-21 11:23:35] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 1 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-05-21 11:23:36] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-21 11:23:37] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 1 ms to minimize.
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-21 11:23:38] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
[2024-05-21 11:23:39] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 2 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 11:23:40] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-21 11:23:41] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD488 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2048 variables, and 592 constraints, problems are : Problem set: 80 solved, 432 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 80 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 591/1279 variables, 511/511 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 80/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 11:23:48] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 11:23:49] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD153 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 11:23:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 11:23:52] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-05-21 11:23:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 11:23:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 11:23:53] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 11:23:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-21 11:23:54] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 11:23:55] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-21 11:23:55] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-21 11:23:55] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-21 11:23:55] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-05-21 11:23:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-21 11:23:56] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 11:23:57] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-21 11:23:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-05-21 11:24:00] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-21 11:24:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-21 11:24:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-21 11:24:02] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-21 11:24:02] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-21 11:24:02] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-21 11:24:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD303 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-05-21 11:24:06] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD309 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD326 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD339 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD345 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-21 11:24:10] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD350 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD354 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 3 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD359 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD364 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-05-21 11:24:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/2048 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60104ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60109ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 528/768 transitions.
Graph (complete) has 2080 edges and 1280 vertex of which 1040 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.3 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 1 rules in 33 ms. Remains 1040 /1280 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1040/1280 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60282 ms. Remains : 1040/1280 places, 528/768 transitions.
Built C files in :
/tmp/ltsmin14253885039712676352
[2024-05-21 11:24:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14253885039712676352
Running compilation step : cd /tmp/ltsmin14253885039712676352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin14253885039712676352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14253885039712676352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11674060164167283042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:24:29] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 11:24:29] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-21 11:24:29] [INFO ] Invariant cache hit.
[2024-05-21 11:24:31] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 1/1280 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/2048 variables, and 513 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 1/1280 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1280 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (OVERLAPS) 768/2048 variables, 1280/1793 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2048 variables, 512/2305 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2048/2048 variables, and 2305 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1280/1280 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 62095 ms. Remains : 1280/1280 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin3749017229142243579
[2024-05-21 11:25:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3749017229142243579
Running compilation step : cd /tmp/ltsmin3749017229142243579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1685 ms.
Running link step : cd /tmp/ltsmin3749017229142243579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3749017229142243579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2165002546289297014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:25:46] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:25:46] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:25:46] [INFO ] Time to serialize gal into /tmp/LTL5234143028513338976.gal : 5 ms
[2024-05-21 11:25:46] [INFO ] Time to serialize properties into /tmp/LTL9370398037981215283.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5234143028513338976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15713251659173738572.hoa' '-atoms' '/tmp/LTL9370398037981215283.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9370398037981215283.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15713251659173738572.hoa
Detected timeout of ITS tools.
[2024-05-21 11:26:01] [INFO ] Flatten gal took : 35 ms
[2024-05-21 11:26:01] [INFO ] Flatten gal took : 30 ms
[2024-05-21 11:26:01] [INFO ] Time to serialize gal into /tmp/LTL14807867373848198964.gal : 4 ms
[2024-05-21 11:26:01] [INFO ] Time to serialize properties into /tmp/LTL995584210207231488.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14807867373848198964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL995584210207231488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_675>=1)&&(F676>=1))"))))
Formula 0 simplified : XG!"((Section_675>=1)&&(F676>=1))"
Detected timeout of ITS tools.
[2024-05-21 11:26:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 11:26:16] [INFO ] Applying decomposition
[2024-05-21 11:26:16] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3774231674954970647.txt' '-o' '/tmp/graph3774231674954970647.bin' '-w' '/tmp/graph3774231674954970647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3774231674954970647.bin' '-l' '-1' '-v' '-w' '/tmp/graph3774231674954970647.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:26:16] [INFO ] Decomposing Gal with order
[2024-05-21 11:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:26:16] [INFO ] Flatten gal took : 30 ms
[2024-05-21 11:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 11:26:16] [INFO ] Time to serialize gal into /tmp/LTL17484802604888171047.gal : 8 ms
[2024-05-21 11:26:16] [INFO ] Time to serialize properties into /tmp/LTL3635354015095388869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17484802604888171047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3635354015095388869.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("((i18.i0.i1.u32.Section_675>=1)&&(i18.i0.i1.u32.F676>=1))"))))
Formula 0 simplified : XG!"((i18.i0.i1.u32.Section_675>=1)&&(i18.i0.i1.u32.F676>=1))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 246365 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(p1)))&&G(F(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:26:31] [INFO ] Computed 520 invariants in 17 ms
[2024-05-21 11:26:32] [INFO ] Implicit Places using invariants in 740 ms returned [92, 285, 304, 743, 794, 968]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 741 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 811 ms. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2659 ms.
Product exploration explored 100000 steps with 0 reset in 2970 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 459 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 3250 steps (0 resets) in 134 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 550 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:26:40] [INFO ] Computed 514 invariants in 11 ms
[2024-05-21 11:26:41] [INFO ] [Real]Absence check using 511 positive place invariants in 248 ms returned sat
[2024-05-21 11:26:41] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 119 ms returned sat
[2024-05-21 11:26:47] [INFO ] [Real]Absence check using state equation in 6293 ms returned sat
[2024-05-21 11:26:48] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-21 11:26:53] [INFO ] Added : 15 causal constraints over 3 iterations in 5187 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-21 11:26:53] [INFO ] Invariant cache hit.
[2024-05-21 11:26:54] [INFO ] [Real]Absence check using 511 positive place invariants in 265 ms returned sat
[2024-05-21 11:26:54] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 129 ms returned sat
[2024-05-21 11:27:04] [INFO ] [Real]Absence check using state equation in 9772 ms returned sat
[2024-05-21 11:27:04] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-21 11:27:08] [INFO ] Added : 10 causal constraints over 2 iterations in 4007 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:27:08] [INFO ] Invariant cache hit.
[2024-05-21 11:27:08] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-21 11:27:08] [INFO ] Invariant cache hit.
[2024-05-21 11:27:09] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30073ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30078ms
Finished structural reductions in LTL mode , in 1 iterations and 31890 ms. Remains : 1281/1281 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 277 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1961 steps (0 resets) in 95 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 427 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2024-05-21 11:27:41] [INFO ] Invariant cache hit.
[2024-05-21 11:27:42] [INFO ] [Real]Absence check using 511 positive place invariants in 262 ms returned sat
[2024-05-21 11:27:42] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 127 ms returned sat
[2024-05-21 11:27:56] [INFO ] [Real]Absence check using state equation in 14045 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 11:27:56] [INFO ] Invariant cache hit.
[2024-05-21 11:27:57] [INFO ] [Real]Absence check using 511 positive place invariants in 261 ms returned sat
[2024-05-21 11:27:57] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 127 ms returned sat
[2024-05-21 11:28:07] [INFO ] [Real]Absence check using state equation in 9923 ms returned sat
[2024-05-21 11:28:07] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-21 11:28:11] [INFO ] Added : 10 causal constraints over 2 iterations in 4020 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2733 ms.
Product exploration explored 100000 steps with 0 reset in 2939 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Performed 254 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 254 rules applied. Total rules applied 254 place count 1281 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 1281 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 97 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:28:18] [INFO ] Redundant transitions in 7 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:28:18] [INFO ] Computed 514 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-21 11:28:28] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 3 ms to minimize.
[2024-05-21 11:28:29] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 3 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-21 11:28:30] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-21 11:28:31] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
[2024-05-21 11:28:31] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-05-21 11:28:40] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-21 11:28:40] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-21 11:28:40] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 11:28:40] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-05-21 11:28:40] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
[2024-05-21 11:28:41] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 2 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-21 11:28:42] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:28:43] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD504 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2049 variables, and 592 constraints, problems are : Problem set: 80 solved, 432 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/3 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 80 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 590/1279 variables, 511/511 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 80/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-05-21 11:28:52] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2024-05-21 11:28:52] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 11:28:53] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 11:28:54] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 11:28:55] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 11:28:56] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 11:28:57] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 11:28:57] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 11:28:57] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 11:28:57] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-21 11:28:57] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 11:28:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-21 11:28:59] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-21 11:29:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-21 11:29:02] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-21 11:29:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD304 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD309 is UNSAT
[2024-05-21 11:29:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-05-21 11:29:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-05-21 11:29:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-05-21 11:29:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD315 is UNSAT
[2024-05-21 11:29:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD323 is UNSAT
[2024-05-21 11:29:13] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD327 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD331 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD334 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD340 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD351 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD360 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-05-21 11:29:14] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD368 is UNSAT
[2024-05-21 11:29:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/2049 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/3 constraints, State Equation: 0/1281 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60104ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60111ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1281/1281 places, 528/768 transitions.
Graph (complete) has 2082 edges and 1281 vertex of which 1041 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.4 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 1 rules in 44 ms. Remains 1041 /1281 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1041/1281 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60268 ms. Remains : 1041/1281 places, 528/768 transitions.
Built C files in :
/tmp/ltsmin65765124090313218
[2024-05-21 11:29:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin65765124090313218
Running compilation step : cd /tmp/ltsmin65765124090313218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1687 ms.
Running link step : cd /tmp/ltsmin65765124090313218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin65765124090313218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2701402844066442943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1281/1281 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1281 cols
[2024-05-21 11:29:33] [INFO ] Computed 514 invariants in 16 ms
[2024-05-21 11:29:34] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-21 11:29:34] [INFO ] Invariant cache hit.
[2024-05-21 11:29:35] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 510/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30082ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30088ms
Finished structural reductions in LTL mode , in 1 iterations and 31990 ms. Remains : 1281/1281 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin8551661392212205015
[2024-05-21 11:30:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8551661392212205015
Running compilation step : cd /tmp/ltsmin8551661392212205015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1707 ms.
Running link step : cd /tmp/ltsmin8551661392212205015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8551661392212205015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4707132886336268480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:30:20] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:30:20] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:30:20] [INFO ] Time to serialize gal into /tmp/LTL10306712980561970107.gal : 4 ms
[2024-05-21 11:30:20] [INFO ] Time to serialize properties into /tmp/LTL1840413955844616076.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10306712980561970107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2434245312871140800.hoa' '-atoms' '/tmp/LTL1840413955844616076.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1840413955844616076.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2434245312871140800.hoa
Detected timeout of ITS tools.
[2024-05-21 11:30:35] [INFO ] Flatten gal took : 22 ms
[2024-05-21 11:30:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 11:30:35] [INFO ] Time to serialize gal into /tmp/LTL4151518757112355269.gal : 4 ms
[2024-05-21 11:30:35] [INFO ] Time to serialize properties into /tmp/LTL15263449653326716245.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4151518757112355269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15263449653326716245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(("((F403<1)||(Section_402<1))")&&(G("((Section_97>=1)&&(F98>=1))"))))&&(G(F("(((F403>=1)&&(Section_402>=1))||((Section_294>=1)...175
Formula 0 simplified : X(G(!"((F403<1)||(Section_402<1))" | F!"((Section_97>=1)&&(F98>=1))") | FG!"(((F403>=1)&&(Section_402>=1))||((Section_294>=1)&&(F295...163
Detected timeout of ITS tools.
[2024-05-21 11:30:51] [INFO ] Flatten gal took : 22 ms
[2024-05-21 11:30:51] [INFO ] Applying decomposition
[2024-05-21 11:30:51] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15182978030718778539.txt' '-o' '/tmp/graph15182978030718778539.bin' '-w' '/tmp/graph15182978030718778539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15182978030718778539.bin' '-l' '-1' '-v' '-w' '/tmp/graph15182978030718778539.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:30:51] [INFO ] Decomposing Gal with order
[2024-05-21 11:30:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:30:51] [INFO ] Flatten gal took : 30 ms
[2024-05-21 11:30:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 11:30:51] [INFO ] Time to serialize gal into /tmp/LTL8437817790172062442.gal : 7 ms
[2024-05-21 11:30:51] [INFO ] Time to serialize properties into /tmp/LTL12623750029539391083.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8437817790172062442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12623750029539391083.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i2.u141.F403<1)||(i2.u141.Section_402<1))")&&(G("((i16.u74.Section_97>=1)&&(i16.u8.F98>=1))"))))&&(G(F("(((i2.u141.F403>=1...238
Formula 0 simplified : X(G(!"((i2.u141.F403<1)||(i2.u141.Section_402<1))" | F!"((i16.u74.Section_97>=1)&&(i16.u8.F98>=1))") | FG!"(((i2.u141.F403>=1)&&(i2....226
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 274404 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((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1047 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 66 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 11:31:06] [INFO ] Computed 520 invariants in 6 ms
[2024-05-21 11:31:06] [INFO ] Implicit Places using invariants in 646 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 647 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 739 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-10
Product exploration explored 100000 steps with 339 reset in 3747 ms.
Product exploration explored 100000 steps with 347 reset in 4043 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 644 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 1442 ms. (27 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:31:16] [INFO ] Computed 513 invariants in 10 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/1536 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 871 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-05-21 11:31:17] [INFO ] Invariant cache hit.
[2024-05-21 11:31:18] [INFO ] [Real]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-21 11:31:18] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 72 ms returned sat
[2024-05-21 11:31:21] [INFO ] [Real]Absence check using state equation in 2750 ms returned sat
[2024-05-21 11:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:31:21] [INFO ] [Nat]Absence check using 511 positive place invariants in 213 ms returned sat
[2024-05-21 11:31:21] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 59 ms returned sat
[2024-05-21 11:31:30] [INFO ] [Nat]Absence check using state equation in 8416 ms returned sat
[2024-05-21 11:31:30] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-21 11:31:33] [INFO ] Added : 5 causal constraints over 1 iterations in 2964 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 31 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 11:31:33] [INFO ] Invariant cache hit.
[2024-05-21 11:31:34] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-21 11:31:34] [INFO ] Invariant cache hit.
[2024-05-21 11:31:34] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-05-21 11:31:34] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61779 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 650 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 2962 steps (0 resets) in 141 ms. (20 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p2) (NOT p1))))), (F (NOT p1)), (F p0), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 2 factoid took 839 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
[2024-05-21 11:32:37] [INFO ] Invariant cache hit.
[2024-05-21 11:32:37] [INFO ] [Real]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-21 11:32:38] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-21 11:32:40] [INFO ] [Real]Absence check using state equation in 2909 ms returned sat
[2024-05-21 11:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:32:41] [INFO ] [Nat]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-21 11:32:41] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 61 ms returned sat
[2024-05-21 11:32:50] [INFO ] [Nat]Absence check using state equation in 8472 ms returned sat
[2024-05-21 11:32:50] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 11:32:53] [INFO ] Added : 5 causal constraints over 1 iterations in 2975 ms. Result :sat
Could not prove EG (AND (NOT p2) p1 (NOT p0))
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) p1 (NOT p0)), (OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p2) p1 (NOT p0)))]
Product exploration explored 100000 steps with 337 reset in 3804 ms.
Product exploration explored 100000 steps with 329 reset in 4104 ms.
Built C files in :
/tmp/ltsmin14337297253053158980
[2024-05-21 11:33:01] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:33:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:33:01] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:33:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:33:01] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:33:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:33:01] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14337297253053158980
Running compilation step : cd /tmp/ltsmin14337297253053158980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1512 ms.
Running link step : cd /tmp/ltsmin14337297253053158980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14337297253053158980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10134825401347567096.hoa' '--buchi-type=spotba'
LTSmin run took 11684 ms.
FORMULA CircularTrains-PT-768-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-10 finished in 128244 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 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1287 transition count 526
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 71 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-21 11:33:14] [INFO ] Computed 520 invariants in 12 ms
[2024-05-21 11:33:15] [INFO ] Implicit Places using invariants in 728 ms returned [76, 227, 242, 594, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 729 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 826 ms. Remains : 1026/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-11
Product exploration explored 100000 steps with 588 reset in 3879 ms.
Product exploration explored 100000 steps with 516 reset in 4132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 1219 steps (0 resets) in 78 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 376 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 11:33:24] [INFO ] Computed 514 invariants in 7 ms
[2024-05-21 11:33:25] [INFO ] [Real]Absence check using 510 positive place invariants in 242 ms returned sat
[2024-05-21 11:33:25] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 74 ms returned sat
[2024-05-21 11:33:35] [INFO ] [Real]Absence check using state equation in 9819 ms returned sat
[2024-05-21 11:33:35] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-21 11:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:33:40] [INFO ] [Nat]Absence check using 510 positive place invariants in 231 ms returned sat
[2024-05-21 11:33:40] [INFO ] [Nat]Absence check using 510 positive and 4 generalized place invariants in 117 ms returned sat
[2024-05-21 11:33:46] [INFO ] [Nat]Absence check using state equation in 6293 ms returned sat
[2024-05-21 11:33:46] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 11:33:53] [INFO ] Added : 25 causal constraints over 5 iterations in 7214 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 32 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 11:33:53] [INFO ] Invariant cache hit.
[2024-05-21 11:33:54] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-21 11:33:54] [INFO ] Invariant cache hit.
[2024-05-21 11:33:55] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-05-21 11:33:55] [INFO ] Redundant transitions in 3 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 11:33:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61602 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 782 steps (0 resets) in 49 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-21 11:34:56] [INFO ] Invariant cache hit.
[2024-05-21 11:34:57] [INFO ] [Real]Absence check using 510 positive place invariants in 231 ms returned sat
[2024-05-21 11:34:57] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 99 ms returned sat
[2024-05-21 11:35:01] [INFO ] [Real]Absence check using state equation in 3972 ms returned sat
[2024-05-21 11:35:01] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 11:35:11] [INFO ] Added : 45 causal constraints over 9 iterations in 10108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 527 reset in 3786 ms.
Product exploration explored 100000 steps with 524 reset in 4085 ms.
Built C files in :
/tmp/ltsmin3084403028394241026
[2024-05-21 11:35:19] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 11:35:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:35:19] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 11:35:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:35:19] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 11:35:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:35:19] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3084403028394241026
Running compilation step : cd /tmp/ltsmin3084403028394241026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1489 ms.
Running link step : cd /tmp/ltsmin3084403028394241026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3084403028394241026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15462398567829904355.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 11:35:34] [INFO ] Invariant cache hit.
[2024-05-21 11:35:34] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-21 11:35:34] [INFO ] Invariant cache hit.
[2024-05-21 11:35:35] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2024-05-21 11:35:35] [INFO ] Redundant transitions in 3 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 11:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 510/510 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61589 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin486707482359499624
[2024-05-21 11:36:35] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 11:36:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:36:35] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 11:36:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:36:35] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 11:36:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:36:35] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin486707482359499624
Running compilation step : cd /tmp/ltsmin486707482359499624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1498 ms.
Running link step : cd /tmp/ltsmin486707482359499624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin486707482359499624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11153260745586838955.hoa' '--buchi-type=spotba'
LTSmin run took 13366 ms.
FORMULA CircularTrains-PT-768-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLFireability-11 finished in 216367 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&&F(p1)&&X(F((p2||G(!p1)))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:36:50] [INFO ] Computed 520 invariants in 14 ms
[2024-05-21 11:36:51] [INFO ] Implicit Places using invariants in 776 ms returned [92, 743, 794, 968, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 780 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 863 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12
Product exploration explored 100000 steps with 191 reset in 3374 ms.
Product exploration explored 100000 steps with 190 reset in 3623 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 662 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 6943 steps (1 resets) in 272 ms. (25 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 3 factoid took 703 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 11:37:01] [INFO ] Computed 515 invariants in 19 ms
[2024-05-21 11:37:02] [INFO ] [Real]Absence check using 511 positive place invariants in 271 ms returned sat
[2024-05-21 11:37:02] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 99 ms returned sat
[2024-05-21 11:37:16] [INFO ] [Real]Absence check using state equation in 14080 ms returned unknown
Could not prove EG (AND (NOT p2) p1)
Support contains 4 out of 1282 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 : 1282/1282 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1282 transition count 518
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 1032 transition count 518
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 500 place count 1032 transition count 516
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 504 place count 1030 transition count 516
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 508 place count 1028 transition count 514
Applied a total of 508 rules in 54 ms. Remains 1028 /1282 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1028 cols
[2024-05-21 11:37:16] [INFO ] Computed 515 invariants in 11 ms
[2024-05-21 11:37:17] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-21 11:37:17] [INFO ] Invariant cache hit.
[2024-05-21 11:37:18] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2024-05-21 11:37:18] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-21 11:37:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 1543 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 258/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 1801 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1028/1282 places, 514/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61624 ms. Remains : 1028/1282 places, 514/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 449 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 3188 steps (0 resets) in 134 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 794 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-21 11:38:20] [INFO ] Invariant cache hit.
[2024-05-21 11:38:21] [INFO ] [Real]Absence check using 511 positive place invariants in 244 ms returned sat
[2024-05-21 11:38:21] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 87 ms returned sat
[2024-05-21 11:38:25] [INFO ] [Real]Absence check using state equation in 4408 ms returned sat
[2024-05-21 11:38:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:38:26] [INFO ] [Nat]Absence check using 511 positive place invariants in 242 ms returned sat
[2024-05-21 11:38:26] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 11:38:37] [INFO ] [Nat]Absence check using state equation in 11378 ms returned sat
[2024-05-21 11:38:37] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-21 11:38:40] [INFO ] Added : 15 causal constraints over 3 iterations in 2897 ms. Result :unknown
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 169 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 383 reset in 3741 ms.
Product exploration explored 100000 steps with 368 reset in 4032 ms.
Built C files in :
/tmp/ltsmin15833457964058552904
[2024-05-21 11:38:48] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 11:38:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:38:48] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 11:38:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:38:48] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 11:38:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:38:48] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15833457964058552904
Running compilation step : cd /tmp/ltsmin15833457964058552904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1507 ms.
Running link step : cd /tmp/ltsmin15833457964058552904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15833457964058552904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased237218789031888404.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 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 1028 transition count 513
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 1027 transition count 513
Applied a total of 2 rules in 33 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-21 11:39:03] [INFO ] Computed 515 invariants in 14 ms
[2024-05-21 11:39:04] [INFO ] Implicit Places using invariants in 677 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 678 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 734 ms. Remains : 1026/1028 places, 513/514 transitions.
Built C files in :
/tmp/ltsmin18242515446237554722
[2024-05-21 11:39:04] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 11:39:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:04] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 11:39:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:04] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 11:39:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:39:04] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18242515446237554722
Running compilation step : cd /tmp/ltsmin18242515446237554722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1537 ms.
Running link step : cd /tmp/ltsmin18242515446237554722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18242515446237554722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16590336554470450842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:39:19] [INFO ] Flatten gal took : 17 ms
[2024-05-21 11:39:19] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:39:19] [INFO ] Time to serialize gal into /tmp/LTL3914012989567938825.gal : 3 ms
[2024-05-21 11:39:19] [INFO ] Time to serialize properties into /tmp/LTL8950539947751041346.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3914012989567938825.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4962028975676322852.hoa' '-atoms' '/tmp/LTL8950539947751041346.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8950539947751041346.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4962028975676322852.hoa
Detected timeout of ITS tools.
[2024-05-21 11:39:34] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:39:34] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:39:34] [INFO ] Time to serialize gal into /tmp/LTL13440620924518210341.gal : 3 ms
[2024-05-21 11:39:34] [INFO ] Time to serialize properties into /tmp/LTL8062649727167142230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13440620924518210341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8062649727167142230.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F446<1)||(Section_445<1))"))&&(X(F(("((F477>=1)&&(Section_476>=1))")||(G("((F446>=1)&&(Section_445>=1))"))))))&&("((F2<1)|...175
Formula 0 simplified : G(!"((F2<1)||(Section_1<1))" | G!"((F446<1)||(Section_445<1))" | XG(!"((F477>=1)&&(Section_476>=1))" & F!"((F446>=1)&&(Section_445>=...161
Detected timeout of ITS tools.
[2024-05-21 11:39:49] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:39:49] [INFO ] Applying decomposition
[2024-05-21 11:39:49] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7817602192640684447.txt' '-o' '/tmp/graph7817602192640684447.bin' '-w' '/tmp/graph7817602192640684447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7817602192640684447.bin' '-l' '-1' '-v' '-w' '/tmp/graph7817602192640684447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:39:49] [INFO ] Decomposing Gal with order
[2024-05-21 11:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:39:49] [INFO ] Flatten gal took : 25 ms
[2024-05-21 11:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:39:49] [INFO ] Time to serialize gal into /tmp/LTL14437246306929131217.gal : 7 ms
[2024-05-21 11:39:49] [INFO ] Time to serialize properties into /tmp/LTL5802832741344688177.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14437246306929131217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5802832741344688177.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i6.u238.F446<1)||(i6.u238.Section_445<1))"))&&(X(F(("((i28.u104.F477>=1)&&(i28.u393.Section_476>=1))")||(G("((i6.u238.F446...259
Formula 0 simplified : G(!"((i9.i1.i0.i1.u466.F2<1)||(i9.i1.i0.i1.u466.Section_1<1))" | G!"((i6.u238.F446<1)||(i6.u238.Section_445<1))" | XG(!"((i28.u104.F...245
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 194125 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||F(p2))))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 31 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:40:05] [INFO ] Computed 520 invariants in 19 ms
[2024-05-21 11:40:05] [INFO ] Implicit Places using invariants in 748 ms returned [285, 304, 743, 794, 1183]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 749 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1287 places, 768/768 transitions.
Applied a total of 0 rules in 33 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 814 ms. Remains : 1282/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-13
Product exploration explored 100000 steps with 20028 reset in 3829 ms.
Product exploration explored 100000 steps with 20649 reset in 4142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 388 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 3528 steps (0 resets) in 146 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 509 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 1282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 11:40:15] [INFO ] Computed 515 invariants in 13 ms
[2024-05-21 11:40:16] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-05-21 11:40:16] [INFO ] Invariant cache hit.
[2024-05-21 11:40:17] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 61912 ms. Remains : 1282/1282 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 315 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 7438 steps (1 resets) in 256 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 359 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20888 reset in 3837 ms.
Product exploration explored 100000 steps with 21555 reset in 4087 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 1282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1282 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 254 place count 1282 transition count 768
Deduced a syphon composed of 254 places in 0 ms
Applied a total of 254 rules in 109 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:41:27] [INFO ] Redundant transitions in 8 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 11:41:27] [INFO ] Computed 515 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-21 11:41:47] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 2 ms to minimize.
[2024-05-21 11:41:47] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 3 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 2 ms to minimize.
[2024-05-21 11:41:48] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-21 11:41:49] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 20/534 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-21 11:41:50] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 1 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-21 11:41:51] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 11:41:52] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD510 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 20/554 constraints. Problems are: Problem set: 39 solved, 473 unsolved
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 3 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:41:56] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 2 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 11:41:57] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/574 constraints. Problems are: Problem set: 59 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 574 constraints, problems are : Problem set: 59 solved, 453 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 59 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 1/1 constraints. Problems are: Problem set: 59 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 0/1 constraints. Problems are: Problem set: 59 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 570/1281 variables, 512/513 constraints. Problems are: Problem set: 59 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 59 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 60/574 constraints. Problems are: Problem set: 59 solved, 453 unsolved
[2024-05-21 11:42:02] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 11:42:02] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-21 11:42:02] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 2 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 2 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:42:03] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1281 variables, 20/594 constraints. Problems are: Problem set: 79 solved, 433 unsolved
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 11:42:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 3 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 20/614 constraints. Problems are: Problem set: 99 solved, 413 unsolved
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 11:42:05] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD490 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 20/634 constraints. Problems are: Problem set: 119 solved, 393 unsolved
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 11:42:06] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 11:42:07] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 11:42:08] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 20/654 constraints. Problems are: Problem set: 139 solved, 373 unsolved
[2024-05-21 11:42:08] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 11:42:08] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 11:42:08] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 11:42:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 11:42:10] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-21 11:42:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 20/674 constraints. Problems are: Problem set: 159 solved, 353 unsolved
[2024-05-21 11:42:11] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 11:42:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-21 11:42:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-21 11:42:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-21 11:42:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-05-21 11:42:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-21 11:42:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-05-21 11:42:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD204 is UNSAT
[2024-05-21 11:42:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-05-21 11:42:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1281 variables, 20/694 constraints. Problems are: Problem set: 179 solved, 333 unsolved
[2024-05-21 11:42:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-21 11:42:15] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-21 11:42:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-21 11:42:15] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD247 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-21 11:42:16] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1281 variables, 20/714 constraints. Problems are: Problem set: 199 solved, 313 unsolved
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-21 11:42:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD271 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD272 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD307 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD310 is UNSAT
[2024-05-21 11:42:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 20/734 constraints. Problems are: Problem set: 219 solved, 293 unsolved
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD316 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD324 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD328 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD334 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD341 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD347 is UNSAT
[2024-05-21 11:42:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD348 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD352 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD357 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD358 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD361 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD367 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD369 is UNSAT
[2024-05-21 11:42:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1281 variables, 20/754 constraints. Problems are: Problem set: 239 solved, 273 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/2050 variables, and 754 constraints, problems are : Problem set: 239 solved, 273 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60110ms problems are : Problem set: 239 solved, 273 unsolved
Search for dead transitions found 239 dead transitions in 60115ms
Found 239 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 239 transitions
Dead transitions reduction (with SMT) removed 239 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/1282 places, 529/768 transitions.
Graph (complete) has 2086 edges and 1282 vertex of which 1043 are kept as prefixes of interest. Removing 239 places using SCC suffix rule.2 ms
Discarding 239 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 1 ms
Applied a total of 1 rules in 27 ms. Remains 1043 /1282 variables (removed 239) and now considering 529/529 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1043/1282 places, 529/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60276 ms. Remains : 1043/1282 places, 529/768 transitions.
Built C files in :
/tmp/ltsmin11891116310322473970
[2024-05-21 11:42:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11891116310322473970
Running compilation step : cd /tmp/ltsmin11891116310322473970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1702 ms.
Running link step : cd /tmp/ltsmin11891116310322473970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11891116310322473970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15204567837961294022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 43 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 11:42:43] [INFO ] Computed 515 invariants in 18 ms
[2024-05-21 11:42:43] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-21 11:42:43] [INFO ] Invariant cache hit.
[2024-05-21 11:42:44] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.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 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.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 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 1.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 0.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)timeout

(s726 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 512/513 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 512/512 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 61937 ms. Remains : 1282/1282 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin8335762984834680103
[2024-05-21 11:43:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8335762984834680103
Running compilation step : cd /tmp/ltsmin8335762984834680103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1713 ms.
Running link step : cd /tmp/ltsmin8335762984834680103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8335762984834680103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10901442263775499603.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:44:00] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:44:00] [INFO ] Flatten gal took : 18 ms
[2024-05-21 11:44:00] [INFO ] Time to serialize gal into /tmp/LTL598180716489908776.gal : 3 ms
[2024-05-21 11:44:00] [INFO ] Time to serialize properties into /tmp/LTL16362693466251841570.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL598180716489908776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8428199704064359822.hoa' '-atoms' '/tmp/LTL16362693466251841570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL16362693466251841570.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8428199704064359822.hoa
Detected timeout of ITS tools.
[2024-05-21 11:44:15] [INFO ] Flatten gal took : 19 ms
[2024-05-21 11:44:15] [INFO ] Flatten gal took : 19 ms
[2024-05-21 11:44:15] [INFO ] Time to serialize gal into /tmp/LTL8137297288163525378.gal : 4 ms
[2024-05-21 11:44:15] [INFO ] Time to serialize properties into /tmp/LTL10064208426813949644.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8137297288163525378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10064208426813949644.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((F86<1)||(Section_85<1))"))||(X(("((Section_131>=1)&&(F132>=1))")||(F("((Section_547<1)||(F548<1))")))))))
Formula 0 simplified : X(F!"((F86<1)||(Section_85<1))" & X(!"((Section_131>=1)&&(F132>=1))" & G!"((Section_547<1)||(F548<1))"))
Detected timeout of ITS tools.
[2024-05-21 11:44:30] [INFO ] Flatten gal took : 21 ms
[2024-05-21 11:44:30] [INFO ] Applying decomposition
[2024-05-21 11:44:30] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12197972794939745148.txt' '-o' '/tmp/graph12197972794939745148.bin' '-w' '/tmp/graph12197972794939745148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12197972794939745148.bin' '-l' '-1' '-v' '-w' '/tmp/graph12197972794939745148.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:44:30] [INFO ] Decomposing Gal with order
[2024-05-21 11:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:44:30] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 11:44:30] [INFO ] Time to serialize gal into /tmp/LTL16198874604087972219.gal : 5 ms
[2024-05-21 11:44:30] [INFO ] Time to serialize properties into /tmp/LTL4449018213787891060.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16198874604087972219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4449018213787891060.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i7.u137.F86<1)||(i7.u29.Section_85<1))"))||(X(("((i1.u105.Section_131>=1)&&(i1.u167.F132>=1))")||(F("((i19.i0.i0.u116.Secti...197
Formula 0 simplified : X(F!"((i7.u137.F86<1)||(i7.u29.Section_85<1))" & X(!"((i1.u105.Section_131>=1)&&(i1.u167.F132>=1))" & G!"((i19.i0.i0.u116.Section_54...187
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-13 finished in 280626 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)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 481 place count 1048 transition count 526
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 69 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 11:44:45] [INFO ] Computed 520 invariants in 13 ms
[2024-05-21 11:44:46] [INFO ] Implicit Places using invariants in 668 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 669 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 23 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 761 ms. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 2767 ms.
Product exploration explored 100000 steps with 0 reset in 3092 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 1114 steps (0 resets) in 78 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 410 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:44:54] [INFO ] Computed 513 invariants in 6 ms
[2024-05-21 11:44:54] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-21 11:44:54] [INFO ] Invariant cache hit.
[2024-05-21 11:44:55] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2024-05-21 11:44:55] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:44:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61571 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 362 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 1690 steps (0 resets) in 79 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 399 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2740 ms.
Product exploration explored 100000 steps with 6 reset in 3126 ms.
Built C files in :
/tmp/ltsmin796197262804740119
[2024-05-21 11:46:03] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:46:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:46:03] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:46:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:46:03] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:46:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:46:03] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin796197262804740119
Running compilation step : cd /tmp/ltsmin796197262804740119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1514 ms.
Running link step : cd /tmp/ltsmin796197262804740119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin796197262804740119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4955373055264086529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 28 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 11:46:18] [INFO ] Invariant cache hit.
[2024-05-21 11:46:19] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-21 11:46:19] [INFO ] Invariant cache hit.
[2024-05-21 11:46:19] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-05-21 11:46:19] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:46:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61598 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin13761602483122155689
[2024-05-21 11:47:20] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:47:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:47:20] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:47:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:47:20] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:47:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:47:20] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13761602483122155689
Running compilation step : cd /tmp/ltsmin13761602483122155689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1532 ms.
Running link step : cd /tmp/ltsmin13761602483122155689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13761602483122155689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6945737057992322118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:47:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:47:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:47:35] [INFO ] Time to serialize gal into /tmp/LTL1595530595569147367.gal : 2 ms
[2024-05-21 11:47:35] [INFO ] Time to serialize properties into /tmp/LTL11421090802332641089.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1595530595569147367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7973696016174423101.hoa' '-atoms' '/tmp/LTL11421090802332641089.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11421090802332641089.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7973696016174423101.hoa
Detected timeout of ITS tools.
[2024-05-21 11:47:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:47:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:47:50] [INFO ] Time to serialize gal into /tmp/LTL275557886396228106.gal : 2 ms
[2024-05-21 11:47:50] [INFO ] Time to serialize properties into /tmp/LTL1242551391270011093.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL275557886396228106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1242551391270011093.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(((F("((F385>=1)&&(Section_384>=1))"))&&(F("((F481>=1)&&(Section_480>=1))")))&&(F(G("((F535>=1)&&(Section_534>=1))"))))))
Formula 0 simplified : F(G!"((F385>=1)&&(Section_384>=1))" | G!"((F481>=1)&&(Section_480>=1))" | GF!"((F535>=1)&&(Section_534>=1))")
Detected timeout of ITS tools.
[2024-05-21 11:48:05] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:48:05] [INFO ] Applying decomposition
[2024-05-21 11:48:05] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18228626351792467384.txt' '-o' '/tmp/graph18228626351792467384.bin' '-w' '/tmp/graph18228626351792467384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18228626351792467384.bin' '-l' '-1' '-v' '-w' '/tmp/graph18228626351792467384.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:48:05] [INFO ] Decomposing Gal with order
[2024-05-21 11:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:48:05] [INFO ] Flatten gal took : 23 ms
[2024-05-21 11:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:48:05] [INFO ] Time to serialize gal into /tmp/LTL2365354067831240156.gal : 5 ms
[2024-05-21 11:48:05] [INFO ] Time to serialize properties into /tmp/LTL11106390607849430067.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2365354067831240156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11106390607849430067.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((F("((i16.u33.F385>=1)&&(i16.u138.Section_384>=1))"))&&(F("((i0.u234.F481>=1)&&(i0.u481.Section_480>=1))")))&&(F(G("((i5.u76.F53...194
Formula 0 simplified : F(G!"((i16.u33.F385>=1)&&(i16.u138.Section_384>=1))" | G!"((i0.u234.F481>=1)&&(i0.u481.Section_480>=1))" | GF!"((i5.u76.F535>=1)&&(i...180
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-14 finished in 214812 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((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2024-05-21 11:48:20] [INFO ] Computed 520 invariants in 16 ms
[2024-05-21 11:48:21] [INFO ] Implicit Places using invariants in 742 ms returned [92, 285, 304, 743, 794, 968, 1183]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 743 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 812 ms. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15
Product exploration explored 100000 steps with 178 reset in 3328 ms.
Product exploration explored 100000 steps with 185 reset in 3594 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 1492 ms. (26 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:48:29] [INFO ] Computed 513 invariants in 10 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/2048 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 13 factoid took 318 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 11:48:30] [INFO ] Invariant cache hit.
[2024-05-21 11:48:30] [INFO ] [Real]Absence check using 511 positive place invariants in 259 ms returned sat
[2024-05-21 11:48:31] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-21 11:48:45] [INFO ] [Real]Absence check using state equation in 14128 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1280 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 : 1280/1280 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1280 transition count 516
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1028 transition count 516
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 504 place count 1028 transition count 512
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 512 place count 1024 transition count 512
Applied a total of 512 rules in 36 ms. Remains 1024 /1280 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:48:45] [INFO ] Computed 513 invariants in 5 ms
[2024-05-21 11:48:45] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-21 11:48:45] [INFO ] Invariant cache hit.
[2024-05-21 11:48:46] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2024-05-21 11:48:46] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1280 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61604 ms. Remains : 1024/1280 places, 512/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 917 steps (0 resets) in 57 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 11:49:47] [INFO ] Invariant cache hit.
[2024-05-21 11:49:48] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-05-21 11:49:48] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-21 11:49:54] [INFO ] [Real]Absence check using state equation in 5876 ms returned sat
[2024-05-21 11:49:54] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-21 11:50:02] [INFO ] Added : 30 causal constraints over 6 iterations in 8298 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 356 reset in 3671 ms.
Product exploration explored 100000 steps with 379 reset in 4013 ms.
Built C files in :
/tmp/ltsmin18099632859934382187
[2024-05-21 11:50:10] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:50:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:50:10] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:50:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:50:10] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:50:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:50:10] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18099632859934382187
Running compilation step : cd /tmp/ltsmin18099632859934382187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1504 ms.
Running link step : cd /tmp/ltsmin18099632859934382187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18099632859934382187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7737395636871702074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 31 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 11:50:25] [INFO ] Invariant cache hit.
[2024-05-21 11:50:26] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-21 11:50:26] [INFO ] Invariant cache hit.
[2024-05-21 11:50:27] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-21 11:50:27] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:50:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61660 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin10199679747430059027
[2024-05-21 11:51:27] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:51:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:51:27] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:51:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:51:27] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:51:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:51:27] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10199679747430059027
Running compilation step : cd /tmp/ltsmin10199679747430059027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1519 ms.
Running link step : cd /tmp/ltsmin10199679747430059027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10199679747430059027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16704414006922782637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:51:42] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:51:42] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:51:42] [INFO ] Time to serialize gal into /tmp/LTL5251570034637613367.gal : 2 ms
[2024-05-21 11:51:42] [INFO ] Time to serialize properties into /tmp/LTL11411904938434384480.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5251570034637613367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6624567010240154096.hoa' '-atoms' '/tmp/LTL11411904938434384480.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11411904938434384480.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6624567010240154096.hoa
Detected timeout of ITS tools.
[2024-05-21 11:51:57] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:51:57] [INFO ] Flatten gal took : 16 ms
[2024-05-21 11:51:57] [INFO ] Time to serialize gal into /tmp/LTL17862066952028421512.gal : 3 ms
[2024-05-21 11:51:57] [INFO ] Time to serialize properties into /tmp/LTL2907103988335165375.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17862066952028421512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2907103988335165375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((F159>=1)&&(Section_158>=1))")))||(G(("((F159>=1)&&(Section_158>=1))")||(("((F159>=1)&&(Section_158>=1))")&&(F("((F750>=...186
Formula 0 simplified : FG!"((F159>=1)&&(Section_158>=1))"
Detected timeout of ITS tools.
[2024-05-21 11:52:12] [INFO ] Flatten gal took : 17 ms
[2024-05-21 11:52:12] [INFO ] Applying decomposition
[2024-05-21 11:52:12] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15246625699200649006.txt' '-o' '/tmp/graph15246625699200649006.bin' '-w' '/tmp/graph15246625699200649006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15246625699200649006.bin' '-l' '-1' '-v' '-w' '/tmp/graph15246625699200649006.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:52:12] [INFO ] Decomposing Gal with order
[2024-05-21 11:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:52:12] [INFO ] Flatten gal took : 22 ms
[2024-05-21 11:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:52:12] [INFO ] Time to serialize gal into /tmp/LTL9689340325032957464.gal : 6 ms
[2024-05-21 11:52:12] [INFO ] Time to serialize properties into /tmp/LTL2526658500724211579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9689340325032957464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2526658500724211579.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((i9.u5.F159>=1)&&(i9.u161.Section_158>=1))")))||(G(("((i9.u5.F159>=1)&&(i9.u161.Section_158>=1))")||(("((i9.u5.F159>=1)&...245
Formula 0 simplified : FG!"((i9.u5.F159>=1)&&(i9.u161.Section_158>=1))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 247148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||F(p1)))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-03
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 1048 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 480 place count 1047 transition count 520
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 73 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-21 11:52:27] [INFO ] Computed 520 invariants in 5 ms
[2024-05-21 11:52:28] [INFO ] Implicit Places using invariants in 663 ms returned [76, 227, 242, 636, 775, 947]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 664 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 761 ms. Remains : 1026/1287 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-03
Product exploration explored 100000 steps with 556 reset in 3755 ms.
Product exploration explored 100000 steps with 550 reset in 4078 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4221 steps (0 resets) in 190 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 11:52:37] [INFO ] Computed 514 invariants in 5 ms
[2024-05-21 11:52:38] [INFO ] [Real]Absence check using 510 positive place invariants in 225 ms returned sat
[2024-05-21 11:52:38] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 93 ms returned sat
[2024-05-21 11:52:43] [INFO ] [Real]Absence check using state equation in 4463 ms returned sat
[2024-05-21 11:52:43] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 11:52:51] [INFO ] Added : 35 causal constraints over 7 iterations in 8173 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 18 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 11:52:51] [INFO ] Invariant cache hit.
[2024-05-21 11:52:51] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-21 11:52:52] [INFO ] Invariant cache hit.
[2024-05-21 11:52:52] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 11:52:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in LTL mode , in 1 iterations and 61587 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 5055 steps (1 resets) in 215 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-21 11:53:54] [INFO ] Invariant cache hit.
[2024-05-21 11:53:55] [INFO ] [Real]Absence check using 510 positive place invariants in 235 ms returned sat
[2024-05-21 11:53:55] [INFO ] [Real]Absence check using 510 positive and 4 generalized place invariants in 73 ms returned sat
[2024-05-21 11:54:00] [INFO ] [Real]Absence check using state equation in 4893 ms returned sat
[2024-05-21 11:54:00] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 11:54:06] [INFO ] Added : 30 causal constraints over 6 iterations in 6312 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 571 reset in 3802 ms.
Product exploration explored 100000 steps with 529 reset in 4068 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 29 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 11:54:14] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 11:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60104 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin10496431790571385829
[2024-05-21 11:55:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10496431790571385829
Running compilation step : cd /tmp/ltsmin10496431790571385829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1136 ms.
Running link step : cd /tmp/ltsmin10496431790571385829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10496431790571385829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9091435908805065797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 11:55:29] [INFO ] Invariant cache hit.
[2024-05-21 11:55:30] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-21 11:55:30] [INFO ] Invariant cache hit.
[2024-05-21 11:55:31] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 11:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 510/1024 variables, 510/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in LTL mode , in 1 iterations and 61647 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin6980682526706767450
[2024-05-21 11:56:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6980682526706767450
Running compilation step : cd /tmp/ltsmin6980682526706767450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1171 ms.
Running link step : cd /tmp/ltsmin6980682526706767450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6980682526706767450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10936192174845742207.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:56:46] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:56:46] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:56:46] [INFO ] Time to serialize gal into /tmp/LTL9150932378324149464.gal : 4 ms
[2024-05-21 11:56:46] [INFO ] Time to serialize properties into /tmp/LTL15300006021937838654.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9150932378324149464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15954473759232841321.hoa' '-atoms' '/tmp/LTL15300006021937838654.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15300006021937838654.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15954473759232841321.hoa
Detected timeout of ITS tools.
[2024-05-21 11:57:01] [INFO ] Flatten gal took : 14 ms
[2024-05-21 11:57:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:57:01] [INFO ] Time to serialize gal into /tmp/LTL10886609761840266572.gal : 3 ms
[2024-05-21 11:57:01] [INFO ] Time to serialize properties into /tmp/LTL9414574306755358997.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10886609761840266572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9414574306755358997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))")))))||(F("((Section_666<1)||(F667<1))"))))
Formula 0 simplified : XXXF!"(((Section_277>=1)&&(F278>=1))&&((F573>=1)&&(Section_572>=1)))" & G!"((Section_666<1)||(F667<1))"
Detected timeout of ITS tools.
[2024-05-21 11:57:16] [INFO ] Flatten gal took : 18 ms
[2024-05-21 11:57:16] [INFO ] Applying decomposition
[2024-05-21 11:57:16] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7437985005570976286.txt' '-o' '/tmp/graph7437985005570976286.bin' '-w' '/tmp/graph7437985005570976286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7437985005570976286.bin' '-l' '-1' '-v' '-w' '/tmp/graph7437985005570976286.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:57:16] [INFO ] Decomposing Gal with order
[2024-05-21 11:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:57:17] [INFO ] Flatten gal took : 21 ms
[2024-05-21 11:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:57:17] [INFO ] Time to serialize gal into /tmp/LTL5224161839824883090.gal : 6 ms
[2024-05-21 11:57:17] [INFO ] Time to serialize properties into /tmp/LTL1997051639073852736.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5224161839824883090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1997051639073852736.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i20.u189.Section_277>=1)&&(i20.u189.F278>=1))&&((i12.i1.i0.i1.u451.F573>=1)&&(i12.i1.i0.i1.u411.Section_572>=1)))"))))...230
Formula 0 simplified : XXXF!"(((i20.u189.Section_277>=1)&&(i20.u189.F278>=1))&&((i12.i1.i0.i1.u451.F573>=1)&&(i12.i1.i0.i1.u411.Section_572>=1)))" & G!"((i...216
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-03 finished in 304510 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)))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-07
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1046 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 65 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 11:57:32] [INFO ] Computed 520 invariants in 12 ms
[2024-05-21 11:57:33] [INFO ] Implicit Places using invariants in 731 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 732 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 23 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 821 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-07
Product exploration explored 100000 steps with 28364 reset in 3254 ms.
Product exploration explored 100000 steps with 22526 reset in 3562 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 778 steps (0 resets) in 50 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 24 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:57:41] [INFO ] Computed 513 invariants in 17 ms
[2024-05-21 11:57:41] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-21 11:57:41] [INFO ] Invariant cache hit.
[2024-05-21 11:57:42] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 11:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in LTL mode , in 1 iterations and 61644 ms. Remains : 1024/1024 places, 512/512 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 467 steps (0 resets) in 36 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 265 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23149 reset in 3266 ms.
Product exploration explored 100000 steps with 26752 reset in 3499 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 25 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 11:58:50] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60106 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin3112904999422849739
[2024-05-21 11:59:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3112904999422849739
Running compilation step : cd /tmp/ltsmin3112904999422849739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1204 ms.
Running link step : cd /tmp/ltsmin3112904999422849739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3112904999422849739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1410416856097984408.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 26 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 12:00:06] [INFO ] Invariant cache hit.
[2024-05-21 12:00:06] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-21 12:00:06] [INFO ] Invariant cache hit.
[2024-05-21 12:00:07] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 12:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 61547 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin2851910146503374041
[2024-05-21 12:01:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2851910146503374041
Running compilation step : cd /tmp/ltsmin2851910146503374041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1167 ms.
Running link step : cd /tmp/ltsmin2851910146503374041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2851910146503374041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14738260734153248649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:01:22] [INFO ] Flatten gal took : 16 ms
[2024-05-21 12:01:22] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:01:22] [INFO ] Time to serialize gal into /tmp/LTL17519447302533201686.gal : 2 ms
[2024-05-21 12:01:22] [INFO ] Time to serialize properties into /tmp/LTL1629602634282661051.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17519447302533201686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16697825304882095086.hoa' '-atoms' '/tmp/LTL1629602634282661051.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1629602634282661051.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16697825304882095086.hoa
Detected timeout of ITS tools.
[2024-05-21 12:01:37] [INFO ] Flatten gal took : 16 ms
[2024-05-21 12:01:37] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:01:37] [INFO ] Time to serialize gal into /tmp/LTL11668541412075641598.gal : 3 ms
[2024-05-21 12:01:37] [INFO ] Time to serialize properties into /tmp/LTL12123115239670546019.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11668541412075641598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12123115239670546019.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_675>=1)&&(F676>=1))"))))
Formula 0 simplified : XG!"((Section_675>=1)&&(F676>=1))"
Detected timeout of ITS tools.
[2024-05-21 12:01:52] [INFO ] Flatten gal took : 19 ms
[2024-05-21 12:01:52] [INFO ] Applying decomposition
[2024-05-21 12:01:52] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13499993215217332247.txt' '-o' '/tmp/graph13499993215217332247.bin' '-w' '/tmp/graph13499993215217332247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13499993215217332247.bin' '-l' '-1' '-v' '-w' '/tmp/graph13499993215217332247.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:01:52] [INFO ] Decomposing Gal with order
[2024-05-21 12:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:01:53] [INFO ] Flatten gal took : 24 ms
[2024-05-21 12:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 12:01:53] [INFO ] Time to serialize gal into /tmp/LTL4931934732422132924.gal : 13 ms
[2024-05-21 12:01:53] [INFO ] Time to serialize properties into /tmp/LTL8010487863210078558.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4931934732422132924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8010487863210078558.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("((i29.i1.i1.i0.u222.Section_675>=1)&&(i29.i1.i1.i1.u422.F676>=1))"))))
Formula 0 simplified : XG!"((i29.i1.i1.i0.u222.Section_675>=1)&&(i29.i1.i1.i1.u422.F676>=1))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-07 finished in 275981 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(p1)))&&G(F(p2)))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-09
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1047 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 59 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2024-05-21 12:02:08] [INFO ] Computed 520 invariants in 14 ms
[2024-05-21 12:02:09] [INFO ] Implicit Places using invariants in 699 ms returned [76, 227, 242, 593, 635, 774]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 700 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1026/1287 places, 513/768 transitions.
Applied a total of 0 rules in 25 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 784 ms. Remains : 1026/1287 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2746 ms.
Product exploration explored 100000 steps with 1 reset in 3108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 531 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1578 steps (0 resets) in 86 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 631 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
// Phase 1: matrix 513 rows 1026 cols
[2024-05-21 12:02:17] [INFO ] Computed 514 invariants in 11 ms
[2024-05-21 12:02:18] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-05-21 12:02:18] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 32 ms returned sat
[2024-05-21 12:02:25] [INFO ] [Real]Absence check using state equation in 6939 ms returned sat
[2024-05-21 12:02:25] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 12:02:30] [INFO ] Added : 15 causal constraints over 3 iterations in 5142 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-21 12:02:30] [INFO ] Invariant cache hit.
[2024-05-21 12:02:31] [INFO ] [Real]Absence check using 511 positive place invariants in 236 ms returned sat
[2024-05-21 12:02:31] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 97 ms returned sat
[2024-05-21 12:02:35] [INFO ] [Real]Absence check using state equation in 4726 ms returned sat
[2024-05-21 12:02:35] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 12:02:44] [INFO ] Added : 35 causal constraints over 7 iterations in 8238 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 18 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 12:02:44] [INFO ] Invariant cache hit.
[2024-05-21 12:02:44] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-21 12:02:44] [INFO ] Invariant cache hit.
[2024-05-21 12:02:45] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 12:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 1.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 0.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 1.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 1.0)
(s797 1.0)
(s798 0.0)
(s799 1.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 1.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 1.0)
(s847 0.0)
(s848 1.0)
(s849 0.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 1.0)
(s876 1.0)
(s877 0.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 1.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 1.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 1.0)
(s901 1.0)
(s902 0.0)
(s903 1.0)
(s904 0.0)
(s905 1.0)
(s906 1.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 0.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 0.0)
(s929 0.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 0.0)
(s935 1.0)
(s936 0.0)
(s937 0.0)
(s938 1.0)
(s939 0.0)
(s940 1.0)
(s941 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in LTL mode , in 1 iterations and 61630 ms. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1299 steps (0 resets) in 62 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 476 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
[2024-05-21 12:03:47] [INFO ] Invariant cache hit.
[2024-05-21 12:03:48] [INFO ] [Real]Absence check using 511 positive place invariants in 224 ms returned sat
[2024-05-21 12:03:48] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 87 ms returned sat
[2024-05-21 12:03:54] [INFO ] [Real]Absence check using state equation in 5772 ms returned sat
[2024-05-21 12:03:54] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-21 12:04:01] [INFO ] Added : 25 causal constraints over 5 iterations in 7409 ms. Result :unknown
Could not prove EG (NOT p0)
[2024-05-21 12:04:01] [INFO ] Invariant cache hit.
[2024-05-21 12:04:02] [INFO ] [Real]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-21 12:04:02] [INFO ] [Real]Absence check using 511 positive and 3 generalized place invariants in 89 ms returned sat
[2024-05-21 12:04:07] [INFO ] [Real]Absence check using state equation in 4697 ms returned sat
[2024-05-21 12:04:07] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 12:04:16] [INFO ] Added : 40 causal constraints over 8 iterations in 9546 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2726 ms.
Product exploration explored 100000 steps with 2 reset in 3127 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 22 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 12:04:23] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 12:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60096 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin3566538491130969423
[2024-05-21 12:05:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3566538491130969423
Running compilation step : cd /tmp/ltsmin3566538491130969423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1206 ms.
Running link step : cd /tmp/ltsmin3566538491130969423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3566538491130969423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased545045622962409170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1026 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 26 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-21 12:05:38] [INFO ] Invariant cache hit.
[2024-05-21 12:05:39] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-21 12:05:39] [INFO ] Invariant cache hit.
[2024-05-21 12:05:40] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 12:05:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/1539 variables, and 1540 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 510/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1026 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1539 variables, 1026/1540 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 257/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1539 variables, and 1797 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in LTL mode , in 1 iterations and 61630 ms. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin9086528859029910567
[2024-05-21 12:06:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9086528859029910567
Running compilation step : cd /tmp/ltsmin9086528859029910567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1234 ms.
Running link step : cd /tmp/ltsmin9086528859029910567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9086528859029910567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15494179159470620117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:06:55] [INFO ] Flatten gal took : 16 ms
[2024-05-21 12:06:55] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:06:55] [INFO ] Time to serialize gal into /tmp/LTL16193822719330839269.gal : 3 ms
[2024-05-21 12:06:55] [INFO ] Time to serialize properties into /tmp/LTL11026850144114510430.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16193822719330839269.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11010362562639512670.hoa' '-atoms' '/tmp/LTL11026850144114510430.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11026850144114510430.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11010362562639512670.hoa
Detected timeout of ITS tools.
[2024-05-21 12:07:10] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:07:10] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:07:10] [INFO ] Time to serialize gal into /tmp/LTL11391554695223478438.gal : 3 ms
[2024-05-21 12:07:10] [INFO ] Time to serialize properties into /tmp/LTL8934320989690905775.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11391554695223478438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8934320989690905775.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(("((F403<1)||(Section_402<1))")&&(G("((Section_97>=1)&&(F98>=1))"))))&&(G(F("(((F403>=1)&&(Section_402>=1))||((Section_294>=1)...175
Formula 0 simplified : X(G(!"((F403<1)||(Section_402<1))" | F!"((Section_97>=1)&&(F98>=1))") | FG!"(((F403>=1)&&(Section_402>=1))||((Section_294>=1)&&(F295...163
Detected timeout of ITS tools.
[2024-05-21 12:07:25] [INFO ] Flatten gal took : 26 ms
[2024-05-21 12:07:25] [INFO ] Applying decomposition
[2024-05-21 12:07:25] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15644466053562268539.txt' '-o' '/tmp/graph15644466053562268539.bin' '-w' '/tmp/graph15644466053562268539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15644466053562268539.bin' '-l' '-1' '-v' '-w' '/tmp/graph15644466053562268539.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:07:25] [INFO ] Decomposing Gal with order
[2024-05-21 12:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:07:25] [INFO ] Flatten gal took : 23 ms
[2024-05-21 12:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 12:07:25] [INFO ] Time to serialize gal into /tmp/LTL358357740251069221.gal : 7 ms
[2024-05-21 12:07:25] [INFO ] Time to serialize properties into /tmp/LTL2862105600966477203.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL358357740251069221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2862105600966477203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i27.u156.F403<1)||(i27.u169.Section_402<1))")&&(G("((i9.u95.Section_97>=1)&&(i9.u95.F98>=1))"))))&&(G(F("(((i27.u156.F403>...243
Formula 0 simplified : X(G(!"((i27.u156.F403<1)||(i27.u169.Section_402<1))" | F!"((i9.u95.Section_97>=1)&&(i9.u95.F98>=1))") | FG!"(((i27.u156.F403>=1)&&(i...231
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-09 finished in 332635 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&&F(p1)&&X(F((p2||G(!p1)))))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLFireability-12
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 6 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1287 transition count 528
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1047 transition count 528
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 480 place count 1047 transition count 521
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 494 place count 1040 transition count 521
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 508 place count 1033 transition count 514
Applied a total of 508 rules in 52 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2024-05-21 12:07:41] [INFO ] Computed 520 invariants in 12 ms
[2024-05-21 12:07:41] [INFO ] Implicit Places using invariants in 672 ms returned [76, 594, 636, 775, 947]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 673 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1028/1287 places, 514/768 transitions.
Applied a total of 0 rules in 24 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 750 ms. Remains : 1028/1287 places, 514/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-12
Product exploration explored 100000 steps with 364 reset in 3736 ms.
Product exploration explored 100000 steps with 383 reset in 4060 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 621 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
RANDOM walk for 3650 steps (0 resets) in 167 ms. (21 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 2 factoid took 770 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), false, false]
// Phase 1: matrix 514 rows 1028 cols
[2024-05-21 12:07:51] [INFO ] Computed 515 invariants in 6 ms
[2024-05-21 12:07:52] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-05-21 12:07:52] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 103 ms returned sat
[2024-05-21 12:07:56] [INFO ] [Real]Absence check using state equation in 3641 ms returned sat
[2024-05-21 12:07:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:07:56] [INFO ] [Nat]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-21 12:07:56] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 12:08:02] [INFO ] [Nat]Absence check using state equation in 5673 ms returned sat
[2024-05-21 12:08:02] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 12:08:07] [INFO ] Added : 15 causal constraints over 3 iterations in 5047 ms. Result :sat
Could not prove EG (AND (NOT p2) p1)
Support contains 4 out of 1028 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 : 1028/1028 places, 514/514 transitions.
Applied a total of 0 rules in 30 ms. Remains 1028 /1028 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-21 12:08:07] [INFO ] Invariant cache hit.
[2024-05-21 12:08:08] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-21 12:08:08] [INFO ] Invariant cache hit.
[2024-05-21 12:08:09] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-05-21 12:08:09] [INFO ] Redundant transitions in 3 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-21 12:08:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 1543 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1027 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1542 variables, 1028/1543 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1542 variables, 258/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 1801 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1028/1028 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61586 ms. Remains : 1028/1028 places, 514/514 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 472 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
RANDOM walk for 1595 steps (0 resets) in 80 ms. (19 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 629 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
[2024-05-21 12:09:11] [INFO ] Invariant cache hit.
[2024-05-21 12:09:11] [INFO ] [Real]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-21 12:09:11] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 69 ms returned sat
[2024-05-21 12:09:15] [INFO ] [Real]Absence check using state equation in 3860 ms returned sat
[2024-05-21 12:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:09:16] [INFO ] [Nat]Absence check using 511 positive place invariants in 231 ms returned sat
[2024-05-21 12:09:16] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 78 ms returned sat
[2024-05-21 12:09:20] [INFO ] [Nat]Absence check using state equation in 3668 ms returned sat
[2024-05-21 12:09:20] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-21 12:09:27] [INFO ] Added : 25 causal constraints over 5 iterations in 6882 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Product exploration explored 100000 steps with 363 reset in 3693 ms.
Product exploration explored 100000 steps with 385 reset in 4011 ms.
Built C files in :
/tmp/ltsmin4451713881808383920
[2024-05-21 12:09:35] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 12:09:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:35] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 12:09:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:35] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 12:09:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:35] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4451713881808383920
Running compilation step : cd /tmp/ltsmin4451713881808383920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1498 ms.
Running link step : cd /tmp/ltsmin4451713881808383920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4451713881808383920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7359122294570123477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1028/1028 places, 514/514 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 1028 transition count 513
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 1027 transition count 513
Applied a total of 2 rules in 33 ms. Remains 1027 /1028 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1027 cols
[2024-05-21 12:09:50] [INFO ] Computed 515 invariants in 10 ms
[2024-05-21 12:09:50] [INFO ] Implicit Places using invariants in 657 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 658 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1028 places, 513/514 transitions.
Applied a total of 0 rules in 23 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 716 ms. Remains : 1026/1028 places, 513/514 transitions.
Built C files in :
/tmp/ltsmin3623944437623446704
[2024-05-21 12:09:50] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 12:09:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:50] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 12:09:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:50] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 12:09:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:09:50] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3623944437623446704
Running compilation step : cd /tmp/ltsmin3623944437623446704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1497 ms.
Running link step : cd /tmp/ltsmin3623944437623446704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3623944437623446704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3322210544060810702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:10:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:10:05] [INFO ] Flatten gal took : 14 ms
[2024-05-21 12:10:05] [INFO ] Time to serialize gal into /tmp/LTL6260946274779568217.gal : 3 ms
[2024-05-21 12:10:05] [INFO ] Time to serialize properties into /tmp/LTL11999699257623963551.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6260946274779568217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5859571164060328169.hoa' '-atoms' '/tmp/LTL11999699257623963551.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11999699257623963551.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5859571164060328169.hoa
Detected timeout of ITS tools.
[2024-05-21 12:10:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 12:10:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:10:21] [INFO ] Time to serialize gal into /tmp/LTL1821415329525651750.gal : 3 ms
[2024-05-21 12:10:21] [INFO ] Time to serialize properties into /tmp/LTL13802818070507852326.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1821415329525651750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13802818070507852326.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F446<1)||(Section_445<1))"))&&(X(F(("((F477>=1)&&(Section_476>=1))")||(G("((F446>=1)&&(Section_445>=1))"))))))&&("((F2<1)|...175
Formula 0 simplified : G(!"((F2<1)||(Section_1<1))" | G!"((F446<1)||(Section_445<1))" | XG(!"((F477>=1)&&(Section_476>=1))" & F!"((F446>=1)&&(Section_445>=...161
Detected timeout of ITS tools.
[2024-05-21 12:10:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:10:36] [INFO ] Applying decomposition
[2024-05-21 12:10:36] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15772414750238065024.txt' '-o' '/tmp/graph15772414750238065024.bin' '-w' '/tmp/graph15772414750238065024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15772414750238065024.bin' '-l' '-1' '-v' '-w' '/tmp/graph15772414750238065024.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:10:36] [INFO ] Decomposing Gal with order
[2024-05-21 12:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:10:36] [INFO ] Flatten gal took : 20 ms
[2024-05-21 12:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 12:10:36] [INFO ] Time to serialize gal into /tmp/LTL11879910318553722148.gal : 5 ms
[2024-05-21 12:10:36] [INFO ] Time to serialize properties into /tmp/LTL12309134768130265642.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11879910318553722148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12309134768130265642.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i26.u233.F446<1)||(i26.u233.Section_445<1))"))&&(X(F(("((i5.u41.F477>=1)&&(i5.u173.Section_476>=1))")||(G("((i26.u233.F446...244
Formula 0 simplified : G(!"((i25.u470.F2<1)||(i25.u470.Section_1<1))" | G!"((i26.u233.F446<1)||(i26.u233.Section_445<1))" | XG(!"((i5.u41.F477>=1)&&(i5.u17...230
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-12 finished in 190597 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||F(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)&&F(p1)&&F(G(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' '!(X(G((X(F(p0))||G((p0||(F(p2)&&p1)))))))'
Found a Lengthening insensitive property : CircularTrains-PT-768-LTLFireability-15
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1287 transition count 530
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 1049 transition count 530
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 476 place count 1049 transition count 519
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 512 place count 1031 transition count 512
Applied a total of 512 rules in 54 ms. Remains 1031 /1287 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1031 cols
[2024-05-21 12:10:51] [INFO ] Computed 520 invariants in 14 ms
[2024-05-21 12:10:52] [INFO ] Implicit Places using invariants in 658 ms returned [76, 227, 242, 593, 635, 774, 946]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 659 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1024/1287 places, 512/768 transitions.
Applied a total of 0 rules in 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 743 ms. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLFireability-15
Product exploration explored 100000 steps with 374 reset in 3685 ms.
Product exploration explored 100000 steps with 370 reset in 3991 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 1533 ms. (26 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 12:11:01] [INFO ] Computed 513 invariants in 9 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/1536 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1024 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 514 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 12:11:02] [INFO ] Invariant cache hit.
[2024-05-21 12:11:03] [INFO ] [Real]Absence check using 511 positive place invariants in 224 ms returned sat
[2024-05-21 12:11:03] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 57 ms returned sat
[2024-05-21 12:11:08] [INFO ] [Real]Absence check using state equation in 4900 ms returned sat
[2024-05-21 12:11:08] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 12:11:13] [INFO ] Added : 20 causal constraints over 4 iterations in 5192 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1024 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 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 28 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 12:11:13] [INFO ] Invariant cache hit.
[2024-05-21 12:11:13] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-21 12:11:13] [INFO ] Invariant cache hit.
[2024-05-21 12:11:14] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2024-05-21 12:11:14] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 12:11:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61503 ms. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 1775 steps (0 resets) in 86 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 12:12:15] [INFO ] Invariant cache hit.
[2024-05-21 12:12:16] [INFO ] [Real]Absence check using 511 positive place invariants in 227 ms returned sat
[2024-05-21 12:12:16] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 58 ms returned sat
[2024-05-21 12:12:21] [INFO ] [Real]Absence check using state equation in 4960 ms returned sat
[2024-05-21 12:12:21] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 12:12:26] [INFO ] Added : 20 causal constraints over 4 iterations in 5315 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 353 reset in 3679 ms.
Product exploration explored 100000 steps with 375 reset in 4015 ms.
Built C files in :
/tmp/ltsmin10618616930680010598
[2024-05-21 12:12:34] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 12:12:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:12:34] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 12:12:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:12:34] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 12:12:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:12:34] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10618616930680010598
Running compilation step : cd /tmp/ltsmin10618616930680010598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1496 ms.
Running link step : cd /tmp/ltsmin10618616930680010598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10618616930680010598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4567142799694627058.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 29 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-21 12:12:49] [INFO ] Invariant cache hit.
[2024-05-21 12:12:50] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-21 12:12:50] [INFO ] Invariant cache hit.
[2024-05-21 12:12:51] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2024-05-21 12:12:51] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 12:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
(s938 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 1.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 0.0)
(s735 1.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 1.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 1.0)
(s797 1.0)
(s798 0.0)
(s799 1.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 1.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 1.0)
(s845 1.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 1.0)
(s875 1.0)
(s876 0.0)
(s877 1.0)
(s878 0.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 1.0)
(s900 1.0)
(s901 0.0)
(s902 1.0)
(s903 0.0)
(s904 1.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 0.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 0.0)
(s928 0.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 1.0)
(s938 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1536 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61729 ms. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin6211517356286960689
[2024-05-21 12:13:51] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 12:13:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:13:51] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 12:13:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:13:51] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 12:13:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:13:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6211517356286960689
Running compilation step : cd /tmp/ltsmin6211517356286960689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1548 ms.
Running link step : cd /tmp/ltsmin6211517356286960689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6211517356286960689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12680745131883560391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:14:06] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:14:06] [INFO ] Flatten gal took : 15 ms
[2024-05-21 12:14:06] [INFO ] Time to serialize gal into /tmp/LTL13483984480623587958.gal : 3 ms
[2024-05-21 12:14:06] [INFO ] Time to serialize properties into /tmp/LTL12798948195087628041.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13483984480623587958.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1735140942653530850.hoa' '-atoms' '/tmp/LTL12798948195087628041.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12798948195087628041.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1735140942653530850.hoa
Detected timeout of ITS tools.
[2024-05-21 12:14:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 12:14:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 12:14:21] [INFO ] Time to serialize gal into /tmp/LTL16281901044989240469.gal : 3 ms
[2024-05-21 12:14:21] [INFO ] Time to serialize properties into /tmp/LTL2654001480459475080.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16281901044989240469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2654001480459475080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((F159>=1)&&(Section_158>=1))")))||(G(("((F159>=1)&&(Section_158>=1))")||(("((F159>=1)&&(Section_158>=1))")&&(F("((F750>=...186
Formula 0 simplified : FG!"((F159>=1)&&(Section_158>=1))"
Detected timeout of ITS tools.
[2024-05-21 12:14:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 12:14:36] [INFO ] Applying decomposition
[2024-05-21 12:14:36] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8462955223637369790.txt' '-o' '/tmp/graph8462955223637369790.bin' '-w' '/tmp/graph8462955223637369790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8462955223637369790.bin' '-l' '-1' '-v' '-w' '/tmp/graph8462955223637369790.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:14:36] [INFO ] Decomposing Gal with order
[2024-05-21 12:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:14:36] [INFO ] Flatten gal took : 20 ms
[2024-05-21 12:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 12:14:36] [INFO ] Time to serialize gal into /tmp/LTL13649996087355434375.gal : 5 ms
[2024-05-21 12:14:36] [INFO ] Time to serialize properties into /tmp/LTL4965367481050969065.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13649996087355434375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4965367481050969065.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("((i29.u7.F159>=1)&&(i29.u148.Section_158>=1))")))||(G(("((i29.u7.F159>=1)&&(i29.u148.Section_158>=1))")||(("((i29.u7.F159...249
Formula 0 simplified : FG!"((i29.u7.F159>=1)&&(i29.u148.Section_158>=1))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLFireability-15 finished in 240345 ms.
[2024-05-21 12:14:51] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16967489225522119577
[2024-05-21 12:14:51] [INFO ] Applying decomposition
[2024-05-21 12:14:51] [INFO ] Computing symmetric may disable matrix : 768 transitions.
[2024-05-21 12:14:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:14:51] [INFO ] Computing symmetric may enable matrix : 768 transitions.
[2024-05-21 12:14:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:14:51] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8251421392701048031.txt' '-o' '/tmp/graph8251421392701048031.bin' '-w' '/tmp/graph8251421392701048031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8251421392701048031.bin' '-l' '-1' '-v' '-w' '/tmp/graph8251421392701048031.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:14:51] [INFO ] Decomposing Gal with order
[2024-05-21 12:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:14:52] [INFO ] Computing Do-Not-Accords matrix : 768 transitions.
[2024-05-21 12:14:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:14:52] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16967489225522119577
Running compilation step : cd /tmp/ltsmin16967489225522119577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 12:14:52] [INFO ] Flatten gal took : 33 ms
[2024-05-21 12:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 12:14:52] [INFO ] Time to serialize gal into /tmp/LTLFireability6235030608132320542.gal : 5 ms
[2024-05-21 12:14:52] [INFO ] Time to serialize properties into /tmp/LTLFireability14847224242239282605.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6235030608132320542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14847224242239282605.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 7 LTL properties
Checking formula 0 : !(((X(X(X(G("(((i22.u120.Section_277>=1)&&(i22.u54.F278>=1))&&((i31.u184.F573>=1)&&(i29.u105.Section_572>=1)))")))))||(F("((i36.u226.S...193
Formula 0 simplified : XXXF!"(((i22.u120.Section_277>=1)&&(i22.u54.F278>=1))&&((i31.u184.F573>=1)&&(i29.u105.Section_572>=1)))" & G!"((i36.u226.Section_666...179
Compilation finished in 2490 ms.
Running link step : cd /tmp/ltsmin16967489225522119577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16967489225522119577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X([]((LTLAPp0==true)))))||<>((LTLAPp1==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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