Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000106.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 MedleyA-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 48K 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 MedleyA-PT-02-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-02-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748841559239

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 05:19:21] [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 05:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:21] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-06-02 05:19:21] [INFO ] Transformed 69 places.
[2025-06-02 05:19:21] [INFO ] Transformed 168 transitions.
[2025-06-02 05:19:21] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:22] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 55 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 157
Applied a total of 8 rules in 25 ms. Remains 65 /69 variables (removed 4) and now considering 157/162 (removed 5) transitions.
// Phase 1: matrix 157 rows 65 cols
[2025-06-02 05:19:22] [INFO ] Computed 9 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:19:22] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-02 05:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:19:22] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 05:19:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-02 05:19:22] [INFO ] Invariant cache hit.
[2025-06-02 05:19:22] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 16 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 05:19:25] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:25] [INFO ] Deduced a trap composed of 19 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 05:19:26] [INFO ] Deduced a trap composed of 15 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 05:19:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:26] [INFO ] Deduced a trap composed of 26 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 05:19:26] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/222 variables, 65/88 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 60/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 14 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 05:19:31] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 153 constraints, problems are : Problem set: 0 solved, 156 unsolved in 14268 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/222 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 60/153 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 156/309 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 15 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 05:19:41] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 312 constraints, problems are : Problem set: 0 solved, 156 unsolved in 22140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36650ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 36669ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 157/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37320 ms. Remains : 65/69 places, 157/162 transitions.
Support contains 55 out of 65 places after structural reductions.
[2025-06-02 05:19:59] [INFO ] Flatten gal took : 79 ms
[2025-06-02 05:19:59] [INFO ] Flatten gal took : 36 ms
[2025-06-02 05:20:00] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 54 out of 65 places (down from 55) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 63
RANDOM walk for 40000 steps (4008 resets) in 2956 ms. (13 steps per ms) remains 38/63 properties
BEST_FIRST walk for 4003 steps (92 resets) in 50 ms. (78 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (89 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (96 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (118 resets) in 53 ms. (74 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (82 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (77 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (82 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (94 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (88 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (87 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (84 resets) in 13 ms. (285 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (95 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (87 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (85 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (81 resets) in 12 ms. (308 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (87 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (89 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (75 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (89 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (88 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (77 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (87 resets) in 19 ms. (200 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (89 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (86 resets) in 43 ms. (90 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (119 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (94 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (84 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (117 resets) in 53 ms. (74 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (26 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (92 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (78 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (93 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (88 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (72 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (93 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (87 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (82 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
[2025-06-02 05:20:01] [INFO ] Invariant cache hit.
[2025-06-02 05:20:01] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/61 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 2/63 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 155/218 variables, 63/73 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 60/133 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/133 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 4/222 variables, 2/135 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 135 constraints, problems are : Problem set: 4 solved, 30 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 21/61 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/63 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 155/218 variables, 63/76 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 60/136 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 8/144 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/145 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 1/146 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 1/147 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/222 variables, and 147 constraints, problems are : Problem set: 4 solved, 30 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 8/34 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8009ms problems are : Problem set: 4 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 157/157 transitions.
Graph (complete) has 276 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 58 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 58 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 58 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 58 transition count 143
Applied a total of 16 rules in 57 ms. Remains 58 /65 variables (removed 7) and now considering 143/157 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 58/65 places, 143/157 transitions.
RANDOM walk for 40000 steps (4190 resets) in 820 ms. (48 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4003 steps (98 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (76 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (84 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (94 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (93 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (84 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (91 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (101 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (85 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (95 resets) in 64 ms. (61 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (119 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (23 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (99 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (73 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (101 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (90 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (101 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (94 resets) in 21 ms. (181 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (96 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
// Phase 1: matrix 143 rows 58 cols
[2025-06-02 05:20:09] [INFO ] Computed 9 invariants in 5 ms
[2025-06-02 05:20:09] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 25/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 143/201 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 130 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 25/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 2/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 143/201 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 19/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/201 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 23 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 05:20:17] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 14 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 05:20:19] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/201 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 164 constraints, problems are : Problem set: 0 solved, 19 unsolved in 12378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13941ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 17 properties in 8124 ms.
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 143/143 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 58 transition count 141
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 56 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 49 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 49 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 48 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 48 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 46 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 45 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 45 transition count 126
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 45 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 44 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 44 transition count 169
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 44 transition count 169
Applied a total of 36 rules in 63 ms. Remains 44 /58 variables (removed 14) and now considering 169/143 (removed -26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 44/58 places, 169/143 transitions.
RANDOM walk for 40000 steps (5053 resets) in 2164 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1002 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1667 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 165410 steps, run visited all 2 properties in 480 ms. (steps per millisecond=344 )
Probabilistic random walk after 165410 steps, saw 36385 distinct states, run finished after 487 ms. (steps per millisecond=339 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-06-02 05:20:33] [INFO ] Flatten gal took : 18 ms
[2025-06-02 05:20:33] [INFO ] Flatten gal took : 19 ms
[2025-06-02 05:20:33] [INFO ] Input system was already deterministic with 157 transitions.
Computed a total of 17 stabilizing places and 66 stable transitions
Graph (complete) has 341 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 51 transition count 131
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 51 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 48 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 48 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 46 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 46 transition count 107
Applied a total of 38 rules in 6 ms. Remains 46 /65 variables (removed 19) and now considering 107/157 (removed 50) transitions.
// Phase 1: matrix 107 rows 46 cols
[2025-06-02 05:20:33] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:20:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 05:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:20:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 05:20:33] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-06-02 05:20:33] [INFO ] Invariant cache hit.
[2025-06-02 05:20:33] [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/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 17 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 05:20:34] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 107 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/153 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 106/213 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 214 constraints, problems are : Problem set: 0 solved, 106 unsolved in 18367 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22941ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 22942ms
Starting structural reductions in LTL mode, iteration 1 : 46/65 places, 107/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23163 ms. Remains : 46/65 places, 107/157 transitions.
[2025-06-02 05:20:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:20:56] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:20:56] [INFO ] Input system was already deterministic with 107 transitions.
[2025-06-02 05:20:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:20:56] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:20:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11587484451464836538.gal : 14 ms
[2025-06-02 05:20:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7282384535012783334.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11587484451464836538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7282384535012783334.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,226168,0.251431,10124,2,1138,5,22916,6,0,288,33059,0


Converting to forward existential form...Done !
original formula: EF(EX(AF(AG(E((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1))) U (p12==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!(!(E(TRUE U !(E((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1))) U (p12==1)))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...374
(forward)formula 0,0,5.2293,127504,1,0,397,689273,242,167,2737,705258,441
FORMULA MedleyA-PT-02-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 134
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 134
Applied a total of 24 rules in 7 ms. Remains 53 /65 variables (removed 12) and now considering 134/157 (removed 23) transitions.
// Phase 1: matrix 134 rows 53 cols
[2025-06-02 05:21:01] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 05:21:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 05:21:02] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-02 05:21:02] [INFO ] Invariant cache hit.
[2025-06-02 05:21:02] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:03] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 18 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 05:21:04] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/187 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 18 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 05:21:09] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/187 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/187 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 131 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12526 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/187 variables, 53/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 58/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 133/264 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 265 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12272 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24909ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 24910ms
Starting structural reductions in LTL mode, iteration 1 : 53/65 places, 134/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25176 ms. Remains : 53/65 places, 134/157 transitions.
[2025-06-02 05:21:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:21:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:21:27] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 05:21:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:21:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:21:27] [INFO ] Time to serialize gal into /tmp/CTLFireability3873665470209944855.gal : 4 ms
[2025-06-02 05:21:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14137626654439707215.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/CTLFireability3873665470209944855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14137626654439707215.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,365191,0.381868,14560,2,1918,5,35655,6,0,343,51354,0


Converting to forward existential form...Done !
original formula: !(E(EG(E(((E((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))) U (p20==1)) + (p45==1)) + ((p35==1)&&(p54==1))) U EX((((p35==1)&&(p41==1))&&(p46...287
=> equivalent forward existential formula: [(FwdU((FwdU(Init,EG(E(((E((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))) U (p20==1)) + (p45==1)) + ((p35==1)&&(p54...357
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21, t23, t...489
Using saturation style SCC detection
(forward)formula 0,0,6.03355,126320,1,0,621,661040,315,314,3390,606207,649
FORMULA MedleyA-PT-02-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Graph (complete) has 341 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 50 transition count 130
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 50 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 47 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 33 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 43 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 42 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 42 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 47 place count 42 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 51 place count 40 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 55 place count 38 transition count 93
Applied a total of 55 rules in 34 ms. Remains 38 /65 variables (removed 27) and now considering 93/157 (removed 64) transitions.
// Phase 1: matrix 93 rows 38 cols
[2025-06-02 05:21:33] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 05:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 05:21:33] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:21:33] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-02 05:21:33] [INFO ] Invariant cache hit.
[2025-06-02 05:21:33] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 62 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 93/131 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 150 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10222ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/65 places, 93/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10427 ms. Remains : 38/65 places, 93/157 transitions.
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:21:43] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:21:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7104582249310911258.gal : 4 ms
[2025-06-02 05:21:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11059833922973235055.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/CTLFireability7104582249310911258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11059833922973235055.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,70424,0.238159,7796,2,713,5,15133,6,0,241,19909,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((((p4==0)||(p15==0))||(p28==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (((p4==0)||(p15==0))||(p28==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t24, t6...341
(forward)formula 0,1,2.99245,63680,1,0,277,327231,214,106,2324,301369,311
FORMULA MedleyA-PT-02-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 55 transition count 142
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 55 transition count 142
Applied a total of 20 rules in 3 ms. Remains 55 /65 variables (removed 10) and now considering 142/157 (removed 15) transitions.
// Phase 1: matrix 142 rows 55 cols
[2025-06-02 05:21:46] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 05:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:21:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-02 05:21:46] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-02 05:21:46] [INFO ] Invariant cache hit.
[2025-06-02 05:21:46] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 23 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 05:21:48] [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 05:21:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 14 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 05:21:48] [INFO ] Deduced a trap composed of 13 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 05:21:49] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:49] [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 05:21:49] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/197 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 134 constraints, problems are : Problem set: 0 solved, 141 unsolved in 8027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 26 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 05:21:56] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 142/197 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 60/137 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 141/278 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 11 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 05:22:03] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 282 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38089ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 38090ms
Starting structural reductions in LTL mode, iteration 1 : 55/65 places, 142/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38267 ms. Remains : 55/65 places, 142/157 transitions.
[2025-06-02 05:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:22:25] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-02 05:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3517764087340973471.gal : 3 ms
[2025-06-02 05:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7878376267036031252.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3517764087340973471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7878376267036031252.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,411195,0.513262,17292,2,2552,5,47209,6,0,358,64719,0


Converting to forward existential form...Done !
original formula: AX(E((EX((((A((((p7==1)&&(p11==1))&&((p35==1)&&(p55==1))) U (p44==1)) * (p7==1)) * ((p8==1)&&(p25==1))) * (((p33==1)&&(p57==1))&&(p67==1)...485
=> equivalent forward existential formula: [(EY(Init) * !(E((EX((((!((E(!((p44==1)) U (!((((p7==1)&&(p11==1))&&((p35==1)&&(p55==1)))) * !((p44==1)))) + EG(...690
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...568
(forward)formula 0,1,27.5609,608000,1,0,864,3.42607e+06,344,396,3322,3.35378e+06,986
FORMULA MedleyA-PT-02-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 137
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 47 transition count 113
Applied a total of 36 rules in 9 ms. Remains 47 /65 variables (removed 18) and now considering 113/157 (removed 44) transitions.
// Phase 1: matrix 113 rows 47 cols
[2025-06-02 05:22:52] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:22:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 05:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:22:53] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-02 05:22:53] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-06-02 05:22:53] [INFO ] Invariant cache hit.
[2025-06-02 05:22:53] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:22:54] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:22:54] [INFO ] Deduced a trap composed of 17 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 05:22:54] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 111 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4262 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/111 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 223 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15515ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 15516ms
Starting structural reductions in LTL mode, iteration 1 : 47/65 places, 113/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15722 ms. Remains : 47/65 places, 113/157 transitions.
[2025-06-02 05:23:08] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:23:08] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:23:08] [INFO ] Input system was already deterministic with 113 transitions.
[2025-06-02 05:23:08] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:23:08] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:23:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7446440167220825766.gal : 2 ms
[2025-06-02 05:23:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3917921512263599826.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/CTLFireability7446440167220825766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3917921512263599826.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,241300,0.373066,11264,2,1336,5,25937,6,0,298,37414,0


Converting to forward existential form...Done !
original formula: (AX(EX(EF((((p7==1)&&(p13==1))&&(p18==1))))) * AF((AX((((p5==1)&&(p57==1))&&(p65==1))) + (((p7==1)&&(p27==1))&&((p35==1)&&(p42==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(E(TRUE U (((p7==1)&&(p13==1))&&(p18==1))))))] = FALSE * [FwdG(Init,!((!(EX(!((((p5==1)&&(p57=...232
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t23, t...410
(forward)formula 0,0,2.01405,48276,1,0,330,186090,250,152,2827,279956,321
FORMULA MedleyA-PT-02-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 135
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 135
Applied a total of 24 rules in 2 ms. Remains 53 /65 variables (removed 12) and now considering 135/157 (removed 22) transitions.
// Phase 1: matrix 135 rows 53 cols
[2025-06-02 05:23:10] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:23:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 05:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:23:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 05:23:10] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-06-02 05:23:10] [INFO ] Invariant cache hit.
[2025-06-02 05:23:10] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:12] [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 05:23:12] [INFO ] Deduced a trap composed of 13 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 05:23:12] [INFO ] Deduced a trap composed of 14 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 05:23:12] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 19 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 05:23:12] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/188 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 129 constraints, problems are : Problem set: 0 solved, 134 unsolved in 9264 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/188 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 134/263 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 264 constraints, problems are : Problem set: 0 solved, 134 unsolved in 18482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27794ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 27795ms
Starting structural reductions in LTL mode, iteration 1 : 53/65 places, 135/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27994 ms. Remains : 53/65 places, 135/157 transitions.
[2025-06-02 05:23:38] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:23:38] [INFO ] Flatten gal took : 26 ms
[2025-06-02 05:23:38] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 05:23:38] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:23:38] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:23:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8808958938144024490.gal : 2 ms
[2025-06-02 05:23:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9509996693660886004.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/CTLFireability8808958938144024490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9509996693660886004.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,355816,0.597708,14296,2,2064,5,37183,6,0,344,48071,0


Converting to forward existential form...Done !
original formula: (E(!(EG(((AX((((p33==1)&&(p57==1))&&(p63==1))) + (((p35==1)&&(p41==1))&&(p46==1))) * AF((((p35==1)&&(p36==1))&&(p46==1)))))) U (AG((((p5=...494
=> equivalent forward existential formula: (([(FwdU(Init,!(EG(((!(EX(!((((p33==1)&&(p57==1))&&(p63==1))))) + (((p35==1)&&(p41==1))&&(p46==1))) * !(EG(!((((...795
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t...470
(forward)formula 0,1,18.978,439396,1,0,898,2.5102e+06,329,404,3380,2.34251e+06,1112
FORMULA MedleyA-PT-02-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 49 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 49 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 47 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 47 transition count 108
Applied a total of 36 rules in 12 ms. Remains 47 /65 variables (removed 18) and now considering 108/157 (removed 49) transitions.
// Phase 1: matrix 108 rows 47 cols
[2025-06-02 05:23:57] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:23:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 05:23:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:23:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 05:23:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-02 05:23:58] [INFO ] Invariant cache hit.
[2025-06-02 05:23:58] [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/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:23:59] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/155 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:00] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:00] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 110 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/155 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 107/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 217 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6700 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12814ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12815ms
Starting structural reductions in LTL mode, iteration 1 : 47/65 places, 108/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13016 ms. Remains : 47/65 places, 108/157 transitions.
[2025-06-02 05:24:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:24:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:24:10] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-02 05:24:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:24:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:24:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12402728872322636097.gal : 2 ms
[2025-06-02 05:24:10] [INFO ] Time to serialize properties into /tmp/CTLFireability878559331282561490.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/CTLFireability12402728872322636097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability878559331282561490.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,282739,0.378246,13072,2,1732,5,31158,6,0,293,47501,0


Converting to forward existential form...Done !
original formula: AX((AF(((((p5==1)&&(p57==1))&&(p65==1))||(((p33==1)&&(p57==1))&&(p67==1)))) + ((p38==0) * AF(AX(A((((p32==1)&&(p43==1))&&(p56==1)) U (((p...188
=> equivalent forward existential formula: ([((EY(Init) * !(!(EG(!(((((p5==1)&&(p57==1))&&(p65==1))||(((p33==1)&&(p57==1))&&(p67==1)))))))) * !((p38==0)))]...450
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...385
(forward)formula 0,0,17.9827,386980,1,0,792,2.06096e+06,253,373,2771,2.21986e+06,904
FORMULA MedleyA-PT-02-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Graph (complete) has 341 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 50 transition count 130
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 50 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 29 place count 48 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 48 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 47 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 47 transition count 115
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 44 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 44 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 44 place count 44 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 42 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 41 transition count 104
Applied a total of 50 rules in 22 ms. Remains 41 /65 variables (removed 24) and now considering 104/157 (removed 53) transitions.
// Phase 1: matrix 104 rows 41 cols
[2025-06-02 05:24:29] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:24:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 05:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:24:29] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-02 05:24:29] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:24:29] [INFO ] Redundant transitions in 4 ms returned []
Running 103 sub problems to find dead transitions.
[2025-06-02 05:24:29] [INFO ] Invariant cache hit.
[2025-06-02 05:24:29] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:30] [INFO ] Deduced a trap composed of 10 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 05:24:30] [INFO ] Deduced a trap composed of 21 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 05:24:30] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:31] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/145 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 51/105 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 105 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5704 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/145 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 51/105 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 103/208 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/145 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 209 constraints, problems are : Problem set: 0 solved, 103 unsolved in 14621 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20372ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 20372ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/65 places, 104/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20606 ms. Remains : 41/65 places, 104/157 transitions.
[2025-06-02 05:24:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:24:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:24:49] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-02 05:24:49] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:24:49] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:24:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1891062791135551355.gal : 2 ms
[2025-06-02 05:24:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17864732163701832795.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/CTLFireability1891062791135551355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17864732163701832795.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,76681,0.157931,8184,2,952,5,18272,6,0,266,18280,0


Converting to forward existential form...Done !
original formula: E(AG(!((((p35==1)&&(p36==1))&&(p48==1)))) U AF((((p35==1)&&(p36==1))&&(p53==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((((p35==1)&&(p36==1))&&(p48==1))))))) * !(EG(!((((p35==1)&&(p36==1))&&(p53==1))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t17, t18, t19, t20, t21, t22...375
(forward)formula 0,0,4.46306,109056,1,0,381,595090,241,150,2533,518319,455
FORMULA MedleyA-PT-02-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 54 transition count 139
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 54 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 52 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 52 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 51 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 51 transition count 124
Applied a total of 28 rules in 5 ms. Remains 51 /65 variables (removed 14) and now considering 124/157 (removed 33) transitions.
// Phase 1: matrix 124 rows 51 cols
[2025-06-02 05:24:54] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:24:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 05:24:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:24:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 05:24:54] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-02 05:24:54] [INFO ] Invariant cache hit.
[2025-06-02 05:24:54] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 15 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 05:24:56] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 25 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 05:24:56] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:24:56] [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 05:24:56] [INFO ] Deduced a trap composed of 22 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 05:24:56] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/175 variables, 51/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 55/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 124 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/175 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 55/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 123/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:09] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/175 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 249 constraints, problems are : Problem set: 0 solved, 123 unsolved in 18487 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25307ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 25309ms
Starting structural reductions in LTL mode, iteration 1 : 51/65 places, 124/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25515 ms. Remains : 51/65 places, 124/157 transitions.
[2025-06-02 05:25:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:25:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:25:19] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-02 05:25:19] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:25:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:25:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11050369580986667835.gal : 2 ms
[2025-06-02 05:25:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2544865585285727554.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/CTLFireability11050369580986667835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2544865585285727554.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,355606,0.44377,13068,2,1646,5,31350,6,0,325,47673,0


Converting to forward existential form...Done !
original formula: EF((((p40==1) * AX(E(((((p35==1)&&(p36==1))&&((p53==1)&&(p4==1)))&&((p15==1)&&(p28==1))) U ((((p7==1)&&(p27==1))&&((p57==1)&&(p61==1)))&&...259
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * ((p40==1) * !(EX(!(E(((((p35==1)&&(p36==1))&&((p53==1)&&(p4==1)))&&((p15==1)&&(p28==1))...329
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t19, t20, t21, t22, t23, t...470
(forward)formula 0,0,2.56746,58956,1,0,284,294326,277,98,3004,285392,306
FORMULA MedleyA-PT-02-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 135
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 51 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 51 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 50 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 50 transition count 120
Applied a total of 30 rules in 10 ms. Remains 50 /65 variables (removed 15) and now considering 120/157 (removed 37) transitions.
// Phase 1: matrix 120 rows 50 cols
[2025-06-02 05:25:22] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:25:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 05:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:25:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-02 05:25:22] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-06-02 05:25:22] [INFO ] Invariant cache hit.
[2025-06-02 05:25:22] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 14 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 05:25:24] [INFO ] Deduced a trap composed of 19 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 05:25:24] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 17 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 05:25:24] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/170 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 118 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/170 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 119/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:25:42] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/170 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 239 constraints, problems are : Problem set: 0 solved, 119 unsolved in 23163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31241ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 31243ms
Starting structural reductions in LTL mode, iteration 1 : 50/65 places, 120/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31472 ms. Remains : 50/65 places, 120/157 transitions.
[2025-06-02 05:25:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:25:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:25:53] [INFO ] Input system was already deterministic with 120 transitions.
[2025-06-02 05:25:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:25:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:25:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5867916163256341853.gal : 2 ms
[2025-06-02 05:25:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3459842573677736509.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/CTLFireability5867916163256341853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3459842573677736509.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,287218,0.450887,12756,2,1541,5,29247,6,0,317,46263,0


Converting to forward existential form...Done !
original formula: A(A(!((((p7==1)&&(p27==1))&&((p35==1)&&(p42==1)))) U EX(((p44==1) + AF((p24==1))))) U EG(!((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))))))))) * !(E(!(EG(!((((p7==1)&&(p27==1))&&((p57...437
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...452
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,24.8305,517416,1,0,1343,2.85839e+06,280,712,2957,3.09801e+06,1528
FORMULA MedleyA-PT-02-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Graph (complete) has 341 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 51 transition count 136
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 51 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 48 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 48 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 33 place count 46 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 46 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 44 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 44 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 44 place count 44 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 43 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 41 transition count 102
Applied a total of 50 rules in 18 ms. Remains 41 /65 variables (removed 24) and now considering 102/157 (removed 55) transitions.
// Phase 1: matrix 102 rows 41 cols
[2025-06-02 05:26:19] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 05:26:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 05:26:19] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:26:19] [INFO ] Redundant transitions in 4 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-02 05:26:19] [INFO ] Invariant cache hit.
[2025-06-02 05:26:19] [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/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:20] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/143 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 50/102 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 102 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/143 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 50/102 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 205 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13675ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 13676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/65 places, 102/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13890 ms. Remains : 41/65 places, 102/157 transitions.
[2025-06-02 05:26:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:26:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:26:32] [INFO ] Input system was already deterministic with 102 transitions.
[2025-06-02 05:26:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:26:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:26:32] [INFO ] Time to serialize gal into /tmp/CTLFireability622928260988923743.gal : 2 ms
[2025-06-02 05:26:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10376770653022023019.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/CTLFireability622928260988923743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10376770653022023019.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,80067,0.203529,8684,2,934,5,18671,6,0,264,22456,0


Converting to forward existential form...Done !
original formula: AG(((EF((((p7==0)||(p11==0))||((p35==0)||(p55==0)))) + (p18==1)) + E((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))) U (((p7==1)&&(p14==1))&&...167
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(E((((p7==1)&&(p27==1))&&((p57==1)&&(p65==1))) U (((p7==1)&&(p14==1))&&(p33==1))))) * !((...233
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, t...370
(forward)formula 0,1,0.582643,13420,1,0,186,43883,225,56,2491,39667,214
FORMULA MedleyA-PT-02-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Graph (complete) has 341 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 51 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 51 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 49 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 49 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 48 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 48 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 46 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 46 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 41 place count 46 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 44 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 42 transition count 105
Applied a total of 49 rules in 32 ms. Remains 42 /65 variables (removed 23) and now considering 105/157 (removed 52) transitions.
// Phase 1: matrix 105 rows 42 cols
[2025-06-02 05:26:33] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 05:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:33] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-06-02 05:26:33] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:26:33] [INFO ] Redundant transitions in 4 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-02 05:26:33] [INFO ] Invariant cache hit.
[2025-06-02 05:26:33] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 11 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 05:26:34] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/147 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 51/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 106 constraints, problems are : Problem set: 0 solved, 104 unsolved in 7118 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/147 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 51/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 104/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 210 constraints, problems are : Problem set: 0 solved, 104 unsolved in 9742 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16910ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 16910ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/65 places, 105/157 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17165 ms. Remains : 42/65 places, 105/157 transitions.
[2025-06-02 05:26:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:26:50] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-02 05:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9748380741748786012.gal : 1 ms
[2025-06-02 05:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16900180326153913153.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/CTLFireability9748380741748786012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16900180326153913153.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,81615,0.168903,9000,2,973,5,21658,6,0,271,23766,0


Converting to forward existential form...Done !
original formula: AF(EG(((AG((p24==0)) * (p5==1)) * ((p57==1)&&(p65==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((!(E(TRUE U !((p24==0)))) * (p5==1)) * ((p57==1)&&(p65==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...362
Using saturation style SCC detection
(forward)formula 0,0,1.40467,40060,1,0,276,188227,244,120,2569,163930,342
FORMULA MedleyA-PT-02-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 53 transition count 135
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 53 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 52 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 52 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 51 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 51 transition count 126
Applied a total of 28 rules in 3 ms. Remains 51 /65 variables (removed 14) and now considering 126/157 (removed 31) transitions.
// Phase 1: matrix 126 rows 51 cols
[2025-06-02 05:26:52] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 05:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:26:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 05:26:52] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-02 05:26:52] [INFO ] Invariant cache hit.
[2025-06-02 05:26:52] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 14 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 05:26:53] [INFO ] Deduced a trap composed of 10 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 05:26:53] [INFO ] Deduced a trap composed of 24 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 05:26:53] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 18 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 05:26:54] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/177 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 123 constraints, problems are : Problem set: 0 solved, 125 unsolved in 6145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/177 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 125/248 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 249 constraints, problems are : Problem set: 0 solved, 125 unsolved in 14255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20432ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 20432ms
Starting structural reductions in LTL mode, iteration 1 : 51/65 places, 126/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20607 ms. Remains : 51/65 places, 126/157 transitions.
[2025-06-02 05:27:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:27:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:27:12] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-02 05:27:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:27:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:27:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10634360081324598708.gal : 2 ms
[2025-06-02 05:27:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1889692224321598445.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/CTLFireability10634360081324598708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1889692224321598445.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,285946,0.363129,12300,2,1581,5,30749,6,0,327,40140,0


Converting to forward existential form...Done !
original formula: AF(((p47==1) + (((AX((p16==1)) * (p35==1)) * ((p36==1)&&(p51==1))) * (p13==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p47==1) + (((!(EX(!((p16==1)))) * (p35==1)) * ((p36==1)&&(p51==1))) * (p13==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...488
(forward)formula 0,0,3.0767,75660,1,0,406,302908,279,179,3068,454564,380
FORMULA MedleyA-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 51 transition count 131
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 51 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 49 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 47 transition count 113
Applied a total of 36 rules in 3 ms. Remains 47 /65 variables (removed 18) and now considering 113/157 (removed 44) transitions.
// Phase 1: matrix 113 rows 47 cols
[2025-06-02 05:27:15] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 05:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:16] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-02 05:27:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-06-02 05:27:16] [INFO ] Invariant cache hit.
[2025-06-02 05:27:16] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 11 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 05:27:17] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 113/160 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 52/113 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 113 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/160 variables, 47/61 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 52/113 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 112/225 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 228 constraints, problems are : Problem set: 0 solved, 112 unsolved in 13362 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19657ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19658ms
Starting structural reductions in LTL mode, iteration 1 : 47/65 places, 113/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19833 ms. Remains : 47/65 places, 113/157 transitions.
[2025-06-02 05:27:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:27:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:27:35] [INFO ] Input system was already deterministic with 113 transitions.
[2025-06-02 05:27:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:27:35] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:27:35] [INFO ] Time to serialize gal into /tmp/CTLFireability5004670513777822053.gal : 1 ms
[2025-06-02 05:27:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10009408574066551635.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/CTLFireability5004670513777822053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10009408574066551635.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,241300,0.319191,10752,2,1228,5,24388,6,0,298,34081,0


Converting to forward existential form...Done !
original formula: EF(EG((AF((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1)))) + EX((((p35!=1)||(p41!=1))||(p46!=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!((((p35==1)&&(p55==1))&&((p57==1)&&(p67==1)))))) + EX((((p35!=1)||(p41!=1))||(p46!=...171
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t...409
(forward)formula 0,1,7.08263,166628,1,0,429,920041,254,169,2779,951979,493
FORMULA MedleyA-PT-02-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 157/157 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 54 transition count 136
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 54 transition count 136
Applied a total of 22 rules in 2 ms. Remains 54 /65 variables (removed 11) and now considering 136/157 (removed 21) transitions.
// Phase 1: matrix 136 rows 54 cols
[2025-06-02 05:27:42] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:43] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 05:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 05:27:43] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-06-02 05:27:43] [INFO ] Invariant cache hit.
[2025-06-02 05:27:43] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:45] [INFO ] Deduced a trap composed of 18 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 05:27:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/190 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 58/130 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 131 constraints, problems are : Problem set: 0 solved, 135 unsolved in 9899 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/190 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 58/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 135/266 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/190 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 267 constraints, problems are : Problem set: 0 solved, 135 unsolved in 17249 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27187ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 27188ms
Starting structural reductions in LTL mode, iteration 1 : 54/65 places, 136/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27385 ms. Remains : 54/65 places, 136/157 transitions.
[2025-06-02 05:28:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:28:10] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:28:10] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-02 05:28:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:28:10] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:28:10] [INFO ] Time to serialize gal into /tmp/CTLFireability505717392779824773.gal : 1 ms
[2025-06-02 05:28:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13548378476698641136.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/CTLFireability505717392779824773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13548378476698641136.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,384901,0.568499,15988,2,2321,5,36347,6,0,349,63166,0


Converting to forward existential form...Done !
original formula: A(AX((((p7==1)&&(p13==1))&&(p25==1))) U ((AF(!(EF((((p3==1)&&(p15==1))&&(p28==1))))) * !(AG((((p35==1)&&(p55==1))&&((p57==1)&&(p63==1))))...380
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EG(!(!(E(TRUE U (((p3==1)&&(p15==1))&&(p28==1))))))) * !(!(E(TRUE U !((((p35==1)&&(p55==1))...2122
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...534
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,23.992,487884,1,0,1118,2.62126e+06,325,566,3321,2.67291e+06,1274
FORMULA MedleyA-PT-02-CTLFireability-2024-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 : 65/65 places, 157/157 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 54 transition count 135
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 54 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 52 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 51 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 51 transition count 120
Applied a total of 28 rules in 5 ms. Remains 51 /65 variables (removed 14) and now considering 120/157 (removed 37) transitions.
// Phase 1: matrix 120 rows 51 cols
[2025-06-02 05:28:34] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:28:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 05:28:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:28:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-02 05:28:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-06-02 05:28:34] [INFO ] Invariant cache hit.
[2025-06-02 05:28:34] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:35] [INFO ] Deduced a trap composed of 10 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 05:28:36] [INFO ] Deduced a trap composed of 26 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 05:28:36] [INFO ] Deduced a trap composed of 17 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 05:28:36] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:38] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 118 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7275 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/171 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 119/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/171 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 241 constraints, problems are : Problem set: 0 solved, 119 unsolved in 18382 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25699ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 25700ms
Starting structural reductions in LTL mode, iteration 1 : 51/65 places, 120/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25896 ms. Remains : 51/65 places, 120/157 transitions.
[2025-06-02 05:29:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:29:00] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:29:00] [INFO ] Input system was already deterministic with 120 transitions.
[2025-06-02 05:29:00] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:29:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:29:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11777581611856889893.gal : 1 ms
[2025-06-02 05:29:00] [INFO ] Time to serialize properties into /tmp/CTLFireability716965895173963547.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/CTLFireability11777581611856889893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability716965895173963547.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,355453,0.663217,17508,2,2425,5,48384,6,0,321,62924,0


Converting to forward existential form...Done !
original formula: AX(EG(A(AX(E((((p32==1)&&(p43==1))&&(p56==1)) U (((p30==1)&&(p43==1))&&(p56==1)))) U EX(AF((p19==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((E(!(EX(!(EG(!((p19==1)))))) U (!(!(EX(!(E((((p32==1)&&(p43==1))&&(p56==1)) U (((p30==1)&&(p...254
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t21, t22, t...422
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,0,19.1151,410388,1,0,744,2.36378e+06,277,415,3046,2.25562e+06,882
FORMULA MedleyA-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:29:19] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:29:19] [INFO ] Flatten gal took : 9 ms
Total runtime 598280 ms.

BK_STOP 1748842159939

--------------------
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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r128-smll-174876524000106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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