Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200060.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200060
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748561800127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-05-29 23:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 23:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:36:43] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-05-29 23:36:43] [INFO ] Transformed 393 places.
[2025-05-29 23:36:43] [INFO ] Transformed 344 transitions.
[2025-05-29 23:36:43] [INFO ] Found NUPN structural information;
[2025-05-29 23:36:43] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 13 places in 13 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 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 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 71 place count 309 transition count 268
Iterating global reduction 1 with 63 rules applied. Total rules applied 134 place count 309 transition count 268
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 168 place count 275 transition count 234
Iterating global reduction 1 with 34 rules applied. Total rules applied 202 place count 275 transition count 234
Applied a total of 202 rules in 178 ms. Remains 275 /380 variables (removed 105) and now considering 234/331 (removed 97) transitions.
// Phase 1: matrix 234 rows 275 cols
[2025-05-29 23:36:43] [INFO ] Computed 50 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:44] [INFO ] Implicit Places using invariants in 729 ms returned []
[2025-05-29 23:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:45] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2025-05-29 23:36:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:53] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:53] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:53] [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 23:36:53] [INFO ] Deduced a trap composed of 15 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 23:36:54] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:54] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:54] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:54] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:54] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:54] [INFO ] Deduced a trap composed of 22 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 23:36:55] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:55] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:55] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:55] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:56] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:56] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:57] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:57] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:57] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:57] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:59] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:36:59] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:00] [INFO ] Deduced a trap composed of 20 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 23:37:00] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:00] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:00] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:00] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:04] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:07] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 234/509 variables, 275/354 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/509 variables, and 354 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/509 variables, 275/354 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 233/587 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:24] [INFO ] Deduced a trap composed of 8 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 23:37:25] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:26] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:26] [INFO ] Deduced a trap composed of 26 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 23:37:26] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:27] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:27] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:27] [INFO ] Deduced a trap composed of 27 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 23:37:28] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:28] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:28] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:28] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:28] [INFO ] Deduced a trap composed of 15 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 23:37:30] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 15/602 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:43] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/509 variables, and 603 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 275/380 places, 234/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62024 ms. Remains : 275/380 places, 234/331 transitions.
Support contains 38 out of 275 places after structural reductions.
[2025-05-29 23:37:46] [INFO ] Flatten gal took : 97 ms
[2025-05-29 23:37:46] [INFO ] Flatten gal took : 42 ms
[2025-05-29 23:37:46] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 36 out of 275 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (336 resets) in 2228 ms. (17 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40001 steps (58 resets) in 260 ms. (153 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31134 steps (48 resets) in 182 ms. (170 steps per ms) remains 0/1 properties
Computed a total of 95 stabilizing places and 91 stable transitions
Graph (complete) has 583 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Graph (trivial) has 147 edges and 275 vertex of which 7 / 275 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 575 edges and 269 vertex of which 268 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 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 38 place count 267 transition count 188
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 231 transition count 188
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 74 place count 231 transition count 134
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 193 place count 166 transition count 134
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 204 place count 155 transition count 123
Iterating global reduction 2 with 11 rules applied. Total rules applied 215 place count 155 transition count 123
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 364 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 77 transition count 49
Applied a total of 366 rules in 106 ms. Remains 77 /275 variables (removed 198) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 77 cols
[2025-05-29 23:37:47] [INFO ] Computed 35 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:47] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-29 23:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:48] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 547 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/275 places, 49/234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 49 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 48 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 48 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 45 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 45 transition count 41
Applied a total of 15 rules in 17 ms. Remains 45 /52 variables (removed 7) and now considering 41/49 (removed 8) transitions.
// Phase 1: matrix 41 rows 45 cols
[2025-05-29 23:37:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-29 23:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:48] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/275 places, 41/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 859 ms. Remains : 45/275 places, 41/234 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-00 finished in 1164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 263 transition count 222
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 263 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 263 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 259 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 259 transition count 217
Applied a total of 33 rules in 16 ms. Remains 259 /275 variables (removed 16) and now considering 217/234 (removed 17) transitions.
// Phase 1: matrix 217 rows 259 cols
[2025-05-29 23:37:48] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:48] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-05-29 23:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:49] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-29 23:37:49] [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 23:37:56] [INFO ] Deduced a trap composed of 12 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 23:37:56] [INFO ] Deduced a trap composed of 13 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 23:37:56] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:56] [INFO ] Deduced a trap composed of 15 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 23:37:56] [INFO ] Deduced a trap composed of 16 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 23:37:56] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:57] [INFO ] Deduced a trap composed of 18 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 23:37:57] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:57] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:57] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:57] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:58] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:58] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:58] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:59] [INFO ] Deduced a trap composed of 18 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 23:37:59] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:59] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:37:59] [INFO ] Deduced a trap composed of 20 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 23:37:59] [INFO ] Deduced a trap composed of 21 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 23:38:00] [INFO ] Deduced a trap composed of 26 places in 105 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 23:38:01] [INFO ] Deduced a trap composed of 28 places in 81 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 23:38:05] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 18 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 23:38:14] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:14] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:14] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:15] [INFO ] Deduced a trap composed of 14 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 23:38:16] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:17] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 337 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30020 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: 0/0 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 23:38:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:29] [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 23:38:29] [INFO ] Deduced a trap composed of 29 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 23:38:31] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:31] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:32] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:32] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 7/560 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 23:38:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 561 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 259/275 places, 217/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61292 ms. Remains : 259/275 places, 217/234 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 19500 steps with 166 reset in 192 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-01 finished in 61751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(X(F((p2&&F(p3)))))&&(p0 U (p1||G(p0)))))))))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 264 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 260 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 260 transition count 218
Applied a total of 31 rules in 23 ms. Remains 260 /275 variables (removed 15) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2025-05-29 23:38:50] [INFO ] Computed 50 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:50] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 23:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:51] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-29 23:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:57] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:57] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:57] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:57] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:58] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:58] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:58] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:58] [INFO ] Deduced a trap composed of 19 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 23:38:58] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:59] [INFO ] Deduced a trap composed of 22 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 23:38:59] [INFO ] Deduced a trap composed of 24 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 23:38:59] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:38:59] [INFO ] Deduced a trap composed of 30 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 23:38:59] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:00] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:00] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:00] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:00] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:01] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:01] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:02] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:02] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/332 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:09] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:09] [INFO ] Deduced a trap composed of 8 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 23:39:09] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:10] [INFO ] Deduced a trap composed of 14 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 23:39:11] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:11] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:12] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:12] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:12] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 9/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 341 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/341 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:29] [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 23:39:30] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:32] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:47] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 563 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 260/275 places, 218/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61034 ms. Remains : 260/275 places, 218/234 transitions.
Stuttering acceptance computed with spot in 510 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-02
Stuttering criterion allowed to conclude after 1498 steps with 15 reset in 14 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-02 finished in 61603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0)) U (G(p1) U G((p2||F(!p0))))))))'
Support contains 7 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 261 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 261 transition count 219
Applied a total of 29 rules in 14 ms. Remains 261 /275 variables (removed 14) and now considering 219/234 (removed 15) transitions.
// Phase 1: matrix 219 rows 261 cols
[2025-05-29 23:39:51] [INFO ] Computed 50 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:52] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-29 23:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:52] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 23:39:52] [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 23:39:58] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:58] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:58] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:59] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:59] [INFO ] Deduced a trap composed of 16 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 23:39:59] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:39:59] [INFO ] Deduced a trap composed of 18 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 23:39:59] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:00] [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 23:40:00] [INFO ] Deduced a trap composed of 22 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 23:40:00] [INFO ] Deduced a trap composed of 24 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 23:40:00] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:00] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:00] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:01] [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 23:40:02] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:02] [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 23:40:02] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:02] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:02] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 7 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 23:40:04] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/71 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 23:40:08] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/333 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 23:40:17] [INFO ] Deduced a trap composed of 8 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 23:40:17] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:17] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:17] [INFO ] Deduced a trap composed of 14 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 23:40:19] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:19] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
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 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 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, 28/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/557 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 23:40:33] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:33] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:33] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:35] [INFO ] Deduced a trap composed of 22 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 23:40:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/562 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 23:40:43] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/563 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 23:40:49] [INFO ] Deduced a trap composed of 28 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 23:40:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:50] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:40:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 567 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms 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/275 places, 219/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61084 ms. Remains : 261/275 places, 219/234 transitions.
Stuttering acceptance computed with spot in 685 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), false, false, (AND (NOT p2) p0), false, false, (AND (NOT p2) p0), p0, (AND p0 (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-03
Stuttering criterion allowed to conclude after 134 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-03 finished in 61813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Graph (trivial) has 146 edges and 275 vertex of which 7 / 275 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 575 edges and 269 vertex of which 268 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 267 transition count 189
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 232 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 231 transition count 188
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 74 place count 231 transition count 135
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 191 place count 167 transition count 135
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 201 place count 157 transition count 125
Iterating global reduction 3 with 10 rules applied. Total rules applied 211 place count 157 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 360 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 361 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 362 place count 79 transition count 51
Applied a total of 362 rules in 58 ms. Remains 79 /275 variables (removed 196) and now considering 51/234 (removed 183) transitions.
// Phase 1: matrix 51 rows 79 cols
[2025-05-29 23:40:53] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:53] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-29 23:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:54] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 440 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/275 places, 51/234 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 56 transition count 46
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 51 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 48 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 48 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 46 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 46 transition count 40
Applied a total of 21 rules in 14 ms. Remains 46 /56 variables (removed 10) and now considering 40/51 (removed 11) transitions.
// Phase 1: matrix 40 rows 46 cols
[2025-05-29 23:40:54] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-29 23:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 23:40:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/275 places, 40/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 672 ms. Remains : 46/275 places, 40/234 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-04 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F(p0))&&(!p0||G(p1)))||G(F(p0)))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 265 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 265 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 265 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 262 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 262 transition count 220
Applied a total of 27 rules in 26 ms. Remains 262 /275 variables (removed 13) and now considering 220/234 (removed 14) transitions.
// Phase 1: matrix 220 rows 262 cols
[2025-05-29 23:40:54] [INFO ] Computed 50 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-29 23:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:55] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-29 23:40:55] [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 23:41:00] [INFO ] Deduced a trap composed of 12 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 23:41:00] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:00] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:01] [INFO ] Deduced a trap composed of 15 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 23:41:01] [INFO ] Deduced a trap composed of 16 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 23:41:01] [INFO ] Deduced a trap composed of 17 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 23:41:01] [INFO ] Deduced a trap composed of 18 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 23:41:01] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:01] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:01] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:02] [INFO ] Deduced a trap composed of 24 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 23:41:02] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:02] [INFO ] Deduced a trap composed of 30 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 23:41:02] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:03] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 6 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 23:41:05] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:05] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:05] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 3/73 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 23:41:08] [INFO ] Deduced a trap composed of 21 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 23:41:09] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/482 variables, 262/337 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 23:41:18] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:19] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:19] [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 23:41:19] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:21] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:21] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 343 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 31/31 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, 31/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/482 variables, 262/343 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 219/562 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 23:41:36] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:36] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:41:36] [INFO ] Deduced a trap composed of 22 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 23:41:37] [INFO ] Deduced a trap composed of 18 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 23:41:37] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 5/567 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 23:41:48] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 568 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30020 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]
After SMT, in 60072ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 262/275 places, 220/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61013 ms. Remains : 262/275 places, 220/234 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-05
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-05 finished in 61220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 264 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 260 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 260 transition count 218
Applied a total of 31 rules in 46 ms. Remains 260 /275 variables (removed 15) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2025-05-29 23:41:55] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:56] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-29 23:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:56] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-29 23:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:02] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:02] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:02] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:03] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:03] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:03] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:03] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:03] [INFO ] Deduced a trap composed of 19 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 23:42:04] [INFO ] Deduced a trap composed of 20 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 23:42:04] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:04] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:04] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:04] [INFO ] Deduced a trap composed of 30 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 23:42:04] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:05] [INFO ] Deduced a trap composed of 26 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 23:42:06] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:06] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:06] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:06] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:06] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:08] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:08] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:08] [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 23:42:08] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/334 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:16] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:16] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:16] [INFO ] Deduced a trap composed of 11 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 23:42:16] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:18] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:18] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 340 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/340 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/557 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:36] [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 23:42:36] [INFO ] Deduced a trap composed of 26 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 23:42:37] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:37] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:37] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:37] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:46] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:46] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:46] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:50] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:42:51] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 568 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 260/275 places, 218/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61080 ms. Remains : 260/275 places, 218/234 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1634 steps with 13 reset in 5 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-07 finished in 61407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Graph (trivial) has 145 edges and 275 vertex of which 7 / 275 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 575 edges and 269 vertex of which 268 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 267 transition count 189
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 232 transition count 189
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 72 place count 232 transition count 135
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 191 place count 167 transition count 135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 202 place count 156 transition count 124
Iterating global reduction 2 with 11 rules applied. Total rules applied 213 place count 156 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 364 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 77 transition count 49
Applied a total of 366 rules in 86 ms. Remains 77 /275 variables (removed 198) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 77 cols
[2025-05-29 23:42:57] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:57] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-29 23:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:58] [INFO ] Implicit Places using invariants and state equation in 546 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 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 37 places :
Implicit Place search using SMT with State Equation took 787 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/275 places, 49/234 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 40 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 33 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 27 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 27 transition count 36
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 27 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 24 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 20 transition count 29
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 41 place count 20 transition count 28
Applied a total of 41 rules in 10 ms. Remains 20 /40 variables (removed 20) and now considering 28/49 (removed 21) transitions.
// Phase 1: matrix 28 rows 20 cols
[2025-05-29 23:42:58] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-29 23:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/275 places, 28/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1017 ms. Remains : 20/275 places, 28/234 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 249 steps with 64 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-08 finished in 1132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 5 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 263 transition count 222
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 263 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 263 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 259 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 259 transition count 217
Applied a total of 33 rules in 19 ms. Remains 259 /275 variables (removed 16) and now considering 217/234 (removed 17) transitions.
// Phase 1: matrix 217 rows 259 cols
[2025-05-29 23:42:58] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:58] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-29 23:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:59] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-29 23:42:59] [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 23:43:05] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:05] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:05] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:05] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:06] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:07] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:07] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:07] [INFO ] Deduced a trap composed of 30 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 23:43:07] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:08] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:08] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:09] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:09] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:09] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:09] [INFO ] Deduced a trap composed of 26 places in 104 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 23:43:11] [INFO ] Deduced a trap composed of 28 places in 71 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 23:43:15] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 16 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 23:43:23] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:24] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:24] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:24] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:26] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:26] [INFO ] Deduced a trap composed of 15 places in 138 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 337 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 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: 0/0 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 23:43:37] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:39] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:39] [INFO ] Deduced a trap composed of 29 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 23:43:40] [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 23:43:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:41] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:43:42] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 7/560 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 23:43:52] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 561 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 259/275 places, 217/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61111 ms. Remains : 259/275 places, 217/234 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-09 finished in 61303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((F(p0) U p1))) U X(X(!p1))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 264 transition count 223
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 264 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 264 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 260 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 260 transition count 218
Applied a total of 31 rules in 19 ms. Remains 260 /275 variables (removed 15) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2025-05-29 23:43:59] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:43:59] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-05-29 23:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:44:00] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-29 23:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:06] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:07] [INFO ] Deduced a trap composed of 13 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 23:44:07] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:07] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:07] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:07] [INFO ] Deduced a trap composed of 17 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 23:44:07] [INFO ] Deduced a trap composed of 18 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 23:44:08] [INFO ] Deduced a trap composed of 19 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 23:44:08] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:08] [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 23:44:08] [INFO ] Deduced a trap composed of 24 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 23:44:08] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:08] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:09] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:10] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:10] [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 23:44:10] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:10] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:10] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:11] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:12] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:12] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:12] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/333 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:17] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:17] [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 23:44:17] [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 23:44:17] [INFO ] Deduced a trap composed of 14 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 23:44:18] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:19] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:26] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 340 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/339 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:35] [INFO ] Deduced a trap composed of 26 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 23:44:35] [INFO ] Deduced a trap composed of 24 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 23:44:35] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:36] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:36] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:37] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:38] [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 23:44:39] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:47] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:44:57] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 566 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 260/275 places, 218/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61119 ms. Remains : 260/275 places, 218/234 transitions.
Stuttering acceptance computed with spot in 221 ms :[p1, false, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 527 ms.
Computed a total of 91 stabilizing places and 87 stable transitions
Graph (complete) has 552 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 91 stabilizing places and 87 stable transitions
Detected a total of 91/260 stabilizing places and 87/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 29 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-10 finished in 62136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 263 transition count 222
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 263 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 263 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 260 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 260 transition count 218
Applied a total of 31 rules in 19 ms. Remains 260 /275 variables (removed 15) and now considering 218/234 (removed 16) transitions.
// Phase 1: matrix 218 rows 260 cols
[2025-05-29 23:45:01] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:45:01] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-29 23:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:45:02] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-29 23:45:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:07] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:07] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:07] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 15 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 23:45:08] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:08] [INFO ] Deduced a trap composed of 24 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 23:45:09] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:09] [INFO ] Deduced a trap composed of 30 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 23:45:09] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:10] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:10] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:10] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:10] [INFO ] Deduced a trap composed of 20 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 23:45:10] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:10] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:12] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:12] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/478 variables, 260/332 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:20] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:20] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:20] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:20] [INFO ] Deduced a trap composed of 14 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 23:45:22] [INFO ] Deduced a trap composed of 11 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 23:45:22] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:31] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)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 478/478 variables, and 339 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/478 variables, 260/338 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 217/555 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:48] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:49] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:49] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:51] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:45:51] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 10/566 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)timeout

(s121 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 567 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 260/275 places, 218/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 260/275 places, 218/234 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-12 finished in 61012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Graph (complete) has 583 edges and 275 vertex of which 274 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 273 transition count 198
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 239 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 237 transition count 196
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 73 place count 237 transition count 140
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 196 place count 170 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 208 place count 158 transition count 128
Iterating global reduction 3 with 12 rules applied. Total rules applied 220 place count 158 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 222 place count 158 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 157 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 151 rules applied. Total rules applied 374 place count 80 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 375 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 377 place count 78 transition count 50
Applied a total of 377 rules in 51 ms. Remains 78 /275 variables (removed 197) and now considering 50/234 (removed 184) transitions.
// Phase 1: matrix 50 rows 78 cols
[2025-05-29 23:46:02] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:02] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 23:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:03] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [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 26 places :
Implicit Place search using SMT with State Equation took 408 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/275 places, 50/234 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 52 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 45 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 39 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 39 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 39 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 36 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 33 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 40 place count 33 transition count 31
Applied a total of 40 rules in 11 ms. Remains 33 /52 variables (removed 19) and now considering 31/50 (removed 19) transitions.
// Phase 1: matrix 31 rows 33 cols
[2025-05-29 23:46:03] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 23:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-05-29 23:46:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 206 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/275 places, 31/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 679 ms. Remains : 23/275 places, 31/234 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-13
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-13 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Graph (trivial) has 144 edges and 275 vertex of which 7 / 275 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 575 edges and 269 vertex of which 268 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 267 transition count 189
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 232 transition count 189
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 72 place count 232 transition count 135
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 191 place count 167 transition count 135
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 200 place count 158 transition count 126
Iterating global reduction 2 with 9 rules applied. Total rules applied 209 place count 158 transition count 126
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 362 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 363 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 364 place count 78 transition count 50
Applied a total of 364 rules in 42 ms. Remains 78 /275 variables (removed 197) and now considering 50/234 (removed 184) transitions.
// Phase 1: matrix 50 rows 78 cols
[2025-05-29 23:46:03] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:03] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-29 23:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:04] [INFO ] Implicit Places using invariants and state equation in 317 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, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 462 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/275 places, 50/234 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 40 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 33 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 27 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 27 transition count 37
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 27 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 24 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 21 transition count 31
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 39 place count 21 transition count 30
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 41 place count 21 transition count 30
Applied a total of 41 rules in 10 ms. Remains 21 /40 variables (removed 19) and now considering 30/50 (removed 20) transitions.
// Phase 1: matrix 30 rows 21 cols
[2025-05-29 23:46:04] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-29 23:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/275 places, 30/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 626 ms. Remains : 21/275 places, 30/234 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-14 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1&&X(!p0)) U (p1&&X(!p0)&&(G(p2)||G(p1))))))'
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 234/234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 265 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 265 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 265 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 261 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 261 transition count 219
Applied a total of 29 rules in 26 ms. Remains 261 /275 variables (removed 14) and now considering 219/234 (removed 15) transitions.
// Phase 1: matrix 219 rows 261 cols
[2025-05-29 23:46:04] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:04] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-29 23:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:46:05] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 23:46:05] [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 23:46:11] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:11] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:12] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:13] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:13] [INFO ] Deduced a trap composed of 22 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 23:46:13] [INFO ] Deduced a trap composed of 24 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 23:46:13] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:13] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:13] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:14] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:15] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:15] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:15] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:15] [INFO ] Deduced a trap composed of 20 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 23:46:15] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 9 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 23:46:17] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:17] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/333 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 23:46:25] [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 23:46:25] [INFO ] Deduced a trap composed of 8 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 23:46:25] [INFO ] Deduced a trap composed of 11 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 23:46:25] [INFO ] Deduced a trap composed of 14 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 23:46:27] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:27] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
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 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 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, 28/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/557 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 23:46:45] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:45] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:47] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 3/560 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 23:46:53] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:46:55] [INFO ] Deduced a trap composed of 24 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 23:46:55] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 3/563 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 23:47:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 564 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 261/275 places, 219/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61216 ms. Remains : 261/275 places, 219/234 transitions.
Stuttering acceptance computed with spot in 550 ms :[true, true, p0, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (NOT p2), false, (NOT p1), false]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 114 steps with 5 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-15 finished in 61804 ms.
All properties solved by simple procedures.
Total runtime 623537 ms.

BK_STOP 1748562426181

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174853813200060"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;