Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000234.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BART-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 450K Mar 5 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Mar 5 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 690K Mar 5 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 309K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 832K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 141K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 372K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 501K Mar 5 09:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 553K Mar 5 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Mar 5 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 36K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 74K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-005-CTLFireability-2024-00
FORMULA_NAME BART-PT-005-CTLFireability-2024-01
FORMULA_NAME BART-PT-005-CTLFireability-2024-02
FORMULA_NAME BART-PT-005-CTLFireability-2024-03
FORMULA_NAME BART-PT-005-CTLFireability-2024-04
FORMULA_NAME BART-PT-005-CTLFireability-2024-05
FORMULA_NAME BART-PT-005-CTLFireability-2024-06
FORMULA_NAME BART-PT-005-CTLFireability-2024-07
FORMULA_NAME BART-PT-005-CTLFireability-2024-08
FORMULA_NAME BART-PT-005-CTLFireability-2024-09
FORMULA_NAME BART-PT-005-CTLFireability-2024-10
FORMULA_NAME BART-PT-005-CTLFireability-2024-11
FORMULA_NAME BART-PT-005-CTLFireability-2024-12
FORMULA_NAME BART-PT-005-CTLFireability-2024-13
FORMULA_NAME BART-PT-005-CTLFireability-2024-14
FORMULA_NAME BART-PT-005-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779549349251

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 15:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 15:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:15:51] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2026-05-23 15:15:51] [INFO ] Transformed 870 places.
[2026-05-23 15:15:51] [INFO ] Transformed 1010 transitions.
[2026-05-23 15:15:51] [INFO ] Found NUPN structural information;
[2026-05-23 15:15:51] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 53 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 25 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12531219086680375535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-961381463918088279.kers'
[2026-05-23 15:15:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12531219086680375535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-961381463918088279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1010 rows 660 cols 2020 entries
Finished phase 1 with 655 SingleSign rule and 0 generalized
[2026-05-23 15:15:51] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-961381463918088279.kers
Total runtime 7 ms.
[2026-05-23 15:15:52] [INFO ] Implicit Places using invariants in 611 ms returned []
[2026-05-23 15:15:52] [INFO ] Invariant cache hit.
[2026-05-23 15:15:53] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2026-05-23 15:15:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30062 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30028 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in LTL mode , in 1 iterations and 61897 ms. Remains : 660/660 places, 1010/1010 transitions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 7 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2026-05-23 15:16:53] [INFO ] Invariant cache hit.
[2026-05-23 15:16:53] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-23 15:16:53] [INFO ] Invariant cache hit.
[2026-05-23 15:16:54] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2026-05-23 15:16:55] [INFO ] Flatten gal took : 155 ms
[2026-05-23 15:16:55] [INFO ] Flatten gal took : 90 ms
[2026-05-23 15:16:55] [INFO ] Input system was already deterministic with 1010 transitions.
RANDOM walk for 40000 steps (8 resets) in 2083 ms. (19 steps per ms) remains 3/43 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 367 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2026-05-23 15:16:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 396/1670 variables, and 10 constraints, problems are : Problem set: 2 solved, 0 unsolved in 111 ms.
Refiners :[Domain max(s): 7/660 constraints, Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-23 15:16:56] [INFO ] Flatten gal took : 50 ms
[2026-05-23 15:16:57] [INFO ] Flatten gal took : 62 ms
[2026-05-23 15:16:57] [INFO ] Input system was already deterministic with 1010 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 615 transition count 965
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 615 transition count 965
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 585 transition count 935
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 165 place count 570 transition count 920
Iterating global reduction 0 with 15 rules applied. Total rules applied 180 place count 570 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 555 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 555 transition count 905
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 540 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 540 transition count 890
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 525 transition count 875
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 525 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 515 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 300 place count 505 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 315 place count 500 transition count 850
Iterating global reduction 0 with 5 rules applied. Total rules applied 320 place count 500 transition count 850
Applied a total of 320 rules in 88 ms. Remains 500 /660 variables (removed 160) and now considering 850/1010 (removed 160) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18198414366941675728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1958072509425009869.kers'
[2026-05-23 15:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18198414366941675728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1958072509425009869.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 850 rows 500 cols 1700 entries
Finished phase 1 with 495 SingleSign rule and 0 generalized
[2026-05-23 15:16:57] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1958072509425009869.kers
Total runtime 8 ms.
[2026-05-23 15:16:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 15:16:57] [INFO ] Invariant cache hit.
[2026-05-23 15:16:57] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2026-05-23 15:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/1350 variables, and 5 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1350 variables, 670/1175 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 1175 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 500/660 places, 850/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60847 ms. Remains : 500/660 places, 850/1010 transitions.
[2026-05-23 15:17:58] [INFO ] Flatten gal took : 32 ms
[2026-05-23 15:17:58] [INFO ] Flatten gal took : 32 ms
[2026-05-23 15:17:58] [INFO ] Input system was already deterministic with 850 transitions.
[2026-05-23 15:17:58] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:17:58] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:17:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3384660064507956770.gal : 19 ms
[2026-05-23 15:17:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14930013307846289969.ctl : 16 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3384660064507956770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14930013307846289969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1e+10,3.1932,90800,2,15540,5,585002,6,0,2853,322496,0


Converting to forward existential form...Done !
original formula: !(E((!(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(TrainState_5_2_10==1)))||(((TrainState_2_1_26=...38109
=> equivalent forward existential formula: [FwdG(EY((FwdU(FwdU(Init,(!(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(...38168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 665/0/185
Detected timeout of ITS tools.
[2026-05-23 15:18:28] [INFO ] Flatten gal took : 26 ms
[2026-05-23 15:18:28] [INFO ] Applying decomposition
[2026-05-23 15:18:28] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph4603883119341259153.txt' '-o' '/tmp/graph4603883119341259153.bin' '-w' '/tmp/graph4603883119341259153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4603883119341259153.bin' '-l' '-1' '-v' '-w' '/tmp/graph4603883119341259153.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:18:28] [INFO ] Decomposing Gal with order
[2026-05-23 15:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:18:28] [INFO ] Removed a total of 209 redundant transitions.
[2026-05-23 15:18:29] [INFO ] Flatten gal took : 164 ms
[2026-05-23 15:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 13 ms.
[2026-05-23 15:18:29] [INFO ] Time to serialize gal into /tmp/CTLFireability592719024247875684.gal : 18 ms
[2026-05-23 15:18:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2045708551841254584.ctl : 9 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability592719024247875684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2045708551841254584.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,1e+10,0.224087,9124,223,91,4089,7921,951,4284,409,11557,0


Converting to forward existential form...Done !
original formula: !(E((!(((((((((((i2.i1.u6.TrainState_4_1_38==1)||(i1.i0.u13.TrainState_1_1_15==1))||((i1.i0.u13.TrainState_1_1_31==1)||(i4.i0.u10.TrainSt...52997
=> equivalent forward existential formula: [FwdG(EY((FwdU(FwdU(Init,(!(((((((((((i2.i1.u6.TrainState_4_1_38==1)||(i1.i0.u13.TrainState_1_1_15==1))||((i1.i0...53056
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,1.44731,37012,1,0,19277,138978,8546,28674,2438,144975,41829
FORMULA BART-PT-005-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 615 transition count 965
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 615 transition count 965
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 585 transition count 935
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 165 place count 570 transition count 920
Iterating global reduction 0 with 15 rules applied. Total rules applied 180 place count 570 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 555 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 555 transition count 905
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 540 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 540 transition count 890
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 525 transition count 875
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 525 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 515 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 300 place count 505 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 315 place count 500 transition count 850
Iterating global reduction 0 with 5 rules applied. Total rules applied 320 place count 500 transition count 850
Applied a total of 320 rules in 42 ms. Remains 500 /660 variables (removed 160) and now considering 850/1010 (removed 160) transitions.
[2026-05-23 15:18:30] [INFO ] Invariant cache hit.
[2026-05-23 15:18:30] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 15:18:30] [INFO ] Invariant cache hit.
[2026-05-23 15:18:31] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 500/660 places, 850/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 500/660 places, 850/1010 transitions.
[2026-05-23 15:18:31] [INFO ] Flatten gal took : 22 ms
[2026-05-23 15:18:31] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:18:31] [INFO ] Input system was already deterministic with 850 transitions.
[2026-05-23 15:18:31] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:18:31] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:18:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3774305474155600606.gal : 5 ms
[2026-05-23 15:18:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15903614755203064311.ctl : 5 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3774305474155600606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15903614755203064311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1e+10,3.16131,90624,2,15540,5,585002,6,0,2853,322496,0


Converting to forward existential form...Done !
original formula: (E(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(TrainState_5_2_10==1)))||(((TrainState_2_1_26==1)|...30356
=> equivalent forward existential formula: [FwdG((Init * E(((((((((((TrainState_4_1_38==1)||(TrainState_1_1_15==1))||((TrainState_1_1_31==1)||(TrainState_5...30423
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 60/0/790
Detected timeout of ITS tools.
[2026-05-23 15:19:01] [INFO ] Flatten gal took : 19 ms
[2026-05-23 15:19:01] [INFO ] Applying decomposition
[2026-05-23 15:19:01] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4648182116471547986.txt' '-o' '/tmp/graph4648182116471547986.bin' '-w' '/tmp/graph4648182116471547986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4648182116471547986.bin' '-l' '-1' '-v' '-w' '/tmp/graph4648182116471547986.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:19:01] [INFO ] Decomposing Gal with order
[2026-05-23 15:19:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:19:01] [INFO ] Removed a total of 169 redundant transitions.
[2026-05-23 15:19:01] [INFO ] Flatten gal took : 49 ms
[2026-05-23 15:19:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 10 ms.
[2026-05-23 15:19:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17584082934554844980.gal : 7 ms
[2026-05-23 15:19:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14869482374770673625.ctl : 5 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17584082934554844980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14869482374770673625.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,1e+10,0.197885,8732,283,91,2677,3094,847,2392,357,3043,0


Converting to forward existential form...Done !
original formula: (E(((((((((((i1.u35.TrainState_4_1_38==1)||(i0.u142.TrainState_1_1_15==1))||((i0.u142.TrainState_1_1_31==1)||(i4.i0.i0.u11.TrainState_5_2...40072
=> equivalent forward existential formula: [FwdG((Init * E(((((((((((i1.u35.TrainState_4_1_38==1)||(i0.u142.TrainState_1_1_15==1))||((i0.u142.TrainState_1_...40139
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,0.762413,15492,1,0,8795,27508,10718,13483,2366,26873,20045
FORMULA BART-PT-005-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 660 transition count 690
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 640 place count 340 transition count 690
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 640 place count 340 transition count 670
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 710 place count 290 transition count 640
Iterating global reduction 2 with 30 rules applied. Total rules applied 740 place count 290 transition count 640
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 745 place count 290 transition count 635
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 765 place count 270 transition count 615
Iterating global reduction 3 with 20 rules applied. Total rules applied 785 place count 270 transition count 615
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 800 place count 255 transition count 600
Iterating global reduction 3 with 15 rules applied. Total rules applied 815 place count 255 transition count 600
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 830 place count 240 transition count 585
Iterating global reduction 3 with 15 rules applied. Total rules applied 845 place count 240 transition count 585
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 855 place count 230 transition count 575
Iterating global reduction 3 with 10 rules applied. Total rules applied 865 place count 230 transition count 575
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 875 place count 220 transition count 565
Iterating global reduction 3 with 10 rules applied. Total rules applied 885 place count 220 transition count 565
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 215 transition count 560
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 215 transition count 560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 955 place count 185 transition count 530
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 965 place count 185 transition count 520
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 975 place count 180 transition count 515
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 985 place count 180 transition count 505
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 995 place count 175 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1005 place count 175 transition count 490
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1015 place count 170 transition count 485
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1025 place count 170 transition count 475
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1035 place count 165 transition count 470
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1045 place count 165 transition count 460
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1055 place count 160 transition count 455
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1065 place count 160 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1075 place count 155 transition count 440
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1085 place count 155 transition count 430
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1095 place count 150 transition count 425
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1105 place count 150 transition count 415
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1115 place count 145 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1125 place count 145 transition count 400
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1135 place count 140 transition count 395
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1145 place count 140 transition count 385
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1155 place count 135 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1165 place count 135 transition count 370
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1175 place count 130 transition count 365
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1185 place count 130 transition count 355
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1195 place count 125 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1205 place count 125 transition count 340
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1215 place count 120 transition count 335
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1225 place count 120 transition count 325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1235 place count 115 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1245 place count 115 transition count 310
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1255 place count 110 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1265 place count 110 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1275 place count 105 transition count 290
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1285 place count 105 transition count 280
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1295 place count 100 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1305 place count 100 transition count 265
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1315 place count 95 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1325 place count 95 transition count 250
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 22 with 10 rules applied. Total rules applied 1335 place count 90 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 22 with 10 rules applied. Total rules applied 1345 place count 90 transition count 235
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 23 with 10 rules applied. Total rules applied 1355 place count 85 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 23 with 10 rules applied. Total rules applied 1365 place count 85 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 24 with 10 rules applied. Total rules applied 1375 place count 80 transition count 215
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 24 with 10 rules applied. Total rules applied 1385 place count 80 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 25 with 10 rules applied. Total rules applied 1395 place count 75 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1405 place count 75 transition count 190
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 26 with 10 rules applied. Total rules applied 1415 place count 70 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1425 place count 70 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 27 with 10 rules applied. Total rules applied 1435 place count 65 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1445 place count 65 transition count 160
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 28 with 10 rules applied. Total rules applied 1455 place count 60 transition count 155
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 28 with 10 rules applied. Total rules applied 1465 place count 60 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 29 with 10 rules applied. Total rules applied 1475 place count 55 transition count 140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 29 with 10 rules applied. Total rules applied 1485 place count 55 transition count 130
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 30 with 10 rules applied. Total rules applied 1495 place count 50 transition count 125
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 30 with 10 rules applied. Total rules applied 1505 place count 50 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 31 with 10 rules applied. Total rules applied 1515 place count 45 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 31 with 10 rules applied. Total rules applied 1525 place count 45 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 32 with 10 rules applied. Total rules applied 1535 place count 40 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1545 place count 40 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 33 with 10 rules applied. Total rules applied 1555 place count 35 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1565 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 34 with 10 rules applied. Total rules applied 1575 place count 30 transition count 65
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 34 with 10 rules applied. Total rules applied 1585 place count 30 transition count 55
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 35 with 10 rules applied. Total rules applied 1595 place count 25 transition count 50
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 10 rules applied. Total rules applied 1605 place count 25 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 10 rules applied. Total rules applied 1615 place count 20 transition count 35
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 36 with 15 rules applied. Total rules applied 1630 place count 20 transition count 20
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 37 with 10 rules applied. Total rules applied 1640 place count 15 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 5 Pre rules applied. Total rules applied 1640 place count 15 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 38 with 10 rules applied. Total rules applied 1650 place count 10 transition count 10
Applied a total of 1650 rules in 332 ms. Remains 10 /660 variables (removed 650) and now considering 10/1010 (removed 1000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12191207279448287844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3239525420957368471.kers'
[2026-05-23 15:19:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12191207279448287844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3239525420957368471.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 10 rows 5 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-23 15:19:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3239525420957368471.kers
Total runtime 2 ms.
[2026-05-23 15:19:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 15:19:03] [INFO ] Invariant cache hit.
[2026-05-23 15:19:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2026-05-23 15:19:03] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-23 15:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/20 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/20 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/660 places, 10/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 620 ms. Remains : 10/660 places, 10/1010 transitions.
[2026-05-23 15:19:03] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:19:03] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:19:03] [INFO ] Input system was already deterministic with 10 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
FORMULA BART-PT-005-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 15:19:03] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:19:03] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:19:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1713677448170695906.gal : 1 ms
[2026-05-23 15:19:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5518007123340621066.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1713677448170695906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5518007123340621066.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 660 transition count 995
Reduce places removed 15 places and 0 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Iterating post reduction 1 with 150 rules applied. Total rules applied 165 place count 645 transition count 860
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 300 place count 510 transition count 860
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 305 place count 505 transition count 855
Iterating global reduction 3 with 5 rules applied. Total rules applied 310 place count 505 transition count 855
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 350 place count 485 transition count 835
Applied a total of 350 rules in 57 ms. Remains 485 /660 variables (removed 175) and now considering 835/1010 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15735469098672516982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10087364293865364527.kers'
[2026-05-23 15:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15735469098672516982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10087364293865364527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 835 rows 485 cols 1670 entries
Finished phase 1 with 480 SingleSign rule and 0 generalized
[2026-05-23 15:19:03] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10087364293865364527.kers
Total runtime 5 ms.
[2026-05-23 15:19:03] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-23 15:19:03] [INFO ] Invariant cache hit.
[2026-05-23 15:19:03] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2026-05-23 15:19:03] [INFO ] Redundant transitions in 57 ms returned []
Running 655 sub problems to find dead transitions.
[2026-05-23 15:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 5/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1320 variables, and 5 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 5/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1320 variables, and 5 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 0/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in SI_CTL mode, iteration 1 : 485/660 places, 835/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60843 ms. Remains : 485/660 places, 835/1010 transitions.
[2026-05-23 15:20:04] [INFO ] Flatten gal took : 20 ms
[2026-05-23 15:20:04] [INFO ] Flatten gal took : 20 ms
[2026-05-23 15:20:04] [INFO ] Input system was already deterministic with 835 transitions.
[2026-05-23 15:20:04] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:20:04] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13598699713872141484.gal : 11 ms
[2026-05-23 15:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14537970126740229863.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13598699713872141484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14537970126740229863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,8.58734e+09,4.62205,102804,2,15206,5,649336,6,0,2778,425295,0


Converting to forward existential form...Done !
original formula: EG(EF(((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_13==1)||(TrainState_3_4_16==1)))||(((TrainState_4_1_8==1...8802
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_13==1)||(TrainSta...8851
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,24.3729,520680,1,0,6,3.06495e+06,18,1,13462,678613,10
FORMULA BART-PT-005-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 645 transition count 995
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 645 transition count 995
Applied a total of 30 rules in 27 ms. Remains 645 /660 variables (removed 15) and now considering 995/1010 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7576671030225702827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15254706659640240757.kers'
[2026-05-23 15:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7576671030225702827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15254706659640240757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 995 rows 645 cols 1990 entries
Finished phase 1 with 640 SingleSign rule and 0 generalized
[2026-05-23 15:20:28] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15254706659640240757.kers
Total runtime 6 ms.
[2026-05-23 15:20:29] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-23 15:20:29] [INFO ] Invariant cache hit.
[2026-05-23 15:20:29] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2026-05-23 15:20:29] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 815 unsolved
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Starting structural reductions in LTL mode, iteration 1 : 645/660 places, 995/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31099 ms. Remains : 645/660 places, 995/1010 transitions.
[2026-05-23 15:21:00] [INFO ] Flatten gal took : 26 ms
[2026-05-23 15:21:00] [INFO ] Flatten gal took : 28 ms
[2026-05-23 15:21:00] [INFO ] Input system was already deterministic with 995 transitions.
[2026-05-23 15:21:00] [INFO ] Flatten gal took : 27 ms
[2026-05-23 15:21:00] [INFO ] Flatten gal took : 29 ms
[2026-05-23 15:21:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14883135075223911788.gal : 9 ms
[2026-05-23 15:21:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4937897904781915666.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14883135075223911788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4937897904781915666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.57231e+10,9.54561,220616,2,20198,5,1.35368e+06,6,0,3578,1.10634e+06,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(!(E(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1)) U ...8936
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(E(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(...7447
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 15:21:30] [INFO ] Flatten gal took : 17 ms
[2026-05-23 15:21:30] [INFO ] Applying decomposition
[2026-05-23 15:21:30] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8151976540720098500.txt' '-o' '/tmp/graph8151976540720098500.bin' '-w' '/tmp/graph8151976540720098500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8151976540720098500.bin' '-l' '-1' '-v' '-w' '/tmp/graph8151976540720098500.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:21:30] [INFO ] Decomposing Gal with order
[2026-05-23 15:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:21:30] [INFO ] Removed a total of 67 redundant transitions.
[2026-05-23 15:21:30] [INFO ] Flatten gal took : 51 ms
[2026-05-23 15:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-23 15:21:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11470827738750277917.gal : 8 ms
[2026-05-23 15:21:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2038800080188821892.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11470827738750277917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2038800080188821892.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.57231e+10,0.303636,10264,316,75,6899,2884,1153,8784,232,2019,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(!(E(((((i0.u0.TrainState_1_1_1==1)||(i5.i0.i0.u1.TrainState_2_1_1==1))||((i4.i1.i2.u2.TrainState_3_1_1==1)||(i8.i0.i0.u3.TrainSt...12561
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(E(((((i0.u0.TrainState_1_1_1==1)||(i5.i0.i0.u1.TrainState_2_1_1==1))||((i4.i1...12624
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an 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 1
Fast SCC detection found an 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.7278,47740,1,0,39123,152222,7441,82124,1215,191108,55719
FORMULA BART-PT-005-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 3 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5185765750457203886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2077856067730523685.kers'
[2026-05-23 15:21:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5185765750457203886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2077856067730523685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1010 rows 660 cols 2020 entries
Finished phase 1 with 655 SingleSign rule and 0 generalized
[2026-05-23 15:21:32] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2077856067730523685.kers
Total runtime 6 ms.
[2026-05-23 15:21:32] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-23 15:21:32] [INFO ] Invariant cache hit.
[2026-05-23 15:21:33] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2026-05-23 15:21:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30019 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30025 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 660/660 places, 1010/1010 transitions.
[2026-05-23 15:22:33] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:22:33] [INFO ] Flatten gal took : 19 ms
[2026-05-23 15:22:33] [INFO ] Input system was already deterministic with 1010 transitions.
[2026-05-23 15:22:33] [INFO ] Flatten gal took : 19 ms
[2026-05-23 15:22:33] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:22:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10587969819571075044.gal : 5 ms
[2026-05-23 15:22:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11139428125813506091.ctl : 5 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10587969819571075044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11139428125813506091.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.00746e+10,8.27927,192172,2,20712,5,1.21389e+06,6,0,3653,884823,0


Converting to forward existential form...Done !
original formula: AG((E((AX(((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_13==1)||(TrainState_3_4_16==1)))||(((TrainState_4_1_...67927
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((!(EX(!(((((((((((TrainState_2_1_32==1)||(TrainState_3_4_28==1))||((TrainState_2_3_13==...67240
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 15:23:03] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:23:03] [INFO ] Applying decomposition
[2026-05-23 15:23:03] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18191580743998272493.txt' '-o' '/tmp/graph18191580743998272493.bin' '-w' '/tmp/graph18191580743998272493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18191580743998272493.bin' '-l' '-1' '-v' '-w' '/tmp/graph18191580743998272493.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:23:03] [INFO ] Decomposing Gal with order
[2026-05-23 15:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:23:03] [INFO ] Removed a total of 119 redundant transitions.
[2026-05-23 15:23:03] [INFO ] Flatten gal took : 57 ms
[2026-05-23 15:23:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2026-05-23 15:23:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14261160619982328969.gal : 8 ms
[2026-05-23 15:23:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10563189483234734071.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14261160619982328969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10563189483234734071.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,4.00746e+10,0.306335,10740,317,75,7540,2975,1261,8910,240,2204,0


Converting to forward existential form...Done !
original formula: AG((E((AX(((((((((((i4.i1.i0.u14.TrainState_2_1_32==1)||(i0.i1.i6.u179.TrainState_3_4_28==1))||((i4.i1.i0.u65.TrainState_2_3_13==1)||(i0....102223
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((!(EX(!(((((((((((i4.i1.i0.u14.TrainState_2_1_32==1)||(i0.i1.i6.u179.TrainState_3_4_28=...102334
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,3.3931,90096,1,0,117851,146105,11386,357075,1386,230140,172471
FORMULA BART-PT-005-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 660 transition count 995
Reduce places removed 15 places and 0 transitions.
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Iterating post reduction 1 with 145 rules applied. Total rules applied 160 place count 645 transition count 865
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 295 place count 510 transition count 860
Iterating global reduction 3 with 5 rules applied. Total rules applied 300 place count 510 transition count 860
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 340 place count 490 transition count 840
Applied a total of 340 rules in 41 ms. Remains 490 /660 variables (removed 170) and now considering 840/1010 (removed 170) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4960811596638152736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6960309798963028038.kers'
[2026-05-23 15:23:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4960811596638152736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6960309798963028038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 840 rows 490 cols 1680 entries
Finished phase 1 with 485 SingleSign rule and 0 generalized
[2026-05-23 15:23:07] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6960309798963028038.kers
Total runtime 5 ms.
[2026-05-23 15:23:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 15:23:07] [INFO ] Invariant cache hit.
[2026-05-23 15:23:08] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2026-05-23 15:23:08] [INFO ] Redundant transitions in 12 ms returned []
Running 660 sub problems to find dead transitions.
[2026-05-23 15:23:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 5/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Starting structural reductions in SI_CTL mode, iteration 1 : 490/660 places, 840/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30677 ms. Remains : 490/660 places, 840/1010 transitions.
[2026-05-23 15:23:38] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:23:38] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:23:38] [INFO ] Input system was already deterministic with 840 transitions.
[2026-05-23 15:23:38] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:23:38] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:23:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11997246593193234630.gal : 3 ms
[2026-05-23 15:23:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1330097713544801314.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11997246593193234630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1330097713544801314.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.03921e+09,3.91926,98080,2,15310,5,624700,6,0,2803,391508,0


Converting to forward existential form...Done !
original formula: AF(EG((((((TrainState_1_1_1!=1)&&(TrainState_2_1_1!=1))&&((TrainState_3_1_1!=1)&&(TrainState_4_1_1!=1)))&&(TrainState_5_1_1!=1))||(((((((...8927
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((TrainState_1_1_1!=1)&&(TrainState_2_1_1!=1))&&((TrainState_3_1_1!=1)&&(TrainState_4_1_1!=1)...8972
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 15:24:08] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:24:08] [INFO ] Applying decomposition
[2026-05-23 15:24:08] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1108285479170124445.txt' '-o' '/tmp/graph1108285479170124445.bin' '-w' '/tmp/graph1108285479170124445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1108285479170124445.bin' '-l' '-1' '-v' '-w' '/tmp/graph1108285479170124445.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:24:08] [INFO ] Decomposing Gal with order
[2026-05-23 15:24:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:24:08] [INFO ] Removed a total of 90 redundant transitions.
[2026-05-23 15:24:08] [INFO ] Flatten gal took : 30 ms
[2026-05-23 15:24:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-23 15:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11652257862278751029.gal : 6 ms
[2026-05-23 15:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6058129550343356019.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11652257862278751029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6058129550343356019.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.03921e+09,0.193404,8676,277,89,2407,3028,728,1771,284,2628,0


Converting to forward existential form...Done !
original formula: AF(EG((((((i1.u3.TrainState_1_1_1!=1)&&(i2.u0.TrainState_2_1_1!=1))&&((i4.u1.TrainState_3_1_1!=1)&&(i0.u2.TrainState_4_1_1!=1)))&&(i3.u4....11338
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((i1.u3.TrainState_1_1_1!=1)&&(i2.u0.TrainState_2_1_1!=1))&&((i4.u1.TrainState_3_1_1!=1)&&(i0...11383
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,15.51,547696,1,0,990695,443218,5058,3.29406e+06,1588,1.59748e+06,271993
FORMULA BART-PT-005-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 64 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14481599439931827669.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15455991299524005103.kers'
[2026-05-23 15:24:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14481599439931827669.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15455991299524005103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 595 rows 245 cols 1190 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 15:24:24] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15455991299524005103.kers
Total runtime 3 ms.
[2026-05-23 15:24:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 15:24:24] [INFO ] Invariant cache hit.
[2026-05-23 15:24:24] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2026-05-23 15:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 245/660 places, 595/1010 transitions.
[2026-05-23 15:25:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:25:24] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:25:24] [INFO ] Input system was already deterministic with 595 transitions.
[2026-05-23 15:25:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:25:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:25:24] [INFO ] Time to serialize gal into /tmp/CTLFireability18309037457635407295.gal : 2 ms
[2026-05-23 15:25:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2837336981458077669.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18309037457635407295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2837336981458077669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.82475e+08,0.825731,26464,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(AX(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(TrainState_5_1_1==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(!(EX(!(((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||...220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,7.97521,193596,1,0,9,1.43299e+06,15,1,6317,247041,7
FORMULA BART-PT-005-CTLFireability-2024-07 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 : 660/660 places, 1010/1010 transitions.
Discarding 157 places :
Symmetric choice reduction at 0 with 157 rule applications. Total rules 157 place count 503 transition count 853
Iterating global reduction 0 with 157 rules applied. Total rules applied 314 place count 503 transition count 853
Discarding 132 places :
Symmetric choice reduction at 0 with 132 rule applications. Total rules 446 place count 371 transition count 721
Iterating global reduction 0 with 132 rules applied. Total rules applied 578 place count 371 transition count 721
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 598 place count 351 transition count 701
Iterating global reduction 0 with 20 rules applied. Total rules applied 618 place count 351 transition count 701
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 633 place count 336 transition count 686
Iterating global reduction 0 with 15 rules applied. Total rules applied 648 place count 336 transition count 686
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 663 place count 321 transition count 671
Iterating global reduction 0 with 15 rules applied. Total rules applied 678 place count 321 transition count 671
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 693 place count 306 transition count 656
Iterating global reduction 0 with 15 rules applied. Total rules applied 708 place count 306 transition count 656
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 723 place count 291 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 738 place count 291 transition count 641
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 753 place count 276 transition count 626
Iterating global reduction 0 with 15 rules applied. Total rules applied 768 place count 276 transition count 626
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 778 place count 266 transition count 616
Iterating global reduction 0 with 10 rules applied. Total rules applied 788 place count 266 transition count 616
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 798 place count 256 transition count 606
Iterating global reduction 0 with 10 rules applied. Total rules applied 808 place count 256 transition count 606
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 813 place count 251 transition count 601
Iterating global reduction 0 with 5 rules applied. Total rules applied 818 place count 251 transition count 601
Applied a total of 818 rules in 66 ms. Remains 251 /660 variables (removed 409) and now considering 601/1010 (removed 409) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5106165114885393067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3312042511973913885.kers'
[2026-05-23 15:25:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5106165114885393067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3312042511973913885.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 251 cols 1202 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-23 15:25:32] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3312042511973913885.kers
Total runtime 3 ms.
[2026-05-23 15:25:32] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 15:25:32] [INFO ] Invariant cache hit.
[2026-05-23 15:25:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-05-23 15:25:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 5/251 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 601/852 variables, 251/256 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/852 variables, and 256 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 5/251 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 601/852 variables, 251/256 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 421/677 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/852 variables, and 677 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 251/660 places, 601/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 251/660 places, 601/1010 transitions.
[2026-05-23 15:26:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:26:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:26:33] [INFO ] Input system was already deterministic with 601 transitions.
[2026-05-23 15:26:33] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:26:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:26:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7288753599275777144.gal : 2 ms
[2026-05-23 15:26:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11560504793977010212.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7288753599275777144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11560504793977010212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.18373e+08,0.882181,28056,2,7766,5,170903,6,0,1608,68291,0


Converting to forward existential form...Done !
original formula: (AG(AX(((AG((TrainState_4_3_27==0)) + (TrainState_5_1_21==0)) + (TrainState_4_2_30==0)))) + EF(AX((((AF((TrainState_1_2_13==1)) + AG((Tra...241
=> equivalent forward existential formula: [(FwdU(((EY(FwdU((Init * !(E(TRUE U !(EX(!((((!(EG(!((TrainState_1_2_13==1)))) + !(E(TRUE U !((TrainState_4_0_0=...353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,7.75096,157380,1,0,14,943138,23,7,6697,185632,12
FORMULA BART-PT-005-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 504 transition count 854
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 504 transition count 854
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 440 place count 376 transition count 726
Iterating global reduction 0 with 128 rules applied. Total rules applied 568 place count 376 transition count 726
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 585 place count 359 transition count 709
Iterating global reduction 0 with 17 rules applied. Total rules applied 602 place count 359 transition count 709
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 614 place count 347 transition count 697
Iterating global reduction 0 with 12 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 638 place count 335 transition count 685
Iterating global reduction 0 with 12 rules applied. Total rules applied 650 place count 335 transition count 685
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 662 place count 323 transition count 673
Iterating global reduction 0 with 12 rules applied. Total rules applied 674 place count 323 transition count 673
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 686 place count 311 transition count 661
Iterating global reduction 0 with 12 rules applied. Total rules applied 698 place count 311 transition count 661
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 710 place count 299 transition count 649
Iterating global reduction 0 with 12 rules applied. Total rules applied 722 place count 299 transition count 649
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 731 place count 290 transition count 640
Iterating global reduction 0 with 9 rules applied. Total rules applied 740 place count 290 transition count 640
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 748 place count 282 transition count 632
Iterating global reduction 0 with 8 rules applied. Total rules applied 756 place count 282 transition count 632
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 760 place count 278 transition count 628
Iterating global reduction 0 with 4 rules applied. Total rules applied 764 place count 278 transition count 628
Applied a total of 764 rules in 56 ms. Remains 278 /660 variables (removed 382) and now considering 628/1010 (removed 382) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8300968169791879698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1132856441896181373.kers'
[2026-05-23 15:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8300968169791879698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1132856441896181373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 628 rows 278 cols 1256 entries
Finished phase 1 with 273 SingleSign rule and 0 generalized
[2026-05-23 15:26:41] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1132856441896181373.kers
Total runtime 8 ms.
[2026-05-23 15:26:41] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 15:26:41] [INFO ] Invariant cache hit.
[2026-05-23 15:26:41] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-05-23 15:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 5/278 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 628/906 variables, 278/283 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/906 variables, and 283 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 5/278 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 628/906 variables, 278/283 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 448/731 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/906 variables, and 731 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 278/660 places, 628/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 278/660 places, 628/1010 transitions.
[2026-05-23 15:27:41] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:27:41] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:27:41] [INFO ] Input system was already deterministic with 628 transitions.
[2026-05-23 15:27:41] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:27:41] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:27:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9328123735717783065.gal : 2 ms
[2026-05-23 15:27:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6748234239318730184.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9328123735717783065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6748234239318730184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,5.22238e+08,0.225381,6920,2,552,5,4737,6,0,1743,2859,0


Converting to forward existential form...Done !
original formula: E(AF((!(A((TrainState_2_1_4==1) U (TrainState_2_4_11==1))) * EG(((TrainState_3_1_14==1)||(TrainState_3_2_4==1))))) U (A(EF(EG((TrainState...337
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(EG(!((!(!((E(!((TrainState_2_4_11==1)) U (!((TrainState_2_1_4==1)) * !((TrainState_2_4_11==1...548
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.664278,16576,1,0,6,83952,11,0,6458,6520,4
FORMULA BART-PT-005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1000 edges and 660 vertex of which 632 / 660 are part of one of the 5 SCC in 4 ms
Free SCC test removed 627 places
Ensure Unique test removed 965 transitions
Reduce isomorphic transitions removed 965 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 31 transition count 28
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 19 rules applied. Total rules applied 37 place count 15 transition count 25
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 40 place count 14 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 43 place count 13 transition count 21
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 50 place count 11 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 53 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 55 place count 7 transition count 13
Iterating global reduction 7 with 2 rules applied. Total rules applied 57 place count 7 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 59 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 62 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 62 place count 7 transition count 7
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 64 place count 6 transition count 7
Applied a total of 64 rules in 20 ms. Remains 6 /660 variables (removed 654) and now considering 7/1010 (removed 1003) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18226590115322883996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1373606323638806802.kers'
[2026-05-23 15:27:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18226590115322883996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1373606323638806802.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-23 15:27:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1373606323638806802.kers
Total runtime 0 ms.
[2026-05-23 15:27:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 15:27:42] [INFO ] Invariant cache hit.
[2026-05-23 15:27:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-23 15:27:42] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 15:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/660 places, 7/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 6/660 places, 7/1010 transitions.
[2026-05-23 15:27:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:27:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:27:42] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-23 15:27:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:27:42] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3003149810530275366.gal : 0 ms
[2026-05-23 15:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15367802483227534363.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3003149810530275366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15367802483227534363.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,8,0.002698,3756,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: A(AG(!(EF(((TrainState_2_2_15==1)||(TrainState_4_3_8==1))))) U (TrainState_1_1_11==1))
=> equivalent forward existential formula: [((Init * !(EG(!((TrainState_1_1_11==1))))) * !(E(!((TrainState_1_1_11==1)) U (!(!(E(TRUE U !(!(E(TRUE U ((Train...243
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,0,0.006038,4316,1,0,8,95,23,4,141,86,14
FORMULA BART-PT-005-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 502 transition count 852
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 502 transition count 852
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 449 place count 369 transition count 719
Iterating global reduction 0 with 133 rules applied. Total rules applied 582 place count 369 transition count 719
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 601 place count 350 transition count 700
Iterating global reduction 0 with 19 rules applied. Total rules applied 620 place count 350 transition count 700
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 635 place count 335 transition count 685
Iterating global reduction 0 with 15 rules applied. Total rules applied 650 place count 335 transition count 685
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 665 place count 320 transition count 670
Iterating global reduction 0 with 15 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 695 place count 305 transition count 655
Iterating global reduction 0 with 15 rules applied. Total rules applied 710 place count 305 transition count 655
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 724 place count 291 transition count 641
Iterating global reduction 0 with 14 rules applied. Total rules applied 738 place count 291 transition count 641
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 752 place count 277 transition count 627
Iterating global reduction 0 with 14 rules applied. Total rules applied 766 place count 277 transition count 627
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 775 place count 268 transition count 618
Iterating global reduction 0 with 9 rules applied. Total rules applied 784 place count 268 transition count 618
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 793 place count 259 transition count 609
Iterating global reduction 0 with 9 rules applied. Total rules applied 802 place count 259 transition count 609
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 806 place count 255 transition count 605
Iterating global reduction 0 with 4 rules applied. Total rules applied 810 place count 255 transition count 605
Applied a total of 810 rules in 71 ms. Remains 255 /660 variables (removed 405) and now considering 605/1010 (removed 405) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13529106935727130994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-140744505639603585.kers'
[2026-05-23 15:27:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13529106935727130994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-140744505639603585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 255 cols 1210 entries
Finished phase 1 with 250 SingleSign rule and 0 generalized
[2026-05-23 15:27:42] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-140744505639603585.kers
Total runtime 3 ms.
[2026-05-23 15:27:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 15:27:42] [INFO ] Invariant cache hit.
[2026-05-23 15:27:43] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2026-05-23 15:27:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 5/255 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 605/860 variables, 255/260 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/860 variables, and 260 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 5/255 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 605/860 variables, 255/260 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 425/685 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/860 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 860/860 variables, and 685 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 255/660 places, 605/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 255/660 places, 605/1010 transitions.
[2026-05-23 15:28:43] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:28:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:28:43] [INFO ] Input system was already deterministic with 605 transitions.
[2026-05-23 15:28:43] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:28:43] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:28:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8276546568195241977.gal : 2 ms
[2026-05-23 15:28:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5335161268537780041.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8276546568195241977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5335161268537780041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.42006e+08,0.916507,28384,2,7902,5,174747,6,0,1628,71306,0


Converting to forward existential form...Done !
original formula: EF(AG(((AX((TrainState_5_0_0==1)) + (TrainState_1_4_12==0)) * (EX((TrainState_2_3_31==1)) + (TrainState_1_0_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!((TrainState_5_0_0==1)))) + (TrainState_1_4_12==0)) * (EX((TrainState_2...205
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,6.87556,155488,1,0,13,979796,18,3,6516,121229,10
FORMULA BART-PT-005-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1007 edges and 660 vertex of which 656 / 660 are part of one of the 5 SCC in 2 ms
Free SCC test removed 651 places
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Reduce places removed 4 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 0 with 4 rules applied. Total rules applied 5 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 4 transition count 7
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 3 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 3 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 2 transition count 3
Applied a total of 12 rules in 8 ms. Remains 2 /660 variables (removed 658) and now considering 3/1010 (removed 1007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7033917207795296837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-430032626652433580.kers'
[2026-05-23 15:28:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7033917207795296837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-430032626652433580.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:28:50] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-430032626652433580.kers
Total runtime 0 ms.
[2026-05-23 15:28:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 15:28:50] [INFO ] Invariant cache hit.
[2026-05-23 15:28:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-23 15:28:50] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:28:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/660 places, 3/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 2/660 places, 3/1010 transitions.
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:28:50] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9381507607550056850.gal : 1 ms
[2026-05-23 15:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8420003244439510470.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9381507607550056850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8420003244439510470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2,0.002596,3728,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EG(AF((TrainState_4_3_11==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((TrainState_4_3_11==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003558,4004,1,0,6,19,22,2,47,13,10
FORMULA BART-PT-005-CTLFireability-2024-12 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 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 955 edges and 660 vertex of which 503 / 660 are part of one of the 4 SCC in 1 ms
Free SCC test removed 499 places
Ensure Unique test removed 767 transitions
Reduce isomorphic transitions removed 767 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 159 transition count 167
Reduce places removed 75 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 84 transition count 164
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 160 place count 81 transition count 162
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 160 place count 81 transition count 157
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 170 place count 76 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 178 place count 68 transition count 149
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 68 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 189 place count 68 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 64 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 64 transition count 142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 200 place count 61 transition count 139
Iterating global reduction 4 with 3 rules applied. Total rules applied 203 place count 61 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 206 place count 58 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 58 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 56 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 56 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 215 place count 54 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 54 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 53 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 53 transition count 131
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 231 place count 47 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 47 transition count 123
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 5 with 2 rules applied. Total rules applied 235 place count 46 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 237 place count 46 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 45 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 241 place count 45 transition count 117
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 7 with 2 rules applied. Total rules applied 243 place count 44 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 245 place count 44 transition count 114
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 247 place count 43 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 249 place count 43 transition count 111
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 9 with 2 rules applied. Total rules applied 251 place count 42 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 253 place count 42 transition count 108
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 10 with 2 rules applied. Total rules applied 255 place count 41 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 257 place count 41 transition count 105
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 11 with 2 rules applied. Total rules applied 259 place count 40 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 261 place count 40 transition count 102
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 12 with 2 rules applied. Total rules applied 263 place count 39 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 265 place count 39 transition count 99
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 13 with 2 rules applied. Total rules applied 267 place count 38 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 269 place count 38 transition count 96
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 14 with 2 rules applied. Total rules applied 271 place count 37 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 273 place count 37 transition count 93
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 15 with 2 rules applied. Total rules applied 275 place count 36 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 277 place count 36 transition count 90
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 16 with 2 rules applied. Total rules applied 279 place count 35 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 281 place count 35 transition count 87
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 17 with 2 rules applied. Total rules applied 283 place count 34 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 285 place count 34 transition count 84
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 18 with 2 rules applied. Total rules applied 287 place count 33 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 289 place count 33 transition count 81
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 19 with 2 rules applied. Total rules applied 291 place count 32 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 293 place count 32 transition count 78
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 20 with 2 rules applied. Total rules applied 295 place count 31 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 297 place count 31 transition count 75
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 21 with 2 rules applied. Total rules applied 299 place count 30 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 301 place count 30 transition count 72
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 22 with 2 rules applied. Total rules applied 303 place count 29 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 305 place count 29 transition count 69
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 23 with 2 rules applied. Total rules applied 307 place count 28 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 309 place count 28 transition count 66
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 24 with 2 rules applied. Total rules applied 311 place count 27 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 313 place count 27 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 315 place count 26 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 317 place count 26 transition count 60
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 26 with 2 rules applied. Total rules applied 319 place count 25 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 321 place count 25 transition count 57
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 27 with 2 rules applied. Total rules applied 323 place count 24 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 325 place count 24 transition count 54
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 28 with 2 rules applied. Total rules applied 327 place count 23 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 329 place count 23 transition count 51
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 29 with 2 rules applied. Total rules applied 331 place count 22 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 333 place count 22 transition count 48
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 30 with 2 rules applied. Total rules applied 335 place count 21 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 337 place count 21 transition count 45
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 31 with 2 rules applied. Total rules applied 339 place count 20 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 341 place count 20 transition count 42
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 32 with 2 rules applied. Total rules applied 343 place count 19 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 345 place count 19 transition count 39
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 33 with 2 rules applied. Total rules applied 347 place count 18 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 349 place count 18 transition count 36
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 34 with 2 rules applied. Total rules applied 351 place count 17 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 353 place count 17 transition count 33
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 35 with 2 rules applied. Total rules applied 355 place count 16 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 357 place count 16 transition count 30
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 36 with 2 rules applied. Total rules applied 359 place count 15 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 361 place count 15 transition count 27
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 37 with 2 rules applied. Total rules applied 363 place count 14 transition count 26
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 37 with 3 rules applied. Total rules applied 366 place count 14 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 368 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 39 with 4 rules applied. Total rules applied 372 place count 13 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 39 with 1 rules applied. Total rules applied 373 place count 13 transition count 18
Applied a total of 373 rules in 78 ms. Remains 13 /660 variables (removed 647) and now considering 18/1010 (removed 992) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7392468988844286516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8758636450303512315.kers'
[2026-05-23 15:28:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7392468988844286516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8758636450303512315.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 12 cols 32 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-23 15:28:50] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8758636450303512315.kers
Total runtime 1 ms.
[2026-05-23 15:28:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-23 15:28:50] [INFO ] Invariant cache hit.
[2026-05-23 15:28:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-23 15:28:50] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-23 15:28:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 17/30 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 16 constraints, problems are : Problem set: 0 solved, 10 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 17/30 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/660 places, 18/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 424 ms. Remains : 13/660 places, 18/1010 transitions.
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:28:50] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:28:50] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6718825531451112350.gal : 0 ms
[2026-05-23 15:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12814565798490240985.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6718825531451112350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12814565798490240985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,60,0.003835,3836,2,35,5,150,5,0,71,98,0


Converting to forward existential form...Done !
original formula: (A((TrainState_2_4_29==1) U EF((TrainState_3_0_0==1))) * EG((AF((TrainState_2_2_11==1)) + (A(!(A((TrainState_4_1_33==1) U (TrainState_4_4...223
=> equivalent forward existential formula: [FwdG((Init * !((E(!(E(TRUE U (TrainState_3_0_0==1))) U (!((TrainState_2_4_29==1)) * !(E(TRUE U (TrainState_3_0_...541
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.010245,4292,1,0,11,574,41,5,300,333,13
FORMULA BART-PT-005-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 641 place count 332 transition count 682
Iterating global reduction 0 with 15 rules applied. Total rules applied 656 place count 332 transition count 682
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 671 place count 317 transition count 667
Iterating global reduction 0 with 15 rules applied. Total rules applied 686 place count 317 transition count 667
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 701 place count 302 transition count 652
Iterating global reduction 0 with 15 rules applied. Total rules applied 716 place count 302 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 731 place count 287 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 746 place count 287 transition count 637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 761 place count 272 transition count 622
Iterating global reduction 0 with 15 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 786 place count 262 transition count 612
Iterating global reduction 0 with 10 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 806 place count 252 transition count 602
Iterating global reduction 0 with 10 rules applied. Total rules applied 816 place count 252 transition count 602
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 821 place count 247 transition count 597
Iterating global reduction 0 with 5 rules applied. Total rules applied 826 place count 247 transition count 597
Applied a total of 826 rules in 60 ms. Remains 247 /660 variables (removed 413) and now considering 597/1010 (removed 413) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16151075013119049833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7768871633678232782.kers'
[2026-05-23 15:28:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16151075013119049833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7768871633678232782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 597 rows 247 cols 1194 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-23 15:28:50] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7768871633678232782.kers
Total runtime 3 ms.
[2026-05-23 15:28:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 15:28:50] [INFO ] Invariant cache hit.
[2026-05-23 15:28:51] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2026-05-23 15:28:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/844 variables, and 252 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 417/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/844 variables, and 669 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 247/660 places, 597/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 247/660 places, 597/1010 transitions.
[2026-05-23 15:29:51] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:29:51] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:29:51] [INFO ] Input system was already deterministic with 597 transitions.
[2026-05-23 15:29:51] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:29:51] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:29:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6332890396727762888.gal : 3 ms
[2026-05-23 15:29:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4972013903068254156.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6332890396727762888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4972013903068254156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.94005e+08,0.191967,6720,2,490,5,3900,6,0,1588,2161,0


Converting to forward existential form...Done !
original formula: AX(EX((EG(((TrainState_4_1_6==0)&&(TrainState_1_1_37==0))) * (!(E((TrainState_3_0_0==1) U (TrainState_5_1_11==1))) + (TrainState_4_3_13==...161
=> equivalent forward existential formula: [(EY(Init) * !(EX((EG(((TrainState_4_1_6==0)&&(TrainState_1_1_37==0))) * (!(E((TrainState_3_0_0==1) U (TrainStat...208
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 560/0/37
(forward)formula 0,1,0.79344,17028,1,0,16,77481,27,5,6632,14036,13
FORMULA BART-PT-005-CTLFireability-2024-14 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 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1008 edges and 660 vertex of which 658 / 660 are part of one of the 5 SCC in 0 ms
Free SCC test removed 653 places
Ensure Unique test removed 1002 transitions
Reduce isomorphic transitions removed 1002 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 2 transition count 3
Applied a total of 7 rules in 6 ms. Remains 2 /660 variables (removed 658) and now considering 3/1010 (removed 1007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5337934777047407464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9281295414773514942.kers'
[2026-05-23 15:29:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5337934777047407464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9281295414773514942.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:29:52] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9281295414773514942.kers
Total runtime 0 ms.
[2026-05-23 15:29:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 15:29:52] [INFO ] Invariant cache hit.
[2026-05-23 15:29:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-23 15:29:52] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/660 places, 3/1010 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 2/660 places, 3/1010 transitions.
[2026-05-23 15:29:52] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:29:52] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:29:52] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:29:52] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:29:52] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:29:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8142371914030107898.gal : 0 ms
[2026-05-23 15:29:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8584185761784237053.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8142371914030107898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8584185761784237053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2,0.001909,3724,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EG((TrainState_3_3_26==0))
=> equivalent forward existential formula: [FwdG(Init,(TrainState_3_3_26==0))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.00253,3992,1,0,5,18,18,0,49,11,8
FORMULA BART-PT-005-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 15:29:52] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:29:52] [INFO ] Flatten gal took : 11 ms
Total runtime 841314 ms.

BK_STOP 1779550192359

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="BART-PT-005"
export BK_EXAMINATION="CTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is BART-PT-005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946788000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;