Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068100754.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is EisenbergMcGuire-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068100754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 121K May 29 14:32 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 EisenbergMcGuire-PT-03-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2023-15
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748834531256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 03:22:12] [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]
[2025-06-02 03:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:22:12] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-02 03:22:12] [INFO ] Transformed 117 places.
[2025-06-02 03:22:12] [INFO ] Transformed 216 transitions.
[2025-06-02 03:22:12] [INFO ] Found NUPN structural information;
[2025-06-02 03:22:12] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 72 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2025-06-02 03:22:12] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2025-06-02 03:22:12] [INFO ] Computed 10 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:22:12] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-02 03:22:12] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-02 03:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:22:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 03:22:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2025-06-02 03:22:13] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-02 03:22:13] [INFO ] Invariant cache hit.
[2025-06-02 03:22:13] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:14] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:15] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:16] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:16] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:17] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:18] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:19] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 153/270 variables, 117/268 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 56/324 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 324 constraints, problems are : Problem set: 0 solved, 213 unsolved in 18872 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 24/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 153/270 variables, 117/268 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 56/324 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 213/537 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:36] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:36] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:38] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 3/540 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:22:51] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/270 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 541 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30022 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48979ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 48991ms
Finished structural reductions in LTL mode , in 1 iterations and 49488 ms. Remains : 117/117 places, 216/216 transitions.
Support contains 72 out of 117 places after structural reductions.
[2025-06-02 03:23:02] [INFO ] Flatten gal took : 33 ms
[2025-06-02 03:23:02] [INFO ] Flatten gal took : 15 ms
[2025-06-02 03:23:02] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 71 out of 117 places (down from 72) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 73 to 70
RANDOM walk for 40000 steps (8 resets) in 1852 ms. (21 steps per ms) remains 41/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 32/32 properties
[2025-06-02 03:23:03] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
[2025-06-02 03:23:03] [INFO ] Invariant cache hit.
[2025-06-02 03:23:03] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 1/48 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 3 (OVERLAPS) 70/117 variables, 6/54 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 70/124 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 4 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:03] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:03] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:03] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 15/142 constraints. Problems are: Problem set: 4 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:04] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:05] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 4/146 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/146 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 153/270 variables, 117/263 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 56/319 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 319 constraints, problems are : Problem set: 4 solved, 28 unsolved in 3942 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 1/43 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 75/117 variables, 6/49 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 75/124 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 3/127 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 19/146 constraints. Problems are: Problem set: 4 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:07] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:07] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/148 constraints. Problems are: Problem set: 4 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:07] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/149 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 153/270 variables, 117/266 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 56/322 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 28/350 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/350 constraints. Problems are: Problem set: 4 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/270 variables, 0/350 constraints. Problems are: Problem set: 4 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 350 constraints, problems are : Problem set: 4 solved, 28 unsolved in 3752 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 28/32 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7707ms problems are : Problem set: 4 solved, 28 unsolved
Parikh walk visited 4 properties in 1749 ms.
Support contains 37 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 216/216 transitions.
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 0 place count 117 transition count 193
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 94 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 93 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 93 transition count 190
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 0 with 10 rules applied. Total rules applied 58 place count 88 transition count 185
Applied a total of 58 rules in 39 ms. Remains 88 /117 variables (removed 29) and now considering 185/216 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 88/117 places, 185/216 transitions.
RANDOM walk for 40000 steps (8 resets) in 470 ms. (84 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
Probably explored full state space saw : 12056 states, properties seen :23
Probabilistic random walk after 48224 steps, saw 12056 distinct states, run finished after 286 ms. (steps per millisecond=168 ) properties seen :23
Explored full state space saw : 12056 states, properties seen :0
Exhaustive walk after 48224 steps, saw 12056 distinct states, run finished after 67 ms. (steps per millisecond=719 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:23:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 03:23:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 03:23:13] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 67 out of 117 places (down from 68) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 6 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2025-06-02 03:23:13] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2025-06-02 03:23:13] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:23:13] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 03:23:13] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:23:13] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 03:23:13] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:23:13] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:23:13] [INFO ] Invariant cache hit.
[2025-06-02 03:23:13] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:14] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:15] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:16] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:16] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:17] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 191 constraints, problems are : Problem set: 0 solved, 198 unsolved in 11212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 198/389 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:27] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 393 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12444 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23689ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 23690ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23936 ms. Remains : 112/117 places, 201/216 transitions.
[2025-06-02 03:23:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:23:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:23:37] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-02 03:23:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:23:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6970388694365423872.gal : 5 ms
[2025-06-02 03:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9726860666443566781.ctl : 3 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6970388694365423872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9726860666443566781.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,25802,1.49877,53868,2,12239,5,140208,6,0,652,161862,0


Converting to forward existential form...Done !
original formula: AG(AF(((((turn_2!=1)||(flag_2_active!=1))||((p25_2_3!=1)||(p12_1_0!=1))) + EX(((turn_1==1)&&(p10_0_2==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((turn_2!=1)||(flag_2_active!=1))||((p25_2_3!=1)||(p12_1_0!=1))) + EX(((turn_1==1)&&(p...179
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43, t44, t45,...691
(forward)formula 0,0,5.7722,166340,1,0,495,643208,425,210,4195,411215,416
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 11 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2025-06-02 03:23:43] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:23:43] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:23:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 03:23:43] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:23:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:23:43] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:23:43] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:23:43] [INFO ] Invariant cache hit.
[2025-06-02 03:23:43] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:44] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:46] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:46] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:46] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:49] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:49] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:50] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:50] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:50] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:51] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:23:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:00] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:00] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26733ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26735ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26981 ms. Remains : 111/117 places, 198/216 transitions.
[2025-06-02 03:24:10] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:24:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:24:10] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:24:10] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:24:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:24:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16832302655273539714.gal : 3 ms
[2025-06-02 03:24:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1042882455586563762.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16832302655273539714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1042882455586563762.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,24617,1.32274,49268,2,11856,5,129101,6,0,645,141739,0


Converting to forward existential form...Done !
original formula: EF(EX(AF(AG((((turn_2==1)&&(flag_2_active==1))&&(p25_0_1==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(!(E(TRUE U !((((turn_2==1)&&(flag_2_active==1))&&(p25_0_1==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...683
(forward)formula 0,0,5.82857,166344,1,0,483,683556,421,204,4285,487296,414
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 114 transition count 184
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 85 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 79 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 79 transition count 166
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 2 with 12 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 23 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
[2025-06-02 03:24:16] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2025-06-02 03:24:16] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:24:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 03:24:16] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:24:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:24:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:24:16] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:24:16] [INFO ] Redundant transitions in 6 ms returned []
Running 157 sub problems to find dead transitions.
[2025-06-02 03:24:16] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:24:16] [INFO ] Invariant cache hit.
[2025-06-02 03:24:16] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:17] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:20] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/170 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 142 constraints, problems are : Problem set: 0 solved, 157 unsolved in 6814 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:23] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:24] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:24] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 97/170 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 157/304 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 304 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7327 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14163ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 14164ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/117 places, 160/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14409 ms. Remains : 73/117 places, 160/216 transitions.
[2025-06-02 03:24:30] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:24:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:24:30] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-02 03:24:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:24:30] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:24:30] [INFO ] Time to serialize gal into /tmp/CTLFireability498908673995958222.gal : 2 ms
[2025-06-02 03:24:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10756541604218563715.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability498908673995958222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10756541604218563715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5929,0.70275,32028,2,7130,5,75227,6,0,455,76632,0


Converting to forward existential form...Done !
original formula: (EG((p19_1_1==0)) * EF(((flag_2_active==1)&&(p18_1_2==1))))
=> equivalent forward existential formula: [(FwdU((Init * EG((p19_1_1==0))),TRUE) * ((flag_2_active==1)&&(p18_1_2==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32,...638
(forward)formula 0,1,3.08119,96640,1,0,421,347112,344,166,3296,273993,334
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-02 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 : 117/117 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 204
Applied a total of 8 rules in 5 ms. Remains 113 /117 variables (removed 4) and now considering 204/216 (removed 12) transitions.
[2025-06-02 03:24:34] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2025-06-02 03:24:34] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:24:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 03:24:34] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:24:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:24:34] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 03:24:34] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:24:34] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:24:34] [INFO ] Invariant cache hit.
[2025-06-02 03:24:34] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:34] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:35] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:36] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:38] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 141/254 variables, 113/150 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 48/198 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 198 constraints, problems are : Problem set: 0 solved, 201 unsolved in 11949 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 141/254 variables, 113/150 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 48/198 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 201/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:48] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:48] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:50] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:54] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:24:55] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 405 constraints, problems are : Problem set: 0 solved, 201 unsolved in 20174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32148ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 32149ms
Starting structural reductions in LTL mode, iteration 1 : 113/117 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32418 ms. Remains : 113/117 places, 204/216 transitions.
[2025-06-02 03:25:06] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:25:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:25:06] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 03:25:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:25:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability18191169914844149093.gal : 2 ms
[2025-06-02 03:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16442917413615443022.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18191169914844149093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16442917413615443022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,27299,1.56881,57240,2,12591,5,149464,6,0,659,161703,0


Converting to forward existential form...Done !
original formula: ((AG(AF(((!(A(((turn_0==1)&&(p07_2==1)) U (((turn_2==1)&&(flag_2_waiting==1))&&(p25_0_1==1)))) + AX(((turn_1==0)||(p07_2==0)))) + (((flag...554
=> equivalent forward existential formula: ((([(EY((Init * !((!(E(TRUE U !(!(EG(!(((!(!((E(!((((turn_2==1)&&(flag_2_waiting==1))&&(p25_0_1==1))) U (!(((tur...2536
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...707
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,9.18161,246288,1,0,580,1.16316e+06,471,260,4563,668499,539
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 207
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 207
Applied a total of 6 rules in 5 ms. Remains 114 /117 variables (removed 3) and now considering 207/216 (removed 9) transitions.
[2025-06-02 03:25:15] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
// Phase 1: matrix 144 rows 114 cols
[2025-06-02 03:25:15] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:25:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 03:25:15] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
[2025-06-02 03:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:25:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 03:25:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 03:25:16] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
[2025-06-02 03:25:16] [INFO ] Invariant cache hit.
[2025-06-02 03:25:16] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:16] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:17] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:18] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:18] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:18] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:19] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:20] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 144/258 variables, 114/146 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 50/196 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:25] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/258 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 197 constraints, problems are : Problem set: 0 solved, 204 unsolved in 16089 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 144/258 variables, 114/147 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 204/401 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:34] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:34] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:35] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:35] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:36] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:36] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:42] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/258 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:43] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:25:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 413 constraints, problems are : Problem set: 0 solved, 204 unsolved in 22608 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38718ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 38718ms
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 207/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38924 ms. Remains : 114/117 places, 207/216 transitions.
[2025-06-02 03:25:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:25:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:25:54] [INFO ] Input system was already deterministic with 207 transitions.
[2025-06-02 03:25:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:25:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:25:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5733705746209799773.gal : 2 ms
[2025-06-02 03:25:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12472390758753922375.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5733705746209799773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12472390758753922375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,27710,1.74376,59184,2,12979,5,150843,6,0,666,176740,0


Converting to forward existential form...Done !
original formula: (EX(E((AF((p08_2_2!=1)) * (!(EG((p08_1_0==1))) + (((EG(((flag_1_active==1)&&(p39_1==1))) * (flag_2_idle==1)) * ((p04_2==1)&&(turn_1==1)))...538
=> equivalent forward existential formula: (([(EY(((FwdU(EY(Init),(!(EG(!((p08_2_2!=1)))) * (!(EG((p08_1_0==1))) + (((EG(((flag_1_active==1)&&(p39_1==1))) ...1236
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t28, t29, t32, t33, t34, t35, t42, t43, t44, t45, t46, t47, t48, t49,...702
Detected timeout of ITS tools.
[2025-06-02 03:26:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:26:24] [INFO ] Applying decomposition
[2025-06-02 03:26:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12119907421803702317.txt' '-o' '/tmp/graph12119907421803702317.bin' '-w' '/tmp/graph12119907421803702317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12119907421803702317.bin' '-l' '-1' '-v' '-w' '/tmp/graph12119907421803702317.weights' '-q' '0' '-e' '0.001'
[2025-06-02 03:26:24] [INFO ] Decomposing Gal with order
[2025-06-02 03:26:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 03:26:25] [INFO ] Removed a total of 225 redundant transitions.
[2025-06-02 03:26:25] [INFO ] Flatten gal took : 49 ms
[2025-06-02 03:26:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 10 ms.
[2025-06-02 03:26:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1180291202023812489.gal : 4 ms
[2025-06-02 03:26:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15364033373319025605.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1180291202023812489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15364033373319025605.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,27710,1.29189,45516,1529,415,64721,3223,670,167985,119,19367,0


Converting to forward existential form...Done !
original formula: (EX(E((AF((i3.u14.p08_2_2!=1)) * (!(EG((i2.u8.p08_1_0==1))) + (((EG(((i9.u0.flag_1_active==1)&&(i0.u2.p39_1==1))) * (i6.u24.flag_2_idle==...714
=> equivalent forward existential formula: (([(EY(((FwdU(EY(Init),(!(EG(!((i3.u14.p08_2_2!=1)))) * (!(EG((i2.u8.p08_1_0==1))) + (((EG(((i9.u0.flag_1_active...1586
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t28, t29, t32, t33, t34, t35, t42, t43, t44, t45, t46, t47, t48, t49,...655
Using saturation style SCC detection
Using saturation style SCC detection
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,5.19741,141772,1,0,225085,7554,3216,512572,483,38829,868089
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 204
Applied a total of 8 rules in 5 ms. Remains 113 /117 variables (removed 4) and now considering 204/216 (removed 12) transitions.
[2025-06-02 03:26:30] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2025-06-02 03:26:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 03:26:30] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:26:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 03:26:30] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:26:30] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:26:30] [INFO ] Invariant cache hit.
[2025-06-02 03:26:30] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:31] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:32] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:33] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 141/254 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 48/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:36] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:36] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 195 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13098 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 141/254 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 48/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 201/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:46] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:48] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:48] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:51] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:53] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:58] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:26:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 5 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/254 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 403 constraints, problems are : Problem set: 0 solved, 201 unsolved in 25622 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38746ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 38747ms
Starting structural reductions in LTL mode, iteration 1 : 113/117 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39053 ms. Remains : 113/117 places, 204/216 transitions.
[2025-06-02 03:27:09] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:09] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:09] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 03:27:09] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:27:09] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:27:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3458482235082073767.gal : 1 ms
[2025-06-02 03:27:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7707961681551736988.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3458482235082073767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7707961681551736988.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,26634,1.48482,53728,2,12612,5,143992,6,0,659,150794,0


Converting to forward existential form...Done !
original formula: E(AX((EX((((turn_2==1)&&(p37_2_2==1))||((flag_0_active==1)&&(p18_2_0==1)))) + E(((turn_1==1)&&(p27_0==1)) U EF(((flag_0_active==1)&&(p33_...319
=> equivalent forward existential formula: (([(FwdU(Init,!(EX(!((EX((((turn_2==1)&&(p37_2_2==1))||((flag_0_active==1)&&(p18_2_0==1)))) + E(((turn_1==1)&&(p...773
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t32, t33, t34, t35, t42, t43, t44, t45, t46, t47,...697
(forward)formula 0,1,20.6525,591736,1,0,636,3.44058e+06,447,304,4567,1.70043e+06,655
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 114 transition count 186
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 87 transition count 186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 81 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 81 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 75 transition count 162
Applied a total of 84 rules in 34 ms. Remains 75 /117 variables (removed 42) and now considering 162/216 (removed 54) transitions.
[2025-06-02 03:27:30] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 75 cols
[2025-06-02 03:27:30] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 03:27:30] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2025-06-02 03:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:27:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:27:30] [INFO ] Redundant transitions in 4 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-02 03:27:30] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2025-06-02 03:27:30] [INFO ] Invariant cache hit.
[2025-06-02 03:27:30] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:30] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:31] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:32] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:33] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 99/174 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:35] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 148 constraints, problems are : Problem set: 0 solved, 159 unsolved in 8080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:39] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 99/174 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 44/151 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 159/310 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:41] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/174 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 314 constraints, problems are : Problem set: 0 solved, 159 unsolved in 13766 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21874ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 21875ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/117 places, 162/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22110 ms. Remains : 75/117 places, 162/216 transitions.
[2025-06-02 03:27:52] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:27:52] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:27:52] [INFO ] Input system was already deterministic with 162 transitions.
[2025-06-02 03:27:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:27:52] [INFO ] Flatten gal took : 21 ms
[2025-06-02 03:27:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12824654257591756890.gal : 1 ms
[2025-06-02 03:27:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7269620362863847251.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12824654257591756890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7269620362863847251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,6821,0.96243,34096,2,8028,5,82823,6,0,465,76706,0


Converting to forward existential form...Done !
original formula: AG((EF(EG(((flag_2_waiting==1)&&(p18_0_2==1)))) + (AG(((EG(((flag_2_idle==1)&&(p09_0_2==1))) * (flag_2_active==1)) * (p09_0_2==1))) * (((...240
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U EG(((flag_2_waiting==1)&&(p18_0_2==1)))))),TRUE) * !(EG(((flag_2_idle==1...602
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t17, t18, t19, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34,...640
(forward)formula 0,1,5.44704,166124,1,0,493,820827,362,208,3339,426939,442
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 3 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2025-06-02 03:27:57] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:27:57] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 03:27:58] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:27:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:27:58] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:27:58] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:27:58] [INFO ] Invariant cache hit.
[2025-06-02 03:27:58] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:58] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:58] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:58] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:27:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:00] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:00] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:00] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:04] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:05] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:13] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:14] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:14] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12836 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25945ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 25946ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26209 ms. Remains : 111/117 places, 198/216 transitions.
[2025-06-02 03:28:24] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:28:24] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:28:24] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:28:24] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:24] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:28:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14863699121090832405.gal : 1 ms
[2025-06-02 03:28:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9521466933557298249.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14863699121090832405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9521466933557298249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,24617,1.2634,49104,2,11856,5,129101,6,0,645,141739,0


Converting to forward existential form...Done !
original formula: EX(((p19_2_0==1) + EF(((turn_2==1)&&(p37_2_1==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (p19_2_0==1))] != FALSE + [(FwdU(EY(Init),TRUE) * ((turn_2==1)&&(p37_2_1==1)))] != FALSE)
(forward)formula 0,1,1.95377,51024,1,0,10,130178,10,2,1319,141739,5
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 6 place count 114 transition count 185
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 62 place count 86 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 80 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 80 transition count 167
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 2 with 12 rules applied. Total rules applied 86 place count 74 transition count 161
Applied a total of 86 rules in 15 ms. Remains 74 /117 variables (removed 43) and now considering 161/216 (removed 55) transitions.
[2025-06-02 03:28:26] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2025-06-02 03:28:26] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 03:28:26] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2025-06-02 03:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:28:26] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:28:26] [INFO ] Redundant transitions in 3 ms returned []
Running 158 sub problems to find dead transitions.
[2025-06-02 03:28:26] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2025-06-02 03:28:26] [INFO ] Invariant cache hit.
[2025-06-02 03:28:26] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:26] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:27] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:28] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:28] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:28] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/100 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/144 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:30] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/172 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 0/172 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 146 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8589 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:35] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:35] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:35] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/106 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:39] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/172 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 309 constraints, problems are : Problem set: 0 solved, 158 unsolved in 11386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20039ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 20039ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/117 places, 161/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20336 ms. Remains : 74/117 places, 161/216 transitions.
[2025-06-02 03:28:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:46] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:28:46] [INFO ] Input system was already deterministic with 161 transitions.
[2025-06-02 03:28:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:28:46] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:28:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4606263158727722176.gal : 1 ms
[2025-06-02 03:28:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1761050071452592384.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4606263158727722176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1761050071452592384.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5935,0.596928,29124,2,6886,5,69234,6,0,460,69469,0


Converting to forward existential form...Done !
original formula: EF(!(E(!(A((p08_1_2==1) U EF((((turn_0==1)&&(flag_0_waiting==1))&&(p25_2_1==1))))) U ((flag_0_active==1)&&(p33_0_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!((E(!(E(TRUE U (((turn_0==1)&&(flag_0_waiting==1))&&(p25_2_1==1)))) U (!((p08_1_2==1)...347
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29,...638
(forward)formula 0,1,5.31091,168880,1,0,517,916034,353,228,3305,464099,489
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 213
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 114 transition count 183
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 84 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 78 transition count 165
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 78 transition count 165
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 2 with 10 rules applied. Total rules applied 88 place count 73 transition count 160
Applied a total of 88 rules in 28 ms. Remains 73 /117 variables (removed 44) and now considering 160/216 (removed 56) transitions.
[2025-06-02 03:28:51] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2025-06-02 03:28:51] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:52] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 03:28:52] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:28:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:28:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:28:52] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:28:52] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2025-06-02 03:28:52] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2025-06-02 03:28:52] [INFO ] Invariant cache hit.
[2025-06-02 03:28:52] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:54] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:54] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:55] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:55] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 97/170 variables, 73/106 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:28:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/170 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 152 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8712 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/108 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/309 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:03] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:08] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/170 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:09] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 314 constraints, problems are : Problem set: 0 solved, 157 unsolved in 15990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24730ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 24742ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/117 places, 160/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25132 ms. Remains : 73/117 places, 160/216 transitions.
[2025-06-02 03:29:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:29:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:29:17] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-02 03:29:17] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:29:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:29:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17257343002926268994.gal : 1 ms
[2025-06-02 03:29:17] [INFO ] Time to serialize properties into /tmp/CTLFireability197530507747440024.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17257343002926268994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability197530507747440024.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,5924,0.825802,33744,2,7190,5,77573,6,0,455,81004,0


Converting to forward existential form...Done !
original formula: A((p12_2_1==1) U EF((((turn_1==1)&&(flag_1_active==1))&&(p25_1_0==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (((turn_1==1)&&(flag_1_active==1))&&(p25_1_0==1))))))) * !(E(!(E(TRUE U (((turn_1==1)&...290
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28,...637
(forward)formula 0,1,5.47052,157476,1,0,473,784765,350,200,3237,428138,420
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-10 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 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 2 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2025-06-02 03:29:22] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:29:22] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:22] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 03:29:22] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:29:22] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:29:22] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:29:22] [INFO ] Invariant cache hit.
[2025-06-02 03:29:22] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:23] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:24] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:25] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:25] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:25] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:28] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:29] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:29] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:29] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:29] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:30] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13420 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:38] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:38] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:39] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:39] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26746ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26750ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26968 ms. Remains : 111/117 places, 198/216 transitions.
[2025-06-02 03:29:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:29:49] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:29:49] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:29:49] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:29:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:29:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15744516926840151115.gal : 1 ms
[2025-06-02 03:29:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14614229707598310553.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15744516926840151115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14614229707598310553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,24617,1.23244,48960,2,11856,5,129101,6,0,645,141739,0


Converting to forward existential form...Done !
original formula: E((!(EG((!((((turn_2==1)&&(flag_2_idle==1))&&(p25_0_3==1))) + AF(((flag_0_active==1)&&(p39_0==1)))))) + !(EX((E(((flag_1_active==1)&&(p09...450
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,(!(EG((!((((turn_2==1)&&(flag_2_idle==1))&&(p25_0_3==1))) + !(EG(!(((flag_0_active==1)&&(p39_...521
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t43,...683
(forward)formula 0,0,5.26475,163944,1,0,503,669254,428,213,4170,471109,435
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 204
Applied a total of 8 rules in 5 ms. Remains 113 /117 variables (removed 4) and now considering 204/216 (removed 12) transitions.
[2025-06-02 03:29:54] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2025-06-02 03:29:54] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 03:29:54] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:29:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-02 03:29:55] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:29:55] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2025-06-02 03:29:55] [INFO ] Invariant cache hit.
[2025-06-02 03:29:55] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:55] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:55] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:55] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:56] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:57] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:57] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:57] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:57] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:57] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:29:58] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 141/254 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 48/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 192 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:05] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:06] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 141/254 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 48/195 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 201/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:08] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:08] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:09] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:10] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 403 constraints, problems are : Problem set: 0 solved, 201 unsolved in 15942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26004ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 26008ms
Starting structural reductions in LTL mode, iteration 1 : 113/117 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26232 ms. Remains : 113/117 places, 204/216 transitions.
[2025-06-02 03:30:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:30:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:30:21] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 03:30:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:30:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:30:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5965491658086703426.gal : 1 ms
[2025-06-02 03:30:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3394021785205151060.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5965491658086703426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3394021785205151060.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,27409,1.73059,59532,2,12773,5,152105,6,0,659,170142,0


Converting to forward existential form...Done !
original formula: E((AX(EF(((((p19_2_0==1)&&(turn_0==1))&&((flag_0_waiting==1)&&(p25_1_2==1)))&&(!((turn_0==1)&&(p07_0==1)))))) * E(E(((((turn_1==1)&&(flag...582
=> equivalent forward existential formula: [FwdG(((FwdU(Init,(!(EX(!(E(TRUE U ((((p19_2_0==1)&&(turn_0==1))&&((flag_0_waiting==1)&&(p25_1_2==1)))&&(!((turn...671
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t42, t44,...707
Hit Full ! (commute/partial/dont) 202/0/2
(forward)formula 0,1,27.6307,708196,1,0,843,3.64362e+06,465,479,4602,2.48804e+06,922
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 6 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2025-06-02 03:30:49] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:30:49] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 03:30:49] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:30:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:30:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:30:49] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:30:49] [INFO ] Invariant cache hit.
[2025-06-02 03:30:49] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:49] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:49] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:51] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:52] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:52] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:55] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:55] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:55] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:30:56] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:05] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:05] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:06] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:06] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13075 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26537ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26537ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26796 ms. Remains : 111/117 places, 198/216 transitions.
[2025-06-02 03:31:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:31:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:15] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:31:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9391121887019717505.gal : 1 ms
[2025-06-02 03:31:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5203215985698848537.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9391121887019717505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5203215985698848537.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,24617,1.24408,49076,2,11856,5,129101,6,0,645,141739,0


Converting to forward existential form...Done !
original formula: EX((p08_1_2==0))
=> equivalent forward existential formula: [(EY(Init) * (p08_1_2==0))] != FALSE
(forward)formula 0,1,1.25032,49076,1,0,8,129101,8,1,932,141739,2
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 2 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2025-06-02 03:31:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2025-06-02 03:31:17] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 03:31:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-02 03:31:17] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:31:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2025-06-02 03:31:17] [INFO ] Invariant cache hit.
[2025-06-02 03:31:17] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:18] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:19] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:20] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:21] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 138/250 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 46/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 198/390 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:31] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:32] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:33] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 394 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26238ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 26248ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26468 ms. Remains : 112/117 places, 201/216 transitions.
[2025-06-02 03:31:43] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:31:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:31:43] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-02 03:31:43] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:43] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:31:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14800196494035203571.gal : 1 ms
[2025-06-02 03:31:43] [INFO ] Time to serialize properties into /tmp/CTLFireability409756989989670561.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14800196494035203571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability409756989989670561.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,25508,1.33006,51112,2,12042,5,135005,6,0,652,145970,0


Converting to forward existential form...Done !
original formula: AF(((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)) + (((AX(AF((((turn_1==1)&&(flag_1_active==1))&&(p25_0_2==1)))) * EG(((turn_1==0)||(...224
=> equivalent forward existential formula: [FwdG(Init,!(((((turn_2==1)&&(flag_2_active==1))&&(p25_0_3==1)) + (((!(EX(!(!(EG(!((((turn_1==1)&&(flag_1_active...281
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t24, t25, t26, t27, t28, t29, t32, t33, t34, t35, t42, t43, t44, t45,...691
(forward)formula 0,0,12.2713,367808,1,0,629,1.39023e+06,437,359,4192,1.50654e+06,577
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-14 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 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 2 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2025-06-02 03:31:56] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2025-06-02 03:31:56] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 03:31:56] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 03:31:56] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 03:31:56] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2025-06-02 03:31:56] [INFO ] Invariant cache hit.
[2025-06-02 03:31:56] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:56] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:58] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:31:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:02] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:02] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:02] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:02] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:03] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:03] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:12] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:13] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:32:13] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 393 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13084 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26487ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26487ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26719 ms. Remains : 111/117 places, 198/216 transitions.
[2025-06-02 03:32:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:32:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:32:22] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:32:22] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:32:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:32:22] [INFO ] Time to serialize gal into /tmp/CTLFireability67469319110056866.gal : 5 ms
[2025-06-02 03:32:22] [INFO ] Time to serialize properties into /tmp/CTLFireability265872318329654152.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability67469319110056866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability265872318329654152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...280
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,24617,1.25055,49136,2,11856,5,129101,6,0,645,141739,0


Converting to forward existential form...Done !
original formula: EX(EG(((((turn_2==0)||(flag_2_idle==0))||(p25_1_3==0))&&((((p08_1_1==1)||(turn_1==0))||((flag_1_waiting==0)||(p25_0_1==0)))||(((flag_2_ac...307
=> equivalent forward existential formula: [FwdG(EY(Init),((((turn_2==0)||(flag_2_idle==0))||(p25_1_3==0))&&((((p08_1_1==1)||(turn_1==0))||((flag_1_waiting...350
Hit Full ! (commute/partial/dont) 65/22/133
(forward)formula 0,1,7.14592,217548,1,0,9,880228,19,2,3391,632446,9
FORMULA EisenbergMcGuire-PT-03-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 03:32:30] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:32:30] [INFO ] Flatten gal took : 4 ms
Total runtime 617744 ms.

BK_STOP 1748835150271

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EisenbergMcGuire-PT-03"
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-5832"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-03, 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 r072-tall-174860068100754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 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 ;