Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 91K 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 BusinessProcesses-PT-08-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-15
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748558182751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 22:36:25] [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-05-29 22:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:36:25] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-05-29 22:36:25] [INFO ] Transformed 393 places.
[2025-05-29 22:36:25] [INFO ] Transformed 344 transitions.
[2025-05-29 22:36:25] [INFO ] Found NUPN structural information;
[2025-05-29 22:36:25] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 13 transitions.
Support contains 68 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 65 place count 315 transition count 274
Iterating global reduction 1 with 57 rules applied. Total rules applied 122 place count 315 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 315 transition count 273
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 154 place count 284 transition count 242
Iterating global reduction 2 with 31 rules applied. Total rules applied 185 place count 284 transition count 242
Applied a total of 185 rules in 176 ms. Remains 284 /380 variables (removed 96) and now considering 242/331 (removed 89) transitions.
// Phase 1: matrix 242 rows 284 cols
[2025-05-29 22:36:26] [INFO ] Computed 50 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:36:26] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-05-29 22:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:36:27] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-05-29 22:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:36] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:38] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:38] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:38] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:39] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:40] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:40] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:40] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:41] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:41] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:41] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:41] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:41] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:42] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:46] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:46] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:47] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:48] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:49] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/526 variables, 284/375 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:56] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:56] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:57] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:36:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 380 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 46/96 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/526 variables, 284/380 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 241/621 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:07] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:07] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:08] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:08] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:08] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:09] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:09] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:09] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:10] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:10] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:10] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:12] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 16/637 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:23] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:23] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:23] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:23] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:25] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:26] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:28] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 11 ms to minimize.
SMT process timed out in 60325ms, After SMT, problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in LTL mode, iteration 1 : 284/380 places, 242/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62087 ms. Remains : 284/380 places, 242/331 transitions.
Support contains 68 out of 284 places after structural reductions.
[2025-05-29 22:37:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-29 22:37:28] [INFO ] Flatten gal took : 166 ms
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 22:37:28] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:37:28] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 66 out of 284 places (down from 68) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 41 to 40
RANDOM walk for 40000 steps (336 resets) in 2384 ms. (16 steps per ms) remains 7/40 properties
BEST_FIRST walk for 40004 steps (57 resets) in 108 ms. (367 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 86 ms. (459 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 68 ms. (579 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (66 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2025-05-29 22:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 99/261 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 226/487 variables, 261/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/521 variables, 19/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:30] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:30] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:31] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:31] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:31] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:31] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 10 (OVERLAPS) 5/526 variables, 4/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/526 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 340 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/258 variables, 49/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 218/476 variables, 258/309 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/515 variables, 17/327 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 5/332 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/526 variables, 9/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/526 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 341 constraints, problems are : Problem set: 1 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2025-05-29 22:37:32] [INFO ] Flatten gal took : 31 ms
[2025-05-29 22:37:32] [INFO ] Flatten gal took : 32 ms
[2025-05-29 22:37:32] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 103 stabilizing places and 99 stable transitions
Graph (complete) has 597 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 154 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 277 transition count 192
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 235 transition count 192
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 86 place count 235 transition count 137
Deduced a syphon composed of 55 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 207 place count 169 transition count 137
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 225 place count 151 transition count 119
Iterating global reduction 2 with 18 rules applied. Total rules applied 243 place count 151 transition count 119
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 381 place count 81 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 80 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 79 transition count 50
Applied a total of 383 rules in 103 ms. Remains 79 /284 variables (removed 205) and now considering 50/242 (removed 192) transitions.
// Phase 1: matrix 50 rows 79 cols
[2025-05-29 22:37:32] [INFO ] Computed 36 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:33] [INFO ] Implicit Places using invariants in 128 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 78/284 places, 50/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 244 ms. Remains : 78/284 places, 50/242 transitions.
[2025-05-29 22:37:33] [INFO ] Flatten gal took : 10 ms
[2025-05-29 22:37:33] [INFO ] Flatten gal took : 11 ms
[2025-05-29 22:37:33] [INFO ] Input system was already deterministic with 50 transitions.
[2025-05-29 22:37:33] [INFO ] Flatten gal took : 10 ms
[2025-05-29 22:37:33] [INFO ] Flatten gal took : 10 ms
[2025-05-29 22:37:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8128277256203335650.gal : 4 ms
[2025-05-29 22:37:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14234558116240252094.ctl : 6 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/CTLFireability8128277256203335650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14234558116240252094.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,81,0.059937,4308,2,418,5,2016,6,0,358,1727,0


Converting to forward existential form...Done !
original formula: AF(E(!(EG((p11==1))) U (p24==1)))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EG((p11==1))) U (p24==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t20, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.231754,7892,1,0,134,15645,129,122,2391,13692,225
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 152 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 277 transition count 193
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 236 transition count 193
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 84 place count 236 transition count 140
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 201 place count 172 transition count 140
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 220 place count 153 transition count 121
Iterating global reduction 2 with 19 rules applied. Total rules applied 239 place count 153 transition count 121
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 381 place count 81 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 80 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 79 transition count 50
Applied a total of 383 rules in 75 ms. Remains 79 /284 variables (removed 205) and now considering 50/242 (removed 192) transitions.
// Phase 1: matrix 50 rows 79 cols
[2025-05-29 22:37:33] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-29 22:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 386 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/284 places, 50/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 42 transition count 43
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 35 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 29 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 29 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 29 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 27 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 27 transition count 34
Applied a total of 31 rules in 9 ms. Remains 27 /42 variables (removed 15) and now considering 34/50 (removed 16) transitions.
// Phase 1: matrix 34 rows 27 cols
[2025-05-29 22:37:34] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-29 22:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/284 places, 34/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 580 ms. Remains : 27/284 places, 34/242 transitions.
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 3 ms
[2025-05-29 22:37:34] [INFO ] Input system was already deterministic with 34 transitions.
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 4 ms
[2025-05-29 22:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7686233686717982790.gal : 2 ms
[2025-05-29 22:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12444302820928458878.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7686233686717982790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12444302820928458878.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 11513 steps (2837 resets) in 89 ms. (127 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality12444302820928458878.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 154 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 277 transition count 193
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 236 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 235 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 86 place count 235 transition count 138
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 204 place count 171 transition count 138
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 223 place count 152 transition count 119
Iterating global reduction 3 with 19 rules applied. Total rules applied 242 place count 152 transition count 119
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 385 place count 79 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 386 place count 78 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 387 place count 77 transition count 48
Applied a total of 387 rules in 52 ms. Remains 77 /284 variables (removed 207) and now considering 48/242 (removed 194) transitions.
// Phase 1: matrix 48 rows 77 cols
[2025-05-29 22:37:34] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants in 127 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/284 places, 48/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 188 ms. Remains : 76/284 places, 48/242 transitions.
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 8 ms
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 9 ms
[2025-05-29 22:37:34] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 23 steps (6 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:37:34] [INFO ] Flatten gal took : 9 ms
[2025-05-29 22:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11219490238883942637.gal : 2 ms
[2025-05-29 22:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3307308563836540439.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11219490238883942637.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3307308563836540439.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3307308563836540439.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 150 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 277 transition count 196
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 239 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 238 transition count 195
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 80 place count 238 transition count 142
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 196 place count 175 transition count 142
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 214 place count 157 transition count 124
Iterating global reduction 3 with 18 rules applied. Total rules applied 232 place count 157 transition count 124
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 373 place count 85 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 374 place count 84 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 83 transition count 54
Applied a total of 375 rules in 53 ms. Remains 83 /284 variables (removed 201) and now considering 54/242 (removed 188) transitions.
// Phase 1: matrix 54 rows 83 cols
[2025-05-29 22:37:34] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 22:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:34] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 380 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/284 places, 54/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 48
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 62 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 59 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 59 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 58 transition count 44
Applied a total of 20 rules in 11 ms. Remains 58 /68 variables (removed 10) and now considering 44/54 (removed 10) transitions.
// Phase 1: matrix 44 rows 58 cols
[2025-05-29 22:37:34] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-29 22:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 295 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/284 places, 44/242 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 43
Applied a total of 1 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 45 cols
[2025-05-29 22:37:35] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-29 22:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 45/284 places, 43/242 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 927 ms. Remains : 45/284 places, 43/242 transitions.
[2025-05-29 22:37:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:35] [INFO ] Input system was already deterministic with 43 transitions.
[2025-05-29 22:37:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12529000466988091673.gal : 2 ms
[2025-05-29 22:37:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17867141745879805524.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/CTLFireability12529000466988091673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17867141745879805524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,257,0.016496,4164,2,294,5,1241,6,0,219,1114,0


Converting to forward existential form...Done !
original formula: EF(((p209==1) + AG(((((p91==0)||(p192==0))||(p364==0))&&(p7==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p209==1))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(((((p91==0)||(p192==0))||(p364==0))...180
(forward)formula 0,1,0.017382,4420,1,0,7,1241,8,1,222,1114,1
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (complete) has 597 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 282 transition count 204
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 246 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 244 transition count 202
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 77 place count 244 transition count 145
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 201 place count 177 transition count 145
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 220 place count 158 transition count 126
Iterating global reduction 3 with 19 rules applied. Total rules applied 239 place count 158 transition count 126
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 376 place count 88 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 377 place count 88 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 87 transition count 57
Applied a total of 378 rules in 52 ms. Remains 87 /284 variables (removed 197) and now considering 57/242 (removed 185) transitions.
// Phase 1: matrix 57 rows 87 cols
[2025-05-29 22:37:35] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-29 22:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:35] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [23, 25, 27, 28, 29, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 65, 67]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 396 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/284 places, 57/242 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 64 transition count 50
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 57 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 52 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 52 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 52 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 51 transition count 44
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 51 transition count 44
Applied a total of 28 rules in 12 ms. Remains 51 /64 variables (removed 13) and now considering 44/57 (removed 13) transitions.
// Phase 1: matrix 44 rows 51 cols
[2025-05-29 22:37:35] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-29 22:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [3, 4, 5, 6, 7, 8, 9, 11, 14, 15, 16]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 191 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/284 places, 44/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 654 ms. Remains : 40/284 places, 44/242 transitions.
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 4 ms
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 4 ms
[2025-05-29 22:37:36] [INFO ] Input system was already deterministic with 44 transitions.
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:37:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11687172952632553169.gal : 2 ms
[2025-05-29 22:37:36] [INFO ] Time to serialize properties into /tmp/CTLFireability989040155200582125.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/CTLFireability11687172952632553169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability989040155200582125.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,424,0.034768,4404,2,221,5,1816,6,0,199,2666,0


Converting to forward existential form...Done !
original formula: !(A((((p138==1)&&(p196==1))&&(p392==1)) U E(!((((p93==1)&&(p216==1))&&(p392==1))) U AG(A((p79==1) U (((p118==1)&&(p277==1))&&(p384==1))))...158
=> equivalent forward existential formula: ([((FwdU(Init,!(E(!((((p93==1)&&(p216==1))&&(p392==1))) U !(E(TRUE U !(!((E(!((((p118==1)&&(p277==1))&&(p384==1)...770
Reverse transition relation is NOT exact ! Due to transitions t2, t12, t13, t15, t16, t19, t20, t21, t26, t27, t28, t30, t36, t40, t42, Intersection with ...234
(forward)formula 0,1,0.19862,7604,1,0,179,18186,128,91,1382,21233,202
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 154 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 277 transition count 192
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 235 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 86 place count 235 transition count 138
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 205 place count 170 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 223 place count 152 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 241 place count 152 transition count 120
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 386 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 76 transition count 48
Applied a total of 388 rules in 54 ms. Remains 76 /284 variables (removed 208) and now considering 48/242 (removed 194) transitions.
// Phase 1: matrix 48 rows 76 cols
[2025-05-29 22:37:36] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-29 22:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 323 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/284 places, 48/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 25 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 22 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 22 transition count 31
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 22 transition count 31
Applied a total of 35 rules in 12 ms. Remains 22 /38 variables (removed 16) and now considering 31/48 (removed 17) transitions.
// Phase 1: matrix 31 rows 22 cols
[2025-05-29 22:37:36] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-29 22:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:36] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/284 places, 31/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 481 ms. Remains : 22/284 places, 31/242 transitions.
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 4 ms
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 3 ms
[2025-05-29 22:37:36] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 382 steps (122 resets) in 6 ms. (54 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:37:36] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:37:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15970904059059682540.gal : 1 ms
[2025-05-29 22:37:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5581306146433322323.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15970904059059682540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5581306146433322323.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5581306146433322323.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,11,0.009172,4132,2,42,5,169,6,0,118,110,0
Total reachable state count : 11

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 269 transition count 227
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 269 transition count 227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 267 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 267 transition count 225
Applied a total of 34 rules in 40 ms. Remains 267 /284 variables (removed 17) and now considering 225/242 (removed 17) transitions.
// Phase 1: matrix 225 rows 267 cols
[2025-05-29 22:37:36] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:37] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-05-29 22:37:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:37] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-29 22:37:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:44] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:45] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:45] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:45] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:45] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:45] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:46] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:46] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:47] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:47] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:47] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:47] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:47] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:48] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:49] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:49] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:49] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:50] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:50] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:37:54] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/492 variables, 267/343 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:03] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:03] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:04] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:04] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:05] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:06] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 349 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 32/82 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/492 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 224/573 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:19] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:19] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:19] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:19] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:19] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:22] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:23] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:23] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:23] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 9/582 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:27] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:29] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:38:30] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 586 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 267/284 places, 225/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 267/284 places, 225/242 transitions.
[2025-05-29 22:38:37] [INFO ] Flatten gal took : 13 ms
[2025-05-29 22:38:37] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:38:37] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-29 22:38:37] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:38:37] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:38:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15229218677816074242.gal : 6 ms
[2025-05-29 22:38:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10398395618925152221.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/CTLFireability15229218677816074242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10398395618925152221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.45127e+17,14.7598,297804,2,49603,5,577186,6,0,1293,1.96965e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:39:07] [INFO ] Flatten gal took : 21 ms
[2025-05-29 22:39:07] [INFO ] Applying decomposition
[2025-05-29 22:39:07] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5008262358310008380.txt' '-o' '/tmp/graph5008262358310008380.bin' '-w' '/tmp/graph5008262358310008380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5008262358310008380.bin' '-l' '-1' '-v' '-w' '/tmp/graph5008262358310008380.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:39:08] [INFO ] Decomposing Gal with order
[2025-05-29 22:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:39:08] [INFO ] Removed a total of 88 redundant transitions.
[2025-05-29 22:39:08] [INFO ] Flatten gal took : 221 ms
[2025-05-29 22:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 25 ms.
[2025-05-29 22:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6760631640959527293.gal : 15 ms
[2025-05-29 22:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13440690444330293439.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/CTLFireability6760631640959527293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13440690444330293439.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.45127e+17,2.04238,47992,8773,24,70912,360,570,159399,38,778,0


Converting to forward existential form...Done !
original formula: !(E(EX(((!((((i15.i1.u58.p205==1)||(i18.i1.u61.p218==1))&&(i16.u48.p165==1))) + !(E((i19.u87.p356==1) U (i3.u90.p373==1)))) + (AG((i6.u8....353
=> equivalent forward existential formula: [FwdG(FwdU(Init,EX(((!((((i15.i1.u58.p205==1)||(i18.i1.u61.p218==1))&&(i16.u48.p165==1))) + !(E((i19.u87.p356==1...429
Reverse transition relation is NOT exact ! Due to transitions t164, t201, t208, t210, t212, t215, t220, t222, t223, i0.u73.t38, i0.u74.t35, i1.i0.u75.t32, ...854
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 264 transition count 222
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 264 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 259 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 259 transition count 217
Applied a total of 50 rules in 21 ms. Remains 259 /284 variables (removed 25) and now considering 217/242 (removed 25) transitions.
// Phase 1: matrix 217 rows 259 cols
[2025-05-29 22:39:38] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:38] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-29 22:39:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:39] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-29 22:39:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:45] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:46] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:46] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:46] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:46] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:46] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:47] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:47] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:47] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:48] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:48] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:48] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:49] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:51] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/331 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:57] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:57] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:58] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:58] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:59] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:39:59] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:03] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 1.0)
(t27 1.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 0.0)
(t32 0.0)
(t33 1.0)
(t34 1.0)
(t35 1.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 1.0)
(t40 1.0)
(t41 0.0)
(t42 1.0)
(t43 1.0)
(t44 0.0)
(t45 1.0)
(t46 1.0)
(t47 0.0)
(t48 1.0)
(t49 1.0)
(t50 0.0)
(t51 1.0)
(t52 1.0)
(t53 0.0)
(t54 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 338 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/553 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:18] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:20] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:28] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:28] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:29] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:29] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:29] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:29] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:30] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:40:31] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 60077ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 259/284 places, 217/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60900 ms. Remains : 259/284 places, 217/242 transitions.
[2025-05-29 22:40:39] [INFO ] Flatten gal took : 13 ms
[2025-05-29 22:40:39] [INFO ] Flatten gal took : 9 ms
[2025-05-29 22:40:39] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-29 22:40:39] [INFO ] Flatten gal took : 14 ms
[2025-05-29 22:40:39] [INFO ] Flatten gal took : 14 ms
[2025-05-29 22:40:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12724712249562846846.gal : 3 ms
[2025-05-29 22:40:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14217790639018145326.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/CTLFireability12724712249562846846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14217790639018145326.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,10.0903,218844,2,43181,5,453369,6,0,1253,1.41302e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:41:09] [INFO ] Flatten gal took : 14 ms
[2025-05-29 22:41:09] [INFO ] Applying decomposition
[2025-05-29 22:41:09] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4648577738941019130.txt' '-o' '/tmp/graph4648577738941019130.bin' '-w' '/tmp/graph4648577738941019130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4648577738941019130.bin' '-l' '-1' '-v' '-w' '/tmp/graph4648577738941019130.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:41:09] [INFO ] Decomposing Gal with order
[2025-05-29 22:41:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:41:09] [INFO ] Removed a total of 89 redundant transitions.
[2025-05-29 22:41:09] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-05-29 22:41:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16027741021747858171.gal : 9 ms
[2025-05-29 22:41:09] [INFO ] Time to serialize properties into /tmp/CTLFireability691691044892829783.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/CTLFireability16027741021747858171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability691691044892829783.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,7.37881,138784,7504,24,173544,356,489,556892,36,764,0


Converting to forward existential form...Done !
original formula: AX(EF((((i5.u23.p71==1)&&(i18.u51.p172==1))&&(i5.u83.p346==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i5.u23.p71==1)&&(i18.u51.p172==1))&&(i5.u83.p346==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t106, t156, t188, t193, t196, t200, t202, t203, t207, t212, t214, t215, i0.u71.t37, i0.u72.t3...776
(forward)formula 0,1,25.1938,480028,1,0,824301,356,3204,1.61952e+06,166,764,1723566
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 266 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 266 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 261 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 261 transition count 219
Applied a total of 46 rules in 22 ms. Remains 261 /284 variables (removed 23) and now considering 219/242 (removed 23) transitions.
// Phase 1: matrix 219 rows 261 cols
[2025-05-29 22:41:35] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:35] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-29 22:41:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:36] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 22:41:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:41] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:42] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:43] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:44] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:44] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:44] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:45] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:45] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:45] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:45] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:47] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/332 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:53] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:54] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:54] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:54] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:55] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:41:56] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:04] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 339 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/338 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:12] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:12] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:12] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:13] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:13] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:13] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:13] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:13] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:14] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:15] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:15] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:15] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:15] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:15] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/576 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:17] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:19] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:42:21] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 580 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 261/284 places, 219/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60861 ms. Remains : 261/284 places, 219/242 transitions.
[2025-05-29 22:42:36] [INFO ] Flatten gal took : 9 ms
[2025-05-29 22:42:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 22:42:36] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-29 22:42:36] [INFO ] Flatten gal took : 7 ms
[2025-05-29 22:42:36] [INFO ] Flatten gal took : 8 ms
[2025-05-29 22:42:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12044659684858012161.gal : 2 ms
[2025-05-29 22:42:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12539572274304554001.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/CTLFireability12044659684858012161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12539572274304554001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21578e+17,12.07,238736,2,47196,5,496675,6,0,1263,1.55289e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:43:06] [INFO ] Flatten gal took : 8 ms
[2025-05-29 22:43:06] [INFO ] Applying decomposition
[2025-05-29 22:43:06] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17432467254268404312.txt' '-o' '/tmp/graph17432467254268404312.bin' '-w' '/tmp/graph17432467254268404312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17432467254268404312.bin' '-l' '-1' '-v' '-w' '/tmp/graph17432467254268404312.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:43:06] [INFO ] Decomposing Gal with order
[2025-05-29 22:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:43:06] [INFO ] Removed a total of 84 redundant transitions.
[2025-05-29 22:43:06] [INFO ] Flatten gal took : 20 ms
[2025-05-29 22:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-05-29 22:43:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13081373956264251636.gal : 5 ms
[2025-05-29 22:43:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6061456081420783591.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/CTLFireability13081373956264251636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6061456081420783591.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21578e+17,2.01189,53220,5630,35,76664,463,560,181538,46,1187,0


Converting to forward existential form...Done !
original formula: E(EX(A((E((i16.i1.u48.p165==1) U (i2.u16.p46==1)) + ((i6.i0.u6.p14==1)&&((i12.u44.p155==1)||(i12.u20.p63==1)))) U AG(EF((i17.i1.u74.p351=...189
=> equivalent forward existential formula: [(FwdU(Init,EX(!((E(!(!(E(TRUE U !(E(TRUE U (i17.i1.u74.p351==1)))))) U (!((E((i16.i1.u48.p165==1) U (i2.u16.p46...386
Reverse transition relation is NOT exact ! Due to transitions t107, t158, t191, t195, t199, t202, t204, t206, t209, t214, t216, t217, i0.i0.u39.t100, i0.i1...856
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (trivial) has 152 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 277 transition count 193
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 236 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 84 place count 236 transition count 139
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 203 place count 171 transition count 139
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 220 place count 154 transition count 122
Iterating global reduction 2 with 17 rules applied. Total rules applied 237 place count 154 transition count 122
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 382 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 384 place count 78 transition count 50
Applied a total of 384 rules in 23 ms. Remains 78 /284 variables (removed 206) and now considering 50/242 (removed 192) transitions.
// Phase 1: matrix 50 rows 78 cols
[2025-05-29 22:43:36] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-29 22:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:36] [INFO ] Implicit Places using invariants and state equation in 366 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 485 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/284 places, 50/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 41 transition count 45
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 36 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 30 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 30 transition count 39
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 30 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 27 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 26 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 26 transition count 34
Applied a total of 31 rules in 7 ms. Remains 26 /41 variables (removed 15) and now considering 34/50 (removed 16) transitions.
// Phase 1: matrix 34 rows 26 cols
[2025-05-29 22:43:36] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-29 22:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:37] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/284 places, 34/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 637 ms. Remains : 26/284 places, 34/242 transitions.
[2025-05-29 22:43:37] [INFO ] Flatten gal took : 4 ms
[2025-05-29 22:43:37] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:43:37] [INFO ] Input system was already deterministic with 34 transitions.
[2025-05-29 22:43:37] [INFO ] Flatten gal took : 3 ms
[2025-05-29 22:43:37] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:43:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9016044156243111157.gal : 1 ms
[2025-05-29 22:43:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10885421966761818440.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/CTLFireability9016044156243111157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10885421966761818440.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,76,0.01697,4036,2,72,5,744,6,0,138,874,0


Converting to forward existential form...Done !
original formula: EF(((p342==1) * AF((p220==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p342==1)) * !(EG(!((p220==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t23, t31, t32, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,1,0.034957,4548,1,0,61,2553,91,38,806,2114,85
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 267 transition count 225
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 267 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 262 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 262 transition count 220
Applied a total of 44 rules in 19 ms. Remains 262 /284 variables (removed 22) and now considering 220/242 (removed 22) transitions.
// Phase 1: matrix 220 rows 262 cols
[2025-05-29 22:43:37] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:37] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-29 22:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:43:38] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-29 22:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:43] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:44] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:45] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:45] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:45] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:45] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:45] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:46] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:46] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:46] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:47] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:48] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:49] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:49] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:49] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/482 variables, 262/342 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:55] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:55] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:56] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:56] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:57] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:43:57] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 349 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 37/87 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/482 variables, 262/349 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 219/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:15] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:15] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:16] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:16] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:16] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 6/574 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:22] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:24] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:24] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:27] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:44:35] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 579 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 262/284 places, 220/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 262/284 places, 220/242 transitions.
[2025-05-29 22:44:38] [INFO ] Flatten gal took : 11 ms
[2025-05-29 22:44:38] [INFO ] Flatten gal took : 14 ms
[2025-05-29 22:44:38] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-29 22:44:38] [INFO ] Flatten gal took : 11 ms
[2025-05-29 22:44:38] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16084079834129363368.gal : 3 ms
[2025-05-29 22:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11556247344797001646.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/CTLFireability16084079834129363368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11556247344797001646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57983e+17,16.0359,303860,2,51849,5,598061,6,0,1268,1.96782e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:45:08] [INFO ] Flatten gal took : 10 ms
[2025-05-29 22:45:08] [INFO ] Applying decomposition
[2025-05-29 22:45:08] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph817498137519134077.txt' '-o' '/tmp/graph817498137519134077.bin' '-w' '/tmp/graph817498137519134077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph817498137519134077.bin' '-l' '-1' '-v' '-w' '/tmp/graph817498137519134077.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:45:08] [INFO ] Decomposing Gal with order
[2025-05-29 22:45:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:45:08] [INFO ] Removed a total of 86 redundant transitions.
[2025-05-29 22:45:08] [INFO ] Flatten gal took : 27 ms
[2025-05-29 22:45:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2025-05-29 22:45:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5950352714186674832.gal : 6 ms
[2025-05-29 22:45:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2879483604429001620.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/CTLFireability5950352714186674832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2879483604429001620.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57983e+17,7.62128,136400,14916,26,142266,263,578,612215,42,573,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 264 transition count 222
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 264 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 259 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 259 transition count 217
Applied a total of 50 rules in 12 ms. Remains 259 /284 variables (removed 25) and now considering 217/242 (removed 25) transitions.
// Phase 1: matrix 217 rows 259 cols
[2025-05-29 22:45:38] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:45:38] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-29 22:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:45:39] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-29 22:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:44] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:44] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:44] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:44] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:45] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:46] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:46] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:47] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:49] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:52] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/331 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:59] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:59] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:45:59] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:01] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:07] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 338 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/553 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:16] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:27] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:27] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:27] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:27] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:28] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:29] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:30] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 60047ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 259/284 places, 217/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60824 ms. Remains : 259/284 places, 217/242 transitions.
[2025-05-29 22:46:39] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:46:39] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:46:39] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-29 22:46:39] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:46:39] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:46:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2743761818843258920.gal : 1 ms
[2025-05-29 22:46:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8124005075364326300.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/CTLFireability2743761818843258920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8124005075364326300.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,2.17415e+17,10.6304,218912,2,43181,5,453369,6,0,1253,1.41302e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:47:09] [INFO ] Flatten gal took : 19 ms
[2025-05-29 22:47:09] [INFO ] Applying decomposition
[2025-05-29 22:47:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6125832048902841668.txt' '-o' '/tmp/graph6125832048902841668.bin' '-w' '/tmp/graph6125832048902841668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6125832048902841668.bin' '-l' '-1' '-v' '-w' '/tmp/graph6125832048902841668.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:47:09] [INFO ] Decomposing Gal with order
[2025-05-29 22:47:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:47:09] [INFO ] Removed a total of 89 redundant transitions.
[2025-05-29 22:47:09] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:47:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-29 22:47:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3536674050390044624.gal : 3 ms
[2025-05-29 22:47:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11541058205058417073.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/CTLFireability3536674050390044624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11541058205058417073.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,1.58487,38448,5147,25,51738,279,542,127022,36,624,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(!(E((((i2.i0.u35.p118==1)&&(i12.u71.p272==1))&&(i2.i0.u88.p384==1)) U (i14.i1.u65.p239==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(!(E((((i2.i0.u35.p118==1)&&(i12.u71.p272==1))&&(i2.i0.u88.p384==1)) U (i14....186
Reverse transition relation is NOT exact ! Due to transitions t106, t156, t189, t193, t196, t200, t202, t203, t204, t207, t212, t214, t215, i0.i0.u40.t99, ...802
(forward)formula 0,1,10.791,258480,1,0,504050,279,3508,777445,166,734,1165279
FORMULA BusinessProcesses-PT-08-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (complete) has 597 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 282 transition count 202
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 244 transition count 199
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 241 transition count 199
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 83 place count 241 transition count 142
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 208 place count 173 transition count 142
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 226 place count 155 transition count 124
Iterating global reduction 3 with 18 rules applied. Total rules applied 244 place count 155 transition count 124
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 382 place count 85 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 85 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 384 place count 84 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 83 transition count 54
Applied a total of 385 rules in 28 ms. Remains 83 /284 variables (removed 201) and now considering 54/242 (removed 188) transitions.
// Phase 1: matrix 54 rows 83 cols
[2025-05-29 22:47:20] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:20] [INFO ] Implicit Places using invariants in 98 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/284 places, 54/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 129 ms. Remains : 82/284 places, 54/242 transitions.
[2025-05-29 22:47:20] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:20] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:20] [INFO ] Input system was already deterministic with 54 transitions.
[2025-05-29 22:47:20] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:20] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1534535878625138099.gal : 1 ms
[2025-05-29 22:47:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13044046617340641867.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/CTLFireability1534535878625138099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13044046617340641867.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,544,0.04576,5276,2,540,5,3844,6,0,379,5388,0


Converting to forward existential form...Done !
original formula: EF(!(A(EG((p101==1)) U (((((p73==1)&&(p256==1))&&(p392==1))||(p260==1))||(p51!=1)))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!((((((p73==1)&&(p256==1))&&(p392==1))||(p260==1))||(p51!=1)))) * !((((((p73==1)&&(p256...326
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t19, t20, t22, t23, t28, t31, Intersection with reachable at each step enabled. ...201
Hit Full ! (commute/partial/dont) 25/30/29
(forward)formula 0,1,0.158412,8860,1,0,115,19587,138,58,2599,15738,141
FORMULA BusinessProcesses-PT-08-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Graph (complete) has 597 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 282 transition count 202
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 244 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 242 transition count 200
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 81 place count 242 transition count 141
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 210 place count 172 transition count 141
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 230 place count 152 transition count 121
Iterating global reduction 3 with 20 rules applied. Total rules applied 250 place count 152 transition count 121
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 389 place count 81 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 79 transition count 51
Applied a total of 392 rules in 19 ms. Remains 79 /284 variables (removed 205) and now considering 51/242 (removed 191) transitions.
// Phase 1: matrix 51 rows 79 cols
[2025-05-29 22:47:20] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-29 22:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:21] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 298 ms to find 36 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/284 places, 51/242 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 31 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 29 transition count 37
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 4 with 2 rules applied. Total rules applied 30 place count 28 transition count 36
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 33 place count 28 transition count 36
Applied a total of 33 rules in 6 ms. Remains 28 /43 variables (removed 15) and now considering 36/51 (removed 15) transitions.
// Phase 1: matrix 36 rows 28 cols
[2025-05-29 22:47:21] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:21] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-29 22:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 22:47:21] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/284 places, 36/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 427 ms. Remains : 28/284 places, 36/242 transitions.
[2025-05-29 22:47:21] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:21] [INFO ] Flatten gal took : 1 ms
[2025-05-29 22:47:21] [INFO ] Input system was already deterministic with 36 transitions.
[2025-05-29 22:47:21] [INFO ] Flatten gal took : 2 ms
[2025-05-29 22:47:21] [INFO ] Flatten gal took : 1 ms
[2025-05-29 22:47:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14833463028458391982.gal : 0 ms
RANDOM walk for 2279 steps (175 resets) in 8 ms. (253 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 22:47:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4121873378732175351.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14833463028458391982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4121873378732175351.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4121873378732175351.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 14
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 242/242 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 264 transition count 222
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 264 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 259 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 259 transition count 217
Applied a total of 50 rules in 22 ms. Remains 259 /284 variables (removed 25) and now considering 217/242 (removed 25) transitions.
// Phase 1: matrix 217 rows 259 cols
[2025-05-29 22:47:21] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:21] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-29 22:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:21] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-29 22:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:26] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:26] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:27] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:28] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:28] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:28] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:28] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:29] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:29] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:29] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:29] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:29] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:30] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:31] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:34] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/476 variables, 259/331 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:41] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:41] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:41] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:41] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:43] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:43] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:49] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 338 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/476 variables, 259/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 216/553 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:59] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:01] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:11] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:12] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 60049ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 259/284 places, 217/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 259/284 places, 217/242 transitions.
[2025-05-29 22:48:22] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:48:22] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:48:22] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-29 22:48:22] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:48:22] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10408297240285324011.gal : 2 ms
[2025-05-29 22:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5712269878552032274.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/CTLFireability10408297240285324011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5712269878552032274.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,2.17415e+17,10.5877,218932,2,43181,5,453369,6,0,1253,1.41302e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:48:52] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:48:52] [INFO ] Applying decomposition
[2025-05-29 22:48:52] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17032113099487031185.txt' '-o' '/tmp/graph17032113099487031185.bin' '-w' '/tmp/graph17032113099487031185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17032113099487031185.bin' '-l' '-1' '-v' '-w' '/tmp/graph17032113099487031185.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:48:52] [INFO ] Decomposing Gal with order
[2025-05-29 22:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:48:52] [INFO ] Removed a total of 89 redundant transitions.
[2025-05-29 22:48:52] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2025-05-29 22:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9582593219266162878.gal : 5 ms
[2025-05-29 22:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1502131992093911668.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/CTLFireability9582593219266162878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1502131992093911668.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17415e+17,2.34887,58136,6283,25,82340,291,534,205083,36,648,0


Converting to forward existential form...Done !
original formula: !(A((!(E(((((i12.i0.u23.p73==1)&&(i11.u67.p256==1))&&(i19.i1.u74.p392==1))||(i3.u7.p16==1)) U AG((i18.u45.p158==1)))) + EX(!(EX((((i6.u20...231
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,!((i15.u48.p166==1))) * !((i15.u48.p166==1))) * !(EX(!(EX((((i6.u20.p61==1)&&(i13.i1.u63.p23...362
Reverse transition relation is NOT exact ! Due to transitions t106, t156, t189, t193, t196, t200, t202, t204, t207, t212, t214, t215, i0.i0.u73.t28, i0.i1....810
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,14.8553,358424,1,0,686823,334,3937,1.0634e+06,195,921,1529202
FORMULA BusinessProcesses-PT-08-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-05-29 22:49:07] [INFO ] Flatten gal took : 7 ms
[2025-05-29 22:49:07] [INFO ] Flatten gal took : 6 ms
[2025-05-29 22:49:07] [INFO ] Applying decomposition
[2025-05-29 22:49:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2507209473279729447.txt' '-o' '/tmp/graph2507209473279729447.bin' '-w' '/tmp/graph2507209473279729447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2507209473279729447.bin' '-l' '-1' '-v' '-w' '/tmp/graph2507209473279729447.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:49:07] [INFO ] Decomposing Gal with order
[2025-05-29 22:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:49:07] [INFO ] Removed a total of 82 redundant transitions.
[2025-05-29 22:49:07] [INFO ] Flatten gal took : 16 ms
[2025-05-29 22:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-29 22:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6243646977105924022.gal : 4 ms
[2025-05-29 22:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3347964891375179567.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/CTLFireability6243646977105924022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3347964891375179567.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.6091e+17,1.57944,37384,6476,46,51718,376,668,129740,54,1210,0


Converting to forward existential form...Done !
original formula: !(E(EX(((!((((i12.i1.u59.p205==1)||(i14.i0.u63.p218==1))&&(i13.u49.p165==1))) + !(E((i17.u96.p356==1) U (i3.i0.u99.p373==1)))) + (AG((i5....354
=> equivalent forward existential formula: [FwdG(FwdU(Init,EX(((!((((i12.i1.u59.p205==1)||(i14.i0.u63.p218==1))&&(i13.u49.p165==1))) + !(E((i17.u96.p356==1...430
Reverse transition relation is NOT exact ! Due to transitions t122, t180, t218, t227, t229, t232, t237, i0.i0.u82.t36, i0.i1.u39.t118, i0.i2.u41.t115, i1.u...1098
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,1360.34,4228528,1,0,5.28066e+06,376,1644,1.26576e+07,106,1210,2307344
FORMULA BusinessProcesses-PT-08-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2025-05-29 23:13:20] [INFO ] Applying decomposition
[2025-05-29 23:13:20] [INFO ] Flatten gal took : 6 ms
[2025-05-29 23:13:20] [INFO ] Decomposing Gal with order
[2025-05-29 23:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:13:20] [INFO ] Removed a total of 17 redundant transitions.
[2025-05-29 23:13:20] [INFO ] Flatten gal took : 16 ms
[2025-05-29 23:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 38 ms.
[2025-05-29 23:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16127366970499061368.gal : 7 ms
[2025-05-29 23:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12468100523641461345.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/CTLFireability16127366970499061368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12468100523641461345.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.6091e+17,234.937,4890328,43096,618,2.36057e+06,1521,931,6.09094e+07,296,6205,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r030-smll-174853813200058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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