Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 59K 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-02-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748544270124

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 18:44:32] [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 18:44:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:44:32] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-05-29 18:44:32] [INFO ] Transformed 262 places.
[2025-05-29 18:44:32] [INFO ] Transformed 219 transitions.
[2025-05-29 18:44:32] [INFO ] Found NUPN structural information;
[2025-05-29 18:44:32] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 212 transition count 177
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 212 transition count 177
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 201 transition count 166
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 201 transition count 166
Applied a total of 82 rules in 85 ms. Remains 201 /245 variables (removed 44) and now considering 166/204 (removed 38) transitions.
// Phase 1: matrix 166 rows 201 cols
[2025-05-29 18:44:32] [INFO ] Computed 37 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:44:33] [INFO ] Implicit Places using invariants in 788 ms returned []
[2025-05-29 18:44:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:44:34] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-05-29 18:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:38] [INFO ] Deduced a trap composed of 9 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 18:44:38] [INFO ] Deduced a trap composed of 10 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 18:44:39] [INFO ] Deduced a trap composed of 11 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 18:44:39] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 14 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 18:44:39] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:39] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [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 18:44:40] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:40] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:41] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:41] [INFO ] Deduced a trap composed of 15 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 18:44:41] [INFO ] Deduced a trap composed of 19 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 18:44:41] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:42] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:42] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:42] [INFO ] Deduced a trap composed of 15 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 18:44:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:43] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:45] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:45] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:45] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:45] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:45] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 166/367 variables, 201/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:50] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:55] [INFO ] Deduced a trap along path composed of 7 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:56] [INFO ] Deduced a trap along path composed of 7 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:59] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:03] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:03] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/367 variables, and 280 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:05] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:05] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 166/367 variables, 201/281 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 165/446 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:09] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:10] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:24] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 165 unsolved
SMT process timed out in 60181ms, After SMT, problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 201/245 places, 166/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61844 ms. Remains : 201/245 places, 166/204 transitions.
Support contains 36 out of 201 places after structural reductions.
[2025-05-29 18:45:34] [INFO ] Flatten gal took : 88 ms
[2025-05-29 18:45:35] [INFO ] Flatten gal took : 36 ms
[2025-05-29 18:45:35] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 31 out of 201 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (540 resets) in 1802 ms. (22 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40003 steps (102 resets) in 325 ms. (122 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (96 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (104 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (100 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (112 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (105 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (100 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (104 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
[2025-05-29 18:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 74/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 59/144 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 33/177 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 144/321 variables, 177/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 9 (OVERLAPS) 33/354 variables, 15/229 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 8/237 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:37] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 27 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 18:45:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 14/251 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/252 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/367 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/367 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 255 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3751 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/76 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 66/142 variables, 13/26 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 33/175 variables, 13/45 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 4/49 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 143/318 variables, 175/224 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 3/227 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 2/229 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:40] [INFO ] Deduced a trap along path composed of 3 places in 212 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:40] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 2/231 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 34/352 variables, 16/247 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 4/251 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 3/254 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:40] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/352 variables, 1/256 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:41] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/352 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 13/365 variables, 9/266 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/365 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 2/367 variables, 1/267 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/367 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/367 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 267 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 6925ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 1739 ms.
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 166/166 transitions.
Graph (trivial) has 96 edges and 201 vertex of which 6 / 201 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 385 edges and 196 vertex of which 191 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 191 transition count 127
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 164 transition count 126
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 56 place count 164 transition count 90
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 135 place count 121 transition count 90
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 116 transition count 85
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 116 transition count 85
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 243 place count 66 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 66 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 65 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 65 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 64 transition count 35
Applied a total of 247 rules in 64 ms. Remains 64 /201 variables (removed 137) and now considering 35/166 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 64/201 places, 35/166 transitions.
RANDOM walk for 498 steps (19 resets) in 7 ms. (62 steps per ms) remains 0/5 properties
FORMULA BusinessProcesses-PT-02-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 194 stabilizing places and 157 stable transitions
Graph (complete) has 392 edges and 201 vertex of which 196 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Graph (trivial) has 102 edges and 201 vertex of which 6 / 201 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 386 edges and 196 vertex of which 191 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 190 transition count 125
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 161 transition count 125
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 60 place count 161 transition count 87
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 144 place count 115 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 108 transition count 80
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 108 transition count 80
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 252 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 254 place count 58 transition count 33
Applied a total of 254 rules in 52 ms. Remains 58 /201 variables (removed 143) and now considering 33/166 (removed 133) transitions.
// Phase 1: matrix 33 rows 58 cols
[2025-05-29 18:45:45] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:45] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 18:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:45] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 36, 38, 40, 42]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 306 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/201 places, 33/166 transitions.
Graph (complete) has 107 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 40 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 37 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 36 transition count 28
Applied a total of 10 rules in 28 ms. Remains 36 /43 variables (removed 7) and now considering 28/33 (removed 5) transitions.
// Phase 1: matrix 28 rows 36 cols
[2025-05-29 18:45:45] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:45] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 18:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/201 places, 28/166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 593 ms. Remains : 36/201 places, 28/166 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-01 finished in 988 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 U X(X(p1))))||G(p0)))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 32 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:45:46] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-29 18:45:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:47] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:45:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:51] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:52] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:53] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:54] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:55] [INFO ] Deduced a trap composed of 19 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 18:45:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:55] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:56] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:56] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:56] [INFO ] Deduced a trap composed of 15 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 18:45:56] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:58] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:58] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:58] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:59] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:59] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:59] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:00] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:01] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:01] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:02] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:02] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:04] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:05] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:10] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:10] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:10] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:25] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:25] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:31] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:33] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:33] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:33] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:34] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:39] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61053 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), p1, p1, true, (AND p1 (NOT p0)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-03
Entered a terminal (fully accepting) state of product in 37 steps with 5 reset in 2 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-03 finished in 61555 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) U X((X(p1)||F(p2)))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 194 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 194 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 190 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 190 transition count 155
Applied a total of 22 rules in 30 ms. Remains 190 /201 variables (removed 11) and now considering 155/166 (removed 11) transitions.
// Phase 1: matrix 155 rows 190 cols
[2025-05-29 18:46:47] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:46:48] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 18:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:46:48] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-05-29 18:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:52] [INFO ] Deduced a trap composed of 11 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 18:46:52] [INFO ] Deduced a trap composed of 12 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 18:46:53] [INFO ] Deduced a trap composed of 13 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 18:46:53] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 17 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 18:46:53] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:54] [INFO ] Deduced a trap composed of 16 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 18:46:54] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:55] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 21 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 18:46:56] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:56] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:57] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:57] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/345 variables, 190/256 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:01] [INFO ] Deduced a trap composed of 11 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 18:47:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:02] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 264 constraints, problems are : Problem set: 0 solved, 154 unsolved in 20794 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:11] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:11] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:11] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:11] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:12] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 155/345 variables, 190/269 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/423 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:26] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:34] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 154 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50838ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 50840ms
Starting structural reductions in LTL mode, iteration 1 : 190/201 places, 155/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51573 ms. Remains : 190/201 places, 155/166 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 8 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 52041 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((p0||X((X(X(X(X(p1)))) U (p0&&X(X(X(X(p1))))))))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 26 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:47:40] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:47:40] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-29 18:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:47:40] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 10 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 18:47:45] [INFO ] Deduced a trap composed of 11 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 18:47:45] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:45] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 11 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 18:47:46] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:48] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:50] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:51] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:52] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:52] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:54] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:58] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:59] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:04] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:04] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:04] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:17] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:17] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:18] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:18] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:24] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:27] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:27] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:27] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:28] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 79968 steps with 10031 reset in 257 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-05 finished in 61360 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Graph (trivial) has 102 edges and 201 vertex of which 6 / 201 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 386 edges and 196 vertex of which 191 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 190 transition count 126
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 162 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 161 transition count 125
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 60 place count 161 transition count 88
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 141 place count 117 transition count 88
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 110 transition count 81
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 110 transition count 81
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 253 place count 60 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 59 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 58 transition count 32
Applied a total of 255 rules in 46 ms. Remains 58 /201 variables (removed 143) and now considering 32/166 (removed 134) transitions.
// Phase 1: matrix 32 rows 58 cols
[2025-05-29 18:48:41] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:41] [INFO ] Implicit Places using invariants in 129 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/201 places, 32/166 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 57/201 places, 32/166 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-06
Product exploration explored 100000 steps with 30259 reset in 222 ms.
Product exploration explored 100000 steps with 30036 reset in 419 ms.
Computed a total of 57 stabilizing places and 31 stable transitions
Computed a total of 57 stabilizing places and 31 stable transitions
Detected a total of 57/57 stabilizing places and 31/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 891 steps (330 resets) in 11 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2025-05-29 18:48:42] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-29 18:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:42] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 224 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/57 places, 32/32 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 6 place count 30 transition count 26
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 25 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 22 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 22 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 26 place count 17 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 16 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 16 transition count 17
Applied a total of 29 rules in 8 ms. Remains 16 /32 variables (removed 16) and now considering 17/32 (removed 15) transitions.
// Phase 1: matrix 17 rows 16 cols
[2025-05-29 18:48:42] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-29 18:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:42] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/57 places, 17/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 16/57 places, 17/32 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/16 stabilizing places and 16/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 623 steps (244 resets) in 7 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33060 reset in 82 ms.
Product exploration explored 100000 steps with 33001 reset in 89 ms.
Built C files in :
/tmp/ltsmin18177087686490707978
[2025-05-29 18:48:43] [INFO ] Computing symmetric may disable matrix : 17 transitions.
[2025-05-29 18:48:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:48:43] [INFO ] Computing symmetric may enable matrix : 17 transitions.
[2025-05-29 18:48:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:48:43] [INFO ] Computing Do-Not-Accords matrix : 17 transitions.
[2025-05-29 18:48:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:48:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18177087686490707978
Running compilation step : cd /tmp/ltsmin18177087686490707978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin18177087686490707978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin18177087686490707978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2414982391620322628.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-02-LTLFireability-06 finished in 2794 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) U ((X(p0)&&(p1||F(p2)))||X(G(p0)))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 195 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 195 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 191 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 191 transition count 156
Applied a total of 20 rules in 15 ms. Remains 191 /201 variables (removed 10) and now considering 156/166 (removed 10) transitions.
// Phase 1: matrix 156 rows 191 cols
[2025-05-29 18:48:44] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:44] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-29 18:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:48:44] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-05-29 18:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:49] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 16 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 18:48:50] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:50] [INFO ] Deduced a trap composed of 25 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 18:48:50] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:51] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:51] [INFO ] Deduced a trap composed of 16 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 18:48:51] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:51] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:52] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:53] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:53] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:53] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:54] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:54] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:54] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:54] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:56] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:56] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 156/347 variables, 191/259 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:01] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:01] [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 18:49:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:01] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:04] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 8 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/347 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 264 constraints, problems are : Problem set: 0 solved, 155 unsolved in 27709 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:14] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 156/347 variables, 191/265 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 155/420 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:19] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:20] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:20] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:26] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:26] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 4/431 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:34] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 155 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 Int declared 347/347 variables, and 432 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57748ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 57749ms
Starting structural reductions in LTL mode, iteration 1 : 191/201 places, 156/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58459 ms. Remains : 191/201 places, 156/166 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 184 stabilizing places and 147 stable transitions
Graph (complete) has 378 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 184 stabilizing places and 147 stable transitions
Detected a total of 184/191 stabilizing places and 147/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 28 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-07 finished in 59238 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(F(p0)))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 17 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:49:43] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:49:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-29 18:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:49:44] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:48] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:49] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:49] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:49] [INFO ] Deduced a trap composed of 16 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 18:49:49] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:50] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:50] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:50] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:51] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:51] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:51] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:52] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:53] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:53] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:55] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:55] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:55] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:55] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:56] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:56] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:56] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 20 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 18:49:58] [INFO ] Deduced a trap composed of 24 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 18:49:58] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:01] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:02] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:06] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:06] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:07] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:19] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:19] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:21] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:21] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:27] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:30] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:30] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:30] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:31] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:35] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60034ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60036ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60727 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-08
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-08 finished in 60827 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((X(p0)||G(p1))))'
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 9 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
[2025-05-29 18:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:50:44] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-29 18:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:50:44] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 16 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 18:50:49] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:49] [INFO ] Deduced a trap composed of 17 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 18:50:50] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:50] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:50] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:50] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:50] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:51] [INFO ] Deduced a trap composed of 16 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 18:50:52] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:52] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:52] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:53] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:54] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:55] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:56] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:56] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:56] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:57] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:58] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:58] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:50:59] [INFO ] Deduced a trap composed of 30 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 18:50:59] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:01] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:03] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:06] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:07] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 29161 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:20] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:20] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:20] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:21] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:21] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:27] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:30] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:30] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:30] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:31] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:37] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 59196ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 59198ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59740 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 59986 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 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 194 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 194 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 189 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 189 transition count 154
Applied a total of 24 rules in 12 ms. Remains 189 /201 variables (removed 12) and now considering 154/166 (removed 12) transitions.
// Phase 1: matrix 154 rows 189 cols
[2025-05-29 18:51:44] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:51:44] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-29 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:51:44] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-05-29 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:51] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:51] [INFO ] Deduced a trap composed of 20 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 18:51:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:52] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:53] [INFO ] Deduced a trap composed of 17 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 18:51:53] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:54] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:56] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:56] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:56] [INFO ] Deduced a trap composed of 30 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 18:51:56] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:57] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:57] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:58] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:58] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:58] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:51:59] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:00] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:00] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:02] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 154/343 variables, 189/261 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:07] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:07] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:07] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:09] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:09] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/343 variables, and 266 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/266 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/419 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:21] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:21] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:27] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:28] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:30] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 426 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 154/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 189/201 places, 154/166 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 60818 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(F(p0))||(X(p1)&&G(p2)))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 8 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:52:45] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:52:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-29 18:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:52:45] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:52: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/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:49] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:49] [INFO ] Deduced a trap composed of 10 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 18:52:49] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:49] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:49] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:50] [INFO ] Deduced a trap composed of 11 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 18:52:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:51] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:51] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:51] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:52] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:52] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:52] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:53] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:53] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:55] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:55] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:55] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:55] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:56] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:56] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:57] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:57] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:57] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:52:58] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:00] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:01] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:04] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:04] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:04] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 25414 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:16] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:17] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:17] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:22] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:25] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:25] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:25] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:26] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 55457ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 55459ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55942 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 56242 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((F(p0)||G(p1))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 193 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 193 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 188 transition count 153
Applied a total of 26 rules in 12 ms. Remains 188 /201 variables (removed 13) and now considering 153/166 (removed 13) transitions.
[2025-05-29 18:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:53:41] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-29 18:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:53:41] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 11 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 18:53:48] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 16 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 18:53:48] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:49] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:50] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:50] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:50] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 15 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 18:53:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:53] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:53] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:54] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:54] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:54] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:54] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:55] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:00] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:01] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:05] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:05] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:17] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:17] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:18] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:18] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:18] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:25] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:27] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:27] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:27] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:28] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 153/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 188/201 places, 153/166 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 60892 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(F((p1 U (G(p1)||(p1&&G((p2&&F(p3)))))))))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 194 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 194 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 190 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 190 transition count 155
Applied a total of 22 rules in 8 ms. Remains 190 /201 variables (removed 11) and now considering 155/166 (removed 11) transitions.
// Phase 1: matrix 155 rows 190 cols
[2025-05-29 18:54:42] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:54:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-29 18:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:54:42] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-05-29 18:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 17 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 18:54:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:48] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:48] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:48] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:48] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:48] [INFO ] Deduced a trap composed of 16 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 18:54:48] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:49] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:49] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:52] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:52] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/345 variables, 190/256 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:56] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:56] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:56] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 264 constraints, problems are : Problem set: 0 solved, 154 unsolved in 22481 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:07] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:07] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:07] [INFO ] Deduced a trap composed of 18 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 18:55:07] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:07] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 155/345 variables, 190/269 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/423 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:13] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:19] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:20] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:22] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:55:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 433 constraints, problems are : Problem set: 0 solved, 154 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52514ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 52515ms
Starting structural reductions in LTL mode, iteration 1 : 190/201 places, 155/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52992 ms. Remains : 190/201 places, 155/166 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 183 stabilizing places and 146 stable transitions
Graph (complete) has 379 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 183 stabilizing places and 146 stable transitions
Detected a total of 183/190 stabilizing places and 146/155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 29 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-14 finished in 53763 ms.
All properties solved by simple procedures.
Total runtime 663819 ms.

BK_STOP 1748544935947

--------------------
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-02"
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-02, 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-174853813100012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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