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.r400-tall-171690531700169.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 StigmergyCommit-PT-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K 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 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-07a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716989229241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 13:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:27:10] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-29 13:27:10] [INFO ] Transformed 292 places.
[2024-05-29 13:27:11] [INFO ] Transformed 7108 transitions.
[2024-05-29 13:27:11] [INFO ] Found NUPN structural information;
[2024-05-29 13:27:11] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 627 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 258 transition count 853
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 258 transition count 853
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 258 transition count 849
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 253 transition count 843
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 253 transition count 843
Applied a total of 82 rules in 66 ms. Remains 253 /292 variables (removed 39) and now considering 843/890 (removed 47) transitions.
[2024-05-29 13:27:11] [INFO ] Flow matrix only has 825 transitions (discarded 18 similar events)
// Phase 1: matrix 825 rows 253 cols
[2024-05-29 13:27:11] [INFO ] Computed 6 invariants in 26 ms
[2024-05-29 13:27:11] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-29 13:27:11] [INFO ] Flow matrix only has 825 transitions (discarded 18 similar events)
[2024-05-29 13:27:11] [INFO ] Invariant cache hit.
[2024-05-29 13:27:11] [INFO ] State equation strengthened by 617 read => feed constraints.
[2024-05-29 13:27:13] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned [252]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1904 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 252/292 places, 843/890 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 245 transition count 836
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 245 transition count 836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 245 transition count 834
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 242 transition count 831
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 242 transition count 831
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 240 transition count 829
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 240 transition count 829
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 239 transition count 828
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 239 transition count 828
Applied a total of 28 rules in 40 ms. Remains 239 /252 variables (removed 13) and now considering 828/843 (removed 15) transitions.
[2024-05-29 13:27:13] [INFO ] Flow matrix only has 810 transitions (discarded 18 similar events)
// Phase 1: matrix 810 rows 239 cols
[2024-05-29 13:27:13] [INFO ] Computed 5 invariants in 6 ms
[2024-05-29 13:27:13] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 13:27:13] [INFO ] Flow matrix only has 810 transitions (discarded 18 similar events)
[2024-05-29 13:27:13] [INFO ] Invariant cache hit.
[2024-05-29 13:27:13] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:27:13] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/292 places, 828/890 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2838 ms. Remains : 239/292 places, 828/890 transitions.
Support contains 88 out of 239 places after structural reductions.
[2024-05-29 13:27:14] [INFO ] Flatten gal took : 149 ms
[2024-05-29 13:27:14] [INFO ] Flatten gal took : 80 ms
[2024-05-29 13:27:14] [INFO ] Input system was already deterministic with 828 transitions.
Support contains 83 out of 239 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 4195 ms. (9 steps per ms) remains 11/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
[2024-05-29 13:27:16] [INFO ] Flow matrix only has 810 transitions (discarded 18 similar events)
[2024-05-29 13:27:16] [INFO ] Invariant cache hit.
[2024-05-29 13:27:16] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 219/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 809/1048 variables, 239/244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 516/760 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1048 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/1049 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1049 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/1049 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1049/1049 variables, and 761 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 239/239 constraints, ReadFeed: 517/517 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 219/239 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 13:27:17] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 16 ms to minimize.
[2024-05-29 13:27:18] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 2 ms to minimize.
[2024-05-29 13:27:18] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 2 ms to minimize.
[2024-05-29 13:27:18] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-29 13:27:18] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 2 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 8 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 2 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-05-29 13:27:19] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
Problem AtomicPropp44 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-29 13:27:20] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 4 ms to minimize.
[2024-05-29 13:27:22] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
SMT process timed out in 6344ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 828/828 transitions.
Graph (complete) has 490 edges and 239 vertex of which 235 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 162 rules applied. Total rules applied 163 place count 235 transition count 662
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 179 rules applied. Total rules applied 342 place count 95 transition count 623
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 358 place count 83 transition count 619
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 363 place count 82 transition count 615
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 366 place count 79 transition count 615
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 366 place count 79 transition count 610
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 376 place count 74 transition count 610
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 391 place count 59 transition count 594
Iterating global reduction 5 with 15 rules applied. Total rules applied 406 place count 59 transition count 594
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 421 place count 59 transition count 579
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 58 transition count 578
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 58 transition count 578
Performed 20 Post agglomeration using F-continuation condition with reduction of 417 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 463 place count 38 transition count 141
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 6 with 83 rules applied. Total rules applied 546 place count 38 transition count 58
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 550 place count 36 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 557 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 562 place count 36 transition count 42
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 564 place count 36 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 566 place count 34 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 567 place count 34 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 568 place count 34 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 569 place count 33 transition count 38
Applied a total of 569 rules in 140 ms. Remains 33 /239 variables (removed 206) and now considering 38/828 (removed 790) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 33/239 places, 38/828 transitions.
RANDOM walk for 40000 steps (1112 resets) in 241 ms. (165 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (211 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
// Phase 1: matrix 38 rows 33 cols
[2024-05-29 13:27:22] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:27:23] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
Problem AtomicPropp37 is UNSAT
[2024-05-29 13:27:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem AtomicPropp39 is UNSAT
After SMT solving in domain Real declared 16/71 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 107ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-29 13:27:23] [INFO ] Flatten gal took : 43 ms
[2024-05-29 13:27:23] [INFO ] Flatten gal took : 49 ms
[2024-05-29 13:27:23] [INFO ] Input system was already deterministic with 828 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 190 transition count 772
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 190 transition count 772
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 105 place count 190 transition count 765
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 140 place count 155 transition count 725
Iterating global reduction 1 with 35 rules applied. Total rules applied 175 place count 155 transition count 725
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 186 place count 155 transition count 714
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 206 place count 135 transition count 694
Iterating global reduction 2 with 20 rules applied. Total rules applied 226 place count 135 transition count 694
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 240 place count 121 transition count 680
Iterating global reduction 2 with 14 rules applied. Total rules applied 254 place count 121 transition count 680
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 267 place count 108 transition count 667
Iterating global reduction 2 with 13 rules applied. Total rules applied 280 place count 108 transition count 667
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 285 place count 108 transition count 662
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 293 place count 100 transition count 654
Iterating global reduction 3 with 8 rules applied. Total rules applied 301 place count 100 transition count 654
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 304 place count 100 transition count 651
Applied a total of 304 rules in 26 ms. Remains 100 /239 variables (removed 139) and now considering 651/828 (removed 177) transitions.
[2024-05-29 13:27:23] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:27:23] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:27:23] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 13:27:23] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:27:23] [INFO ] Invariant cache hit.
[2024-05-29 13:27:23] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:27:23] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 13:27:23] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:27:23] [INFO ] Invariant cache hit.
[2024-05-29 13:27:23] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:27:33] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:27:34] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 7 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:27:35] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:27:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 3 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:27:37] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:27:38] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:27:39] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:27:40] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:27:40] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:27:40] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:27:40] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:27:40] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:27:42] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:27:43] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:27:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:27:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:27:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:27:46] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:27:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:27:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:28:05] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 67105ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67116ms
Starting structural reductions in LTL mode, iteration 1 : 100/239 places, 651/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67630 ms. Remains : 100/239 places, 651/828 transitions.
[2024-05-29 13:28:30] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:28:31] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:28:31] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:28:31] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:28:31] [INFO ] Flatten gal took : 41 ms
[2024-05-29 13:28:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality5428150367567376674.gal : 21 ms
[2024-05-29 13:28:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14836956725161215438.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5428150367567376674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14836956725161215438.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.48828,68240,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,2.51258,68240,1,0,6,69829,7,1,2947,45999,1
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 191 transition count 773
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 191 transition count 773
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 191 transition count 766
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 137 place count 157 transition count 727
Iterating global reduction 1 with 34 rules applied. Total rules applied 171 place count 157 transition count 727
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 181 place count 157 transition count 717
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 201 place count 137 transition count 697
Iterating global reduction 2 with 20 rules applied. Total rules applied 221 place count 137 transition count 697
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 235 place count 123 transition count 683
Iterating global reduction 2 with 14 rules applied. Total rules applied 249 place count 123 transition count 683
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 262 place count 110 transition count 670
Iterating global reduction 2 with 13 rules applied. Total rules applied 275 place count 110 transition count 670
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 280 place count 110 transition count 665
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 288 place count 102 transition count 657
Iterating global reduction 3 with 8 rules applied. Total rules applied 296 place count 102 transition count 657
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 299 place count 102 transition count 654
Applied a total of 299 rules in 30 ms. Remains 102 /239 variables (removed 137) and now considering 654/828 (removed 174) transitions.
[2024-05-29 13:28:33] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
// Phase 1: matrix 645 rows 102 cols
[2024-05-29 13:28:33] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:28:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 13:28:33] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2024-05-29 13:28:33] [INFO ] Invariant cache hit.
[2024-05-29 13:28:34] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:28:34] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 653 sub problems to find dead transitions.
[2024-05-29 13:28:34] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2024-05-29 13:28:34] [INFO ] Invariant cache hit.
[2024-05-29 13:28:34] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:28:43] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:28:44] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:28:45] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2024-05-29 13:28:46] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:28:47] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:28:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:28:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:28:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:28:53] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:28:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:28:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:28:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:28:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:28:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:29:00] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:29:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:29:02] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:29:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:29:02] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:29:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 653 unsolved
[2024-05-29 13:29:06] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:29:06] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 11 (OVERLAPS) 644/746 variables, 102/193 constraints. Problems are: Problem set: 0 solved, 653 unsolved
SMT process timed out in 36789ms, After SMT, problems are : Problem set: 0 solved, 653 unsolved
Search for dead transitions found 0 dead transitions in 36799ms
Starting structural reductions in LTL mode, iteration 1 : 102/239 places, 654/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37277 ms. Remains : 102/239 places, 654/828 transitions.
[2024-05-29 13:29:11] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:29:11] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:29:11] [INFO ] Input system was already deterministic with 654 transitions.
[2024-05-29 13:29:11] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:29:11] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:29:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality11075387286945569265.gal : 16 ms
[2024-05-29 13:29:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8782587227913978852.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11075387286945569265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8782587227913978852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.59249,68636,2,4780,5,71806,6,0,1053,47029,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(AF((p121==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(!(EG(!((p121==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...461
(forward)formula 0,1,21.4436,489660,1,0,825,739662,1326,146,23217,471448,1411
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 238 transition count 682
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 175 rules applied. Total rules applied 320 place count 93 transition count 652
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 332 place count 88 transition count 645
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 337 place count 86 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 85 transition count 642
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 338 place count 85 transition count 628
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 366 place count 71 transition count 628
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 377 place count 60 transition count 610
Iterating global reduction 5 with 11 rules applied. Total rules applied 388 place count 60 transition count 610
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 391 place count 60 transition count 607
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 396 place count 55 transition count 597
Iterating global reduction 6 with 5 rules applied. Total rules applied 401 place count 55 transition count 597
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 461 place count 55 transition count 537
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 479 place count 46 transition count 528
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 7 with 72 rules applied. Total rules applied 551 place count 46 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 372 transitions
Redundant transition composition rules discarded 372 transitions
Iterating global reduction 8 with 372 rules applied. Total rules applied 923 place count 46 transition count 84
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 939 place count 38 transition count 76
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 947 place count 30 transition count 68
Applied a total of 947 rules in 147 ms. Remains 30 /239 variables (removed 209) and now considering 68/828 (removed 760) transitions.
[2024-05-29 13:29:33] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 30 cols
[2024-05-29 13:29:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:29:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 13:29:33] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-05-29 13:29:33] [INFO ] Invariant cache hit.
[2024-05-29 13:29:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:29:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 13:29:33] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-29 13:29:33] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-05-29 13:29:33] [INFO ] Invariant cache hit.
[2024-05-29 13:29:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 8/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:29:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 59/89 variables, 30/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1/90 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 93 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 8/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 59/89 variables, 30/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 40/134 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 135 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 63/63 constraints]
After SMT, in 3947ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3948ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/239 places, 68/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4261 ms. Remains : 30/239 places, 68/828 transitions.
[2024-05-29 13:29:37] [INFO ] Flatten gal took : 7 ms
[2024-05-29 13:29:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:29:37] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-29 13:29:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:29:37] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:29:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality6133084813595850418.gal : 1 ms
[2024-05-29 13:29:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality8289586437252904686.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6133084813595850418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8289586437252904686.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,404,0.02474,4216,2,190,5,2118,6,0,180,1543,0


Converting to forward existential form...Done !
original formula: E(((p112==0)||(p85==1)) U (p9!=0))
=> equivalent forward existential formula: [(FwdU(Init,((p112==0)||(p85==1))) * (p9!=0))] != FALSE
Hit Full ! (commute/partial/dont) 61/0/7
(forward)formula 0,1,0.04613,4532,1,0,8,2118,15,1,531,1543,4
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 191 transition count 773
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 191 transition count 773
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 191 transition count 766
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 137 place count 157 transition count 727
Iterating global reduction 1 with 34 rules applied. Total rules applied 171 place count 157 transition count 727
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 181 place count 157 transition count 717
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 200 place count 138 transition count 698
Iterating global reduction 2 with 19 rules applied. Total rules applied 219 place count 138 transition count 698
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 232 place count 125 transition count 685
Iterating global reduction 2 with 13 rules applied. Total rules applied 245 place count 125 transition count 685
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 257 place count 113 transition count 673
Iterating global reduction 2 with 12 rules applied. Total rules applied 269 place count 113 transition count 673
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 274 place count 113 transition count 668
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 280 place count 107 transition count 662
Iterating global reduction 3 with 6 rules applied. Total rules applied 286 place count 107 transition count 662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 107 transition count 660
Applied a total of 288 rules in 34 ms. Remains 107 /239 variables (removed 132) and now considering 660/828 (removed 168) transitions.
[2024-05-29 13:29:37] [INFO ] Flow matrix only has 651 transitions (discarded 9 similar events)
// Phase 1: matrix 651 rows 107 cols
[2024-05-29 13:29:37] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:29:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 13:29:37] [INFO ] Flow matrix only has 651 transitions (discarded 9 similar events)
[2024-05-29 13:29:37] [INFO ] Invariant cache hit.
[2024-05-29 13:29:37] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:29:37] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-05-29 13:29:37] [INFO ] Flow matrix only has 651 transitions (discarded 9 similar events)
[2024-05-29 13:29:37] [INFO ] Invariant cache hit.
[2024-05-29 13:29:37] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:29:47] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-29 13:29:47] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:29:47] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:29:47] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 13:29:48] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:29:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:29:50] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:29:51] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:29:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:29:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:29:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:29:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:29:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:29:57] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:29:58] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:29:58] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:29:58] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 13:29:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:30:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:30:00] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:30:02] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 9 (OVERLAPS) 650/757 variables, 107/197 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 516/713 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/758 variables, and 713 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:30:17] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:30:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:30:18] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:30:21] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:30:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (OVERLAPS) 650/757 variables, 107/202 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 516/718 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/758 variables, and 1377 constraints, problems are : Problem set: 0 solved, 659 unsolved in 32280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 94/94 constraints]
After SMT, in 68688ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 68700ms
Starting structural reductions in LTL mode, iteration 1 : 107/239 places, 660/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69198 ms. Remains : 107/239 places, 660/828 transitions.
[2024-05-29 13:30:46] [INFO ] Flatten gal took : 24 ms
[2024-05-29 13:30:46] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:30:46] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-29 13:30:46] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:30:46] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:30:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality9685259982096690414.gal : 6 ms
[2024-05-29 13:30:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6374583647885804467.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9685259982096690414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6374583647885804467.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80254e+06,2.45587,68668,2,4822,5,71925,6,0,1079,47257,0


Converting to forward existential form...Done !
original formula: AG((AX((((p85==0)&&(p249==1))||(p279==0))) + EX(TRUE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(TRUE)))) * !((((p85==0)&&(p249==1))||(p279==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...467
(forward)formula 0,1,6.93997,163904,1,0,755,281957,1327,131,23345,187669,1317
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 196 transition count 780
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 196 transition count 780
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 196 transition count 773
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 123 place count 166 transition count 740
Iterating global reduction 1 with 30 rules applied. Total rules applied 153 place count 166 transition count 740
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 163 place count 166 transition count 730
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 178 place count 151 transition count 715
Iterating global reduction 2 with 15 rules applied. Total rules applied 193 place count 151 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 204 place count 140 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 215 place count 140 transition count 704
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 225 place count 130 transition count 694
Iterating global reduction 2 with 10 rules applied. Total rules applied 235 place count 130 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 238 place count 130 transition count 691
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 245 place count 123 transition count 684
Iterating global reduction 3 with 7 rules applied. Total rules applied 252 place count 123 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 253 place count 123 transition count 683
Applied a total of 253 rules in 28 ms. Remains 123 /239 variables (removed 116) and now considering 683/828 (removed 145) transitions.
[2024-05-29 13:30:53] [INFO ] Flow matrix only has 671 transitions (discarded 12 similar events)
// Phase 1: matrix 671 rows 123 cols
[2024-05-29 13:30:53] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:30:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 13:30:53] [INFO ] Flow matrix only has 671 transitions (discarded 12 similar events)
[2024-05-29 13:30:53] [INFO ] Invariant cache hit.
[2024-05-29 13:30:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:30:54] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 682 sub problems to find dead transitions.
[2024-05-29 13:30:54] [INFO ] Flow matrix only has 671 transitions (discarded 12 similar events)
[2024-05-29 13:30:54] [INFO ] Invariant cache hit.
[2024-05-29 13:30:54] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:31:04] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:31:05] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:06] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:31:07] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 13:31:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:10] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:31:10] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:31:11] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:31:12] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:31:12] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:31:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:31:12] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:31:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2024-05-29 13:31:15] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-29 13:31:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:31:15] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:31:17] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:31:18] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 13:31:18] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:18] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:31:18] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:31:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:31:20] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:31:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:31:21] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:22] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:31:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:31:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:31:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:31:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:28] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:31:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:31:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:31:28] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:31:28] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:31:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:31:29] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:31:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/794 variables, and 100 constraints, problems are : Problem set: 0 solved, 682 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/123 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 682/682 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:33] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:31:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:31:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:31:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:31:34] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:31:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:31:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:31:35] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:31:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-05-29 13:31:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:31:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 6 (OVERLAPS) 670/793 variables, 123/234 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 516/750 constraints. Problems are: Problem set: 0 solved, 682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/794 variables, and 1432 constraints, problems are : Problem set: 0 solved, 682 unsolved in 32471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 682/682 constraints, Known Traps: 109/109 constraints]
After SMT, in 69098ms problems are : Problem set: 0 solved, 682 unsolved
Search for dead transitions found 0 dead transitions in 69109ms
Starting structural reductions in LTL mode, iteration 1 : 123/239 places, 683/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69603 ms. Remains : 123/239 places, 683/828 transitions.
[2024-05-29 13:32:03] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:32:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:32:03] [INFO ] Input system was already deterministic with 683 transitions.
[2024-05-29 13:32:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:32:03] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:32:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15006405829397162648.gal : 9 ms
[2024-05-29 13:32:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14352912025342548158.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15006405829397162648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14352912025342548158.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86398e+06,1.76468,50292,2,4450,5,81021,6,0,1161,44916,0


Converting to forward existential form...Done !
original formula: AG((((EF((p126==1)) + AG((p170==0))) + ((p77==0)||(p127==1))) + ((p276==1) + ((AX((p256==1)) * (p242==0)) * (((p44==0)||(p121==0))||((p37...176
=> equivalent forward existential formula: (([(EY(((FwdU(Init,TRUE) * !(((E(TRUE U (p126==1)) + !(E(TRUE U !((p170==0))))) + ((p77==0)||(p127==1))))) * !((...520
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t32,...537
(forward)formula 0,1,13.7326,331592,1,0,846,674935,1385,187,23754,390515,1445
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 199 transition count 782
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 199 transition count 782
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 199 transition count 778
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 111 place count 172 transition count 746
Iterating global reduction 1 with 27 rules applied. Total rules applied 138 place count 172 transition count 746
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 149 place count 172 transition count 735
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 161 place count 160 transition count 723
Iterating global reduction 2 with 12 rules applied. Total rules applied 173 place count 160 transition count 723
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 154 transition count 717
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 154 transition count 717
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 148 transition count 711
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 148 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 148 transition count 710
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 202 place count 144 transition count 706
Iterating global reduction 3 with 4 rules applied. Total rules applied 206 place count 144 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 144 transition count 705
Applied a total of 207 rules in 31 ms. Remains 144 /239 variables (removed 95) and now considering 705/828 (removed 123) transitions.
[2024-05-29 13:32:17] [INFO ] Flow matrix only has 695 transitions (discarded 10 similar events)
// Phase 1: matrix 695 rows 144 cols
[2024-05-29 13:32:17] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 13:32:17] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 13:32:17] [INFO ] Flow matrix only has 695 transitions (discarded 10 similar events)
[2024-05-29 13:32:17] [INFO ] Invariant cache hit.
[2024-05-29 13:32:17] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:32:17] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2024-05-29 13:32:17] [INFO ] Flow matrix only has 695 transitions (discarded 10 similar events)
[2024-05-29 13:32:17] [INFO ] Invariant cache hit.
[2024-05-29 13:32:17] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:32:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:32:32] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:35] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:32:35] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:32:35] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:32:38] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:32:38] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:32:39] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:32:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:32:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:32:40] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:32:40] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:32:42] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:45] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:32:45] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:47] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:32:48] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:32:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:32:54] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
SMT process timed out in 36908ms, After SMT, problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 36919ms
Starting structural reductions in LTL mode, iteration 1 : 144/239 places, 705/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37424 ms. Remains : 144/239 places, 705/828 transitions.
[2024-05-29 13:32:54] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:32:54] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:32:54] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-29 13:32:55] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:32:55] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality785494970013746369.gal : 6 ms
[2024-05-29 13:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6782711911159886811.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality785494970013746369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6782711911159886811.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.84353e+06,2.45735,65712,2,5519,5,90412,6,0,1269,53569,0


Converting to forward existential form...Done !
original formula: (AX(((p223==0)||(p90==1))) * (!(E(!(((AX(((p248==0)||(p150==1))) * (p59==1)) + (p136==1))) U ((p205!=0) + ((EF((p160==0)) * ((p248==0)||(...240
=> equivalent forward existential formula: ([(EY(Init) * !(((p223==0)||(p90==1))))] = FALSE * [FwdG((Init * !(!(E(!(((!(EX(!(((p248==0)||(p150==1))))) * (p...334
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t8, t9, t10, t11, t13, t14, t16, t17, t18, t19, t20, t21, t23, t25, t26, t28, t30...553
Detected timeout of ITS tools.
[2024-05-29 13:33:25] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:33:25] [INFO ] Applying decomposition
[2024-05-29 13:33:25] [INFO ] Flatten gal took : 26 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/graph12923169522495406921.txt' '-o' '/tmp/graph12923169522495406921.bin' '-w' '/tmp/graph12923169522495406921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12923169522495406921.bin' '-l' '-1' '-v' '-w' '/tmp/graph12923169522495406921.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:33:25] [INFO ] Decomposing Gal with order
[2024-05-29 13:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:33:25] [INFO ] Removed a total of 4153 redundant transitions.
[2024-05-29 13:33:25] [INFO ] Flatten gal took : 174 ms
[2024-05-29 13:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 69 ms.
[2024-05-29 13:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11119121133590168210.gal : 20 ms
[2024-05-29 13:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3778119907077009591.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11119121133590168210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3778119907077009591.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.84353e+06,0.979758,45544,1802,28,32917,266,963,316091,65,945,0


Converting to forward existential form...Done !
original formula: (AX(((i12.u28.p223==0)||(i3.u15.p90==1))) * (!(E(!(((AX(((i10.i0.u45.p248==0)||(i7.u26.p150==1))) * (i1.i1.u9.p59==1)) + (i6.i0.u20.p136=...373
=> equivalent forward existential formula: ([(EY(Init) * !(((i12.u28.p223==0)||(i3.u15.p90==1))))] = FALSE * [FwdG((Init * !(!(E(!(((!(EX(!(((i10.i0.u45.p2...467
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t11, t13, t18, t23, t25, t28, t30, t33, t38, t51, t687, t689, t691, t693, t697, t699,...802
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,22.3617,366304,1,0,493013,438,14476,1.78716e+06,322,1582,2073256
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 238 transition count 680
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 178 rules applied. Total rules applied 325 place count 91 transition count 649
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 337 place count 86 transition count 642
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 341 place count 84 transition count 640
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 341 place count 84 transition count 626
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 369 place count 70 transition count 626
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 380 place count 59 transition count 608
Iterating global reduction 4 with 11 rules applied. Total rules applied 391 place count 59 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 392 place count 59 transition count 607
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 397 place count 54 transition count 597
Iterating global reduction 5 with 5 rules applied. Total rules applied 402 place count 54 transition count 597
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 464 place count 54 transition count 535
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 482 place count 45 transition count 526
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 6 with 72 rules applied. Total rules applied 554 place count 45 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 352 transitions
Redundant transition composition rules discarded 352 transitions
Iterating global reduction 7 with 352 rules applied. Total rules applied 906 place count 45 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 922 place count 37 transition count 94
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 930 place count 29 transition count 86
Applied a total of 930 rules in 71 ms. Remains 29 /239 variables (removed 210) and now considering 86/828 (removed 742) transitions.
[2024-05-29 13:33:48] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 29 cols
[2024-05-29 13:33:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:33:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 13:33:48] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-05-29 13:33:48] [INFO ] Invariant cache hit.
[2024-05-29 13:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:33:48] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-29 13:33:48] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-29 13:33:48] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-05-29 13:33:48] [INFO ] Invariant cache hit.
[2024-05-29 13:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 7 ms to minimize.
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:33:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 77/106 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:33:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:33:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 98 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 77/106 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 136 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 67/67 constraints]
After SMT, in 4010ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4011ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/239 places, 86/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4404 ms. Remains : 29/239 places, 86/828 transitions.
[2024-05-29 13:33:52] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:33:52] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:33:52] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-29 13:33:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:33:52] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:33:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12841526588279832569.gal : 18 ms
[2024-05-29 13:33:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality32944790879717675.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12841526588279832569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality32944790879717675.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 203 steps (3 resets) in 5 ms. (33 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 238 transition count 680
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 177 rules applied. Total rules applied 324 place count 91 transition count 650
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 336 place count 86 transition count 643
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 340 place count 84 transition count 641
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 340 place count 84 transition count 626
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 370 place count 69 transition count 626
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 379 place count 60 transition count 611
Iterating global reduction 4 with 9 rules applied. Total rules applied 388 place count 60 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 391 place count 60 transition count 608
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 395 place count 56 transition count 600
Iterating global reduction 5 with 4 rules applied. Total rules applied 399 place count 56 transition count 600
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 459 place count 56 transition count 540
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 477 place count 47 transition count 531
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 6 with 72 rules applied. Total rules applied 549 place count 47 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 360 transitions
Redundant transition composition rules discarded 360 transitions
Iterating global reduction 7 with 360 rules applied. Total rules applied 909 place count 47 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 925 place count 39 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 39 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 927 place count 39 transition count 90
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 935 place count 31 transition count 82
Applied a total of 935 rules in 63 ms. Remains 31 /239 variables (removed 208) and now considering 82/828 (removed 746) transitions.
[2024-05-29 13:33:52] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
// Phase 1: matrix 72 rows 31 cols
[2024-05-29 13:33:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 13:33:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 13:33:52] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-05-29 13:33:52] [INFO ] Invariant cache hit.
[2024-05-29 13:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:33:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 13:33:52] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-29 13:33:52] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-05-29 13:33:53] [INFO ] Invariant cache hit.
[2024-05-29 13:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 8/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 71/102 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 95 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 8/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 71/102 variables, 31/96 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 139 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 63/63 constraints]
After SMT, in 4155ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 4156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/239 places, 82/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4352 ms. Remains : 31/239 places, 82/828 transitions.
[2024-05-29 13:33:57] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:33:57] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:33:57] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-29 13:33:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:33:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:33:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2159123737419862789.gal : 1 ms
[2024-05-29 13:33:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality15492515874579233931.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2159123737419862789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15492515874579233931.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,531,0.026013,4580,2,164,5,1557,6,0,194,957,0


Converting to forward existential form...Done !
original formula: EG((((p81==0)||(p152==1))&&((p221==0)||(p165==1))))
=> equivalent forward existential formula: [FwdG(Init,(((p81==0)||(p152==1))&&((p221==0)||(p165==1))))] != FALSE
Hit Full ! (commute/partial/dont) 73/6/9
(forward)formula 0,1,0.048658,4900,1,0,7,3708,19,2,1899,2286,8
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 194 transition count 776
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 194 transition count 776
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 97 place count 194 transition count 769
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 126 place count 165 transition count 735
Iterating global reduction 1 with 29 rules applied. Total rules applied 155 place count 165 transition count 735
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 163 place count 165 transition count 727
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 181 place count 147 transition count 709
Iterating global reduction 2 with 18 rules applied. Total rules applied 199 place count 147 transition count 709
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 211 place count 135 transition count 697
Iterating global reduction 2 with 12 rules applied. Total rules applied 223 place count 135 transition count 697
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 234 place count 124 transition count 686
Iterating global reduction 2 with 11 rules applied. Total rules applied 245 place count 124 transition count 686
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 250 place count 124 transition count 681
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 255 place count 119 transition count 676
Iterating global reduction 3 with 5 rules applied. Total rules applied 260 place count 119 transition count 676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 119 transition count 675
Applied a total of 261 rules in 26 ms. Remains 119 /239 variables (removed 120) and now considering 675/828 (removed 153) transitions.
[2024-05-29 13:33:57] [INFO ] Flow matrix only has 666 transitions (discarded 9 similar events)
// Phase 1: matrix 666 rows 119 cols
[2024-05-29 13:33:57] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 13:33:57] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 13:33:57] [INFO ] Flow matrix only has 666 transitions (discarded 9 similar events)
[2024-05-29 13:33:57] [INFO ] Invariant cache hit.
[2024-05-29 13:33:57] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:33:57] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 674 sub problems to find dead transitions.
[2024-05-29 13:33:57] [INFO ] Flow matrix only has 666 transitions (discarded 9 similar events)
[2024-05-29 13:33:57] [INFO ] Invariant cache hit.
[2024-05-29 13:33:57] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:34:07] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:34:08] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:34:09] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:34:10] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:34:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:13] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:34:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:34:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:34:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:34:13] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:34:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:34:15] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:34:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:34:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:34:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:21] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:34:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:34:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:34:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 10 (OVERLAPS) 665/784 variables, 119/212 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 516/728 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/785 variables, and 728 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-05-29 13:34:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 5 (OVERLAPS) 665/784 variables, 119/213 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 516/729 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/785 variables, and 1403 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 93/93 constraints]
After SMT, in 67408ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 67415ms
Starting structural reductions in LTL mode, iteration 1 : 119/239 places, 675/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67917 ms. Remains : 119/239 places, 675/828 transitions.
[2024-05-29 13:35:05] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:35:05] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:35:05] [INFO ] Input system was already deterministic with 675 transitions.
[2024-05-29 13:35:05] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:35:05] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:35:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality14820573193539844514.gal : 6 ms
[2024-05-29 13:35:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16469249794576110733.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14820573193539844514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16469249794576110733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80255e+06,2.69134,70876,2,5003,5,73053,6,0,1142,48115,0


Converting to forward existential form...Done !
original formula: EG((((p193==0)||(p29==1)) * ((A(!(EG((p287==1))) U AX(((p94==0)||(p252==1)))) * (p10==1)) + ((EG((p286==0)) * EF(EX((p127==1)))) * (EX((p...182
=> equivalent forward existential formula: [FwdG(Init,(((p193==0)||(p29==1)) * ((!((E(!(!(EX(!(((p94==0)||(p252==1)))))) U (!(!(EG((p287==1)))) * !(!(EX(!(...328
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...488
Using saturation style SCC detection
(forward)formula 0,0,24.9699,579652,1,0,1266,1.30885e+06,1389,350,24877,821379,2016
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 200 transition count 785
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 200 transition count 785
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 200 transition count 779
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 107 place count 177 transition count 754
Iterating global reduction 1 with 23 rules applied. Total rules applied 130 place count 177 transition count 754
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 177 transition count 746
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 150 place count 165 transition count 734
Iterating global reduction 2 with 12 rules applied. Total rules applied 162 place count 165 transition count 734
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 171 place count 156 transition count 725
Iterating global reduction 2 with 9 rules applied. Total rules applied 180 place count 156 transition count 725
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 189 place count 147 transition count 716
Iterating global reduction 2 with 9 rules applied. Total rules applied 198 place count 147 transition count 716
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 201 place count 147 transition count 713
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 206 place count 142 transition count 708
Iterating global reduction 3 with 5 rules applied. Total rules applied 211 place count 142 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 142 transition count 706
Applied a total of 213 rules in 29 ms. Remains 142 /239 variables (removed 97) and now considering 706/828 (removed 122) transitions.
[2024-05-29 13:35:30] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
// Phase 1: matrix 694 rows 142 cols
[2024-05-29 13:35:30] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 13:35:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 13:35:30] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
[2024-05-29 13:35:30] [INFO ] Invariant cache hit.
[2024-05-29 13:35:30] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:35:31] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-29 13:35:31] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
[2024-05-29 13:35:31] [INFO ] Invariant cache hit.
[2024-05-29 13:35:31] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:35:42] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:35:43] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:35:48] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:49] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:35:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:35:51] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:35:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:35:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:35:55] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 8 (OVERLAPS) 693/835 variables, 142/243 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 516/759 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/836 variables, and 759 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 13:36:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:36:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:36:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:36:11] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:36:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:36:13] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 5 (OVERLAPS) 693/835 variables, 142/250 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 516/766 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/836 variables, and 1471 constraints, problems are : Problem set: 0 solved, 705 unsolved in 31664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 107/107 constraints]
After SMT, in 68290ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 68300ms
Starting structural reductions in LTL mode, iteration 1 : 142/239 places, 706/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68840 ms. Remains : 142/239 places, 706/828 transitions.
[2024-05-29 13:36:39] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:36:39] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:36:39] [INFO ] Input system was already deterministic with 706 transitions.
[2024-05-29 13:36:39] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:36:39] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:36:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality3146033141329787806.gal : 9 ms
[2024-05-29 13:36:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17262686885294429285.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3146033141329787806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17262686885294429285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86733e+06,1.719,50960,2,4861,5,81360,6,0,1262,45791,0


Converting to forward existential form...Done !
original formula: A((((p10==0) + EG(((((p29==1)||(p205==0))||(p77==1))&&((p172==0)||(p290==1))))) + (!((((p122==0)||(p204==1)) * E(((p281==0)||(p239==1)) U...284
=> equivalent forward existential formula: [((Init * !(EG(!(EG(EX((EX((p245==1)) + E((p103==0) U ((p175==0)||(p113==1)))))))))) * !(E(!(EG(EX((EX((p245==1)...505
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t30, t32,...541
(forward)formula 0,1,10.9113,271220,1,0,880,616040,1433,182,24964,461383,1478
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 238 transition count 684
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 172 rules applied. Total rules applied 315 place count 95 transition count 655
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 324 place count 91 transition count 650
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 329 place count 90 transition count 646
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 335 place count 87 transition count 643
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 338 place count 86 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 339 place count 85 transition count 641
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 339 place count 85 transition count 626
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 369 place count 70 transition count 626
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 378 place count 61 transition count 611
Iterating global reduction 7 with 9 rules applied. Total rules applied 387 place count 61 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 390 place count 61 transition count 608
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 394 place count 57 transition count 600
Iterating global reduction 8 with 4 rules applied. Total rules applied 398 place count 57 transition count 600
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 426 place count 57 transition count 572
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 444 place count 48 transition count 563
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 9 with 40 rules applied. Total rules applied 484 place count 48 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 436 transitions
Redundant transition composition rules discarded 436 transitions
Iterating global reduction 10 with 436 rules applied. Total rules applied 920 place count 48 transition count 87
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 936 place count 40 transition count 79
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 937 place count 40 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 938 place count 40 transition count 78
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 945 place count 33 transition count 71
Applied a total of 945 rules in 71 ms. Remains 33 /239 variables (removed 206) and now considering 71/828 (removed 757) transitions.
[2024-05-29 13:36:50] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
// Phase 1: matrix 61 rows 33 cols
[2024-05-29 13:36:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 13:36:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:36:50] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2024-05-29 13:36:50] [INFO ] Invariant cache hit.
[2024-05-29 13:36:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 13:36:51] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-29 13:36:51] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-29 13:36:51] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2024-05-29 13:36:51] [INFO ] Invariant cache hit.
[2024-05-29 13:36:51] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:36:51] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:36:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 60/93 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-29 13:36:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (OVERLAPS) 1/94 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/94 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 16 (OVERLAPS) 0/94 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 118 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 60/93 variables, 33/102 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 15/117 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 70/187 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 1/94 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/94 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 188 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 67/67 constraints]
After SMT, in 5496ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 5497ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/239 places, 71/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5913 ms. Remains : 33/239 places, 71/828 transitions.
[2024-05-29 13:36:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:36:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:36:56] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-29 13:36:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:36:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:36:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11535788865231613488.gal : 1 ms
[2024-05-29 13:36:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13834997530371727550.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11535788865231613488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13834997530371727550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,660,0.02012,4256,2,209,5,1996,6,0,190,1204,0


Converting to forward existential form...Done !
original formula: AG((((AF((p281==0)) + EF((p115==0))) + (E((p267==1) U (p283==1)) + (p253==0))) + (p8==1)))
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !((p8==1))) * !((E((p267==1) U (p283==1)) + (p253==0)))) * !(E(TRUE U (p115==0)))),!(...175
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t23, t24...285
(forward)formula 0,1,0.067938,5368,1,0,129,7247,162,50,2307,6142,149
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 238 transition count 681
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 176 rules applied. Total rules applied 322 place count 92 transition count 651
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 331 place count 88 transition count 646
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 333 place count 87 transition count 645
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 333 place count 87 transition count 629
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 365 place count 71 transition count 629
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 376 place count 60 transition count 611
Iterating global reduction 4 with 11 rules applied. Total rules applied 387 place count 60 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 390 place count 60 transition count 608
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 395 place count 55 transition count 598
Iterating global reduction 5 with 5 rules applied. Total rules applied 400 place count 55 transition count 598
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 5 with 124 rules applied. Total rules applied 524 place count 55 transition count 474
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 546 place count 44 transition count 463
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Iterating post reduction 6 with 138 rules applied. Total rules applied 684 place count 44 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 7 with 256 rules applied. Total rules applied 940 place count 44 transition count 69
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 956 place count 36 transition count 61
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 963 place count 29 transition count 54
Applied a total of 963 rules in 46 ms. Remains 29 /239 variables (removed 210) and now considering 54/828 (removed 774) transitions.
[2024-05-29 13:36:56] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
// Phase 1: matrix 46 rows 29 cols
[2024-05-29 13:36:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:36:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 13:36:56] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-29 13:36:56] [INFO ] Invariant cache hit.
[2024-05-29 13:36:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 13:36:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 13:36:56] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 13:36:56] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-29 13:36:56] [INFO ] Invariant cache hit.
[2024-05-29 13:36:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:36:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 45/74 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:36:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1/75 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 0/75 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 96 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:36:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:36:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 45/74 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 53/150 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 13:37:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 1/75 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 0/75 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 153 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 62/62 constraints]
After SMT, in 4189ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4190ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/239 places, 54/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4365 ms. Remains : 29/239 places, 54/828 transitions.
[2024-05-29 13:37:01] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:37:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:01] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-29 13:37:01] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:37:01] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:37:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13299936497250209245.gal : 5 ms
[2024-05-29 13:37:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17534220812284778617.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13299936497250209245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17534220812284778617.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,276,0.017117,3952,2,156,5,1429,6,0,161,867,0


Converting to forward existential form...Done !
original formula: EG(((p247==0)||(p233==1)))
=> equivalent forward existential formula: [FwdG(Init,((p247==0)||(p233==1)))] != FALSE
Hit Full ! (commute/partial/dont) 50/0/4
(forward)formula 0,0,0.02901,4272,1,0,9,3111,19,2,1220,1698,10
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 238 transition count 680
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 177 rules applied. Total rules applied 324 place count 91 transition count 650
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 333 place count 87 transition count 645
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 336 place count 86 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 85 transition count 643
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 337 place count 85 transition count 629
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 365 place count 71 transition count 629
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 376 place count 60 transition count 612
Iterating global reduction 5 with 11 rules applied. Total rules applied 387 place count 60 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 60 transition count 611
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 393 place count 55 transition count 601
Iterating global reduction 6 with 5 rules applied. Total rules applied 398 place count 55 transition count 601
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 6 with 62 rules applied. Total rules applied 460 place count 55 transition count 539
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 480 place count 45 transition count 529
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 7 with 73 rules applied. Total rules applied 553 place count 45 transition count 456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 555 place count 44 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 556 place count 44 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 377 transitions
Redundant transition composition rules discarded 377 transitions
Iterating global reduction 9 with 377 rules applied. Total rules applied 933 place count 44 transition count 77
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 949 place count 36 transition count 69
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 9 with 7 rules applied. Total rules applied 956 place count 29 transition count 62
Applied a total of 956 rules in 49 ms. Remains 29 /239 variables (removed 210) and now considering 62/828 (removed 766) transitions.
[2024-05-29 13:37:01] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
// Phase 1: matrix 54 rows 29 cols
[2024-05-29 13:37:01] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:37:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 13:37:01] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-05-29 13:37:01] [INFO ] Invariant cache hit.
[2024-05-29 13:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:37:01] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 13:37:01] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-29 13:37:01] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-05-29 13:37:01] [INFO ] Invariant cache hit.
[2024-05-29 13:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:01] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 53/82 variables, 29/84 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:03] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:03] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:03] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/83 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/83 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 95 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 13:37:03] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 53/82 variables, 29/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 65/65 constraints]
After SMT, in 3590ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3590ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/239 places, 62/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3725 ms. Remains : 29/239 places, 62/828 transitions.
[2024-05-29 13:37:04] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:37:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:37:04] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-29 13:37:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11459109194708560338.gal : 2 ms
[2024-05-29 13:37:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality175443726974459179.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11459109194708560338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality175443726974459179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,530,0.023641,4120,2,163,5,1619,6,0,170,1032,0


Converting to forward existential form...Done !
original formula: EG(((p277==0)||(p6==1)))
=> equivalent forward existential formula: [FwdG(Init,((p277==0)||(p6==1)))] != FALSE
Hit Full ! (commute/partial/dont) 58/0/4
(forward)formula 0,1,0.043342,4440,1,0,7,3878,19,2,1575,2724,8
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 238 transition count 679
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 179 rules applied. Total rules applied 327 place count 90 transition count 648
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 339 place count 85 transition count 641
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 344 place count 83 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 345 place count 82 transition count 638
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 345 place count 82 transition count 623
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 375 place count 67 transition count 623
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 386 place count 56 transition count 605
Iterating global reduction 5 with 11 rules applied. Total rules applied 397 place count 56 transition count 605
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 400 place count 56 transition count 602
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 405 place count 51 transition count 592
Iterating global reduction 6 with 5 rules applied. Total rules applied 410 place count 51 transition count 592
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 6 with 124 rules applied. Total rules applied 534 place count 51 transition count 468
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 552 place count 42 transition count 459
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 7 with 136 rules applied. Total rules applied 688 place count 42 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 8 with 256 rules applied. Total rules applied 944 place count 42 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 960 place count 34 transition count 59
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 962 place count 34 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 963 place count 34 transition count 58
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 971 place count 26 transition count 50
Applied a total of 971 rules in 44 ms. Remains 26 /239 variables (removed 213) and now considering 50/828 (removed 778) transitions.
[2024-05-29 13:37:04] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
// Phase 1: matrix 42 rows 26 cols
[2024-05-29 13:37:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:37:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 13:37:04] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
[2024-05-29 13:37:04] [INFO ] Invariant cache hit.
[2024-05-29 13:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:37:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 13:37:04] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-29 13:37:04] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
[2024-05-29 13:37:04] [INFO ] Invariant cache hit.
[2024-05-29 13:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 8/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 41/67 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 1/68 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/68 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 93 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 8/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/67 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 33/125 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/68 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 126 constraints, problems are : Problem set: 0 solved, 33 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 65/65 constraints]
After SMT, in 3078ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 3078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/239 places, 50/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3195 ms. Remains : 26/239 places, 50/828 transitions.
[2024-05-29 13:37:08] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:37:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:08] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-29 13:37:08] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:37:08] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:37:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3881422821865442805.gal : 0 ms
[2024-05-29 13:37:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15034494492207317205.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3881422821865442805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15034494492207317205.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,273,0.019846,3952,2,178,5,1448,6,0,146,959,0


Converting to forward existential form...Done !
original formula: EG((p82==0))
=> equivalent forward existential formula: [FwdG(Init,(p82==0))] != FALSE
Hit Full ! (commute/partial/dont) 48/0/2
(forward)formula 0,1,0.03542,4536,1,0,7,3653,19,2,1152,2162,8
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 238 transition count 695
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 156 rules applied. Total rules applied 288 place count 106 transition count 671
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 296 place count 103 transition count 666
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 303 place count 101 transition count 661
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 306 place count 98 transition count 661
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 306 place count 98 transition count 644
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 340 place count 81 transition count 644
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 351 place count 70 transition count 626
Iterating global reduction 5 with 11 rules applied. Total rules applied 362 place count 70 transition count 626
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 365 place count 70 transition count 623
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 370 place count 65 transition count 613
Iterating global reduction 6 with 5 rules applied. Total rules applied 375 place count 65 transition count 613
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 6 with 124 rules applied. Total rules applied 499 place count 65 transition count 489
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 521 place count 54 transition count 478
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Iterating post reduction 7 with 137 rules applied. Total rules applied 658 place count 54 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 8 with 256 rules applied. Total rules applied 914 place count 54 transition count 85
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 930 place count 46 transition count 77
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 934 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 935 place count 46 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 936 place count 46 transition count 75
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 942 place count 40 transition count 69
Applied a total of 942 rules in 54 ms. Remains 40 /239 variables (removed 199) and now considering 69/828 (removed 759) transitions.
[2024-05-29 13:37:08] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
// Phase 1: matrix 61 rows 40 cols
[2024-05-29 13:37:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:37:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 13:37:08] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
[2024-05-29 13:37:08] [INFO ] Invariant cache hit.
[2024-05-29 13:37:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:37:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 13:37:08] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-29 13:37:08] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
[2024-05-29 13:37:08] [INFO ] Invariant cache hit.
[2024-05-29 13:37:08] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:08] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:09] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 13:37:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 60/100 variables, 40/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 14/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 1/101 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 13 (OVERLAPS) 0/101 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 123 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/40 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-29 13:37:11] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 60/100 variables, 40/110 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 14/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 67/191 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/101 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 192 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2097 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 69/69 constraints]
After SMT, in 5421ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5422ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/239 places, 69/828 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5582 ms. Remains : 40/239 places, 69/828 transitions.
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:13] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality6513246232781687555.gal : 1 ms
[2024-05-29 13:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1986719063318143149.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6513246232781687555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1986719063318143149.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,291,0.018012,4004,2,262,5,1654,6,0,219,1048,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p67==0)&&(p230==1))) + AF((p26==1))) + ((AF(E(((p178==0)||(p170==1)) U ((p13==0)||(p46==1)))) * (p119==0)) * (p57==0))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !((E(TRUE U ((p67==0)&&(p230==1))) + !(EG(!((p26==1))))))),!(E(((p178==0)||(p170==1))...405
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t18, t26, t41, t44, t46, t48...295
(forward)formula 0,1,0.0918,6964,1,0,168,15195,171,83,1928,14518,212
FORMULA StigmergyCommit-PT-07a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-29 13:37:13] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 27 ms
Total runtime 603458 ms.

BK_STOP 1716989833936

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531700169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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