Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422800461.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 JoinFreeModules-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422800461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748847304514

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 06:55:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 06:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:55:06] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2025-06-02 06:55:06] [INFO ] Transformed 2501 places.
[2025-06-02 06:55:06] [INFO ] Transformed 4001 transitions.
[2025-06-02 06:55:06] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4001 rows 2500 cols
[2025-06-02 06:55:06] [INFO ] Computed 500 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 10280 steps (2 resets) in 279 ms. (36 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 3417 ms. (46 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 06:55:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:10] [INFO ] [Real]Absence check using 500 positive place invariants in 114 ms returned sat
[2025-06-02 06:55:12] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2025-06-02 06:55:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:12] [INFO ] [Nat]Absence check using 500 positive place invariants in 120 ms returned sat
[2025-06-02 06:55:14] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2025-06-02 06:55:14] [INFO ] State equation strengthened by 500 read => feed constraints.
[2025-06-02 06:55:14] [INFO ] [Nat]Added 500 Read/Feed constraints in 250 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:15] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:16] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:17] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 27 ms to minimize.
[2025-06-02 06:55:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:17] [INFO ] [Real]Absence check using 500 positive place invariants in 105 ms returned sat
[2025-06-02 06:55:18] [INFO ] [Real]Absence check using state equation in 1207 ms returned sat
[2025-06-02 06:55:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:19] [INFO ] [Nat]Absence check using 500 positive place invariants in 119 ms returned sat
[2025-06-02 06:55:21] [INFO ] [Nat]Absence check using state equation in 2253 ms returned sat
[2025-06-02 06:55:22] [INFO ] [Nat]Added 500 Read/Feed constraints in 380 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:22] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:23] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:23] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:24] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:24] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 19 ms to minimize.
[2025-06-02 06:55:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:24] [INFO ] [Real]Absence check using 500 positive place invariants in 111 ms returned sat
[2025-06-02 06:55:26] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2025-06-02 06:55:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:26] [INFO ] [Nat]Absence check using 500 positive place invariants in 116 ms returned sat
[2025-06-02 06:55:29] [INFO ] [Nat]Absence check using state equation in 2871 ms returned sat
[2025-06-02 06:55:29] [INFO ] [Nat]Added 500 Read/Feed constraints in 240 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:30] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:31] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 16 ms to minimize.
[2025-06-02 06:55:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:31] [INFO ] [Real]Absence check using 500 positive place invariants in 116 ms returned sat
[2025-06-02 06:55:32] [INFO ] [Real]Absence check using state equation in 1188 ms returned sat
[2025-06-02 06:55:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2025-06-02 06:55:35] [INFO ] [Nat]Absence check using state equation in 2124 ms returned sat
[2025-06-02 06:55:36] [INFO ] [Nat]Added 500 Read/Feed constraints in 534 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:36] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:36] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:37] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:38] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 19 ms to minimize.
[2025-06-02 06:55:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:38] [INFO ] [Real]Absence check using 500 positive place invariants in 104 ms returned sat
[2025-06-02 06:55:39] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2025-06-02 06:55:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:40] [INFO ] [Nat]Absence check using 500 positive place invariants in 109 ms returned sat
[2025-06-02 06:55:42] [INFO ] [Nat]Absence check using state equation in 2180 ms returned sat
[2025-06-02 06:55:42] [INFO ] [Nat]Added 500 Read/Feed constraints in 392 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:43] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:43] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:44] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:45] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 18 ms to minimize.
[2025-06-02 06:55:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:45] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2025-06-02 06:55:46] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2025-06-02 06:55:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:47] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2025-06-02 06:55:49] [INFO ] [Nat]Absence check using state equation in 2278 ms returned sat
[2025-06-02 06:55:49] [INFO ] [Nat]Added 500 Read/Feed constraints in 368 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:50] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:51] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:51] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:51] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 18 ms to minimize.
[2025-06-02 06:55:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:52] [INFO ] [Real]Absence check using 500 positive place invariants in 111 ms returned sat
[2025-06-02 06:55:53] [INFO ] [Real]Absence check using state equation in 1179 ms returned sat
[2025-06-02 06:55:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:54] [INFO ] [Nat]Absence check using 500 positive place invariants in 110 ms returned sat
[2025-06-02 06:55:55] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2025-06-02 06:55:55] [INFO ] [Nat]Added 500 Read/Feed constraints in 266 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 3 places in 346 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:56] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:57] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:57] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:57] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:58] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:55:58] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 24 ms to minimize.
[2025-06-02 06:55:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:55:59] [INFO ] [Real]Absence check using 500 positive place invariants in 107 ms returned sat
[2025-06-02 06:56:00] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2025-06-02 06:56:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:01] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:03] [INFO ] [Nat]Absence check using state equation in 2140 ms returned sat
[2025-06-02 06:56:03] [INFO ] [Nat]Added 500 Read/Feed constraints in 501 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:04] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:05] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 18 ms to minimize.
[2025-06-02 06:56:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:06] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2025-06-02 06:56:07] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2025-06-02 06:56:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:07] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2025-06-02 06:56:10] [INFO ] [Nat]Absence check using state equation in 2145 ms returned sat
[2025-06-02 06:56:10] [INFO ] [Nat]Added 500 Read/Feed constraints in 391 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:10] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:11] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:11] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:11] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:12] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:12] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 17 ms to minimize.
[2025-06-02 06:56:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:12] [INFO ] [Real]Absence check using 500 positive place invariants in 105 ms returned sat
[2025-06-02 06:56:14] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2025-06-02 06:56:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:14] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2025-06-02 06:56:16] [INFO ] [Nat]Absence check using state equation in 2106 ms returned sat
[2025-06-02 06:56:17] [INFO ] [Nat]Added 500 Read/Feed constraints in 495 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:17] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:18] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:19] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 17 ms to minimize.
[2025-06-02 06:56:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:19] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2025-06-02 06:56:20] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2025-06-02 06:56:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:21] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:23] [INFO ] [Nat]Absence check using state equation in 2123 ms returned sat
[2025-06-02 06:56:24] [INFO ] [Nat]Added 500 Read/Feed constraints in 436 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:24] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:24] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:25] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:26] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:29] [INFO ] Deduced a trap composed of 3 places in 3206 ms of which 940 ms to minimize.
[2025-06-02 06:56:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:29] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2025-06-02 06:56:30] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2025-06-02 06:56:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:31] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:33] [INFO ] [Nat]Absence check using state equation in 2214 ms returned sat
[2025-06-02 06:56:34] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 06:56:34] [INFO ] [Nat]Added 500 Read/Feed constraints in 622 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:34] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:34] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:35] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:36] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 16 ms to minimize.
[2025-06-02 06:56:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:36] [INFO ] [Real]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:37] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2025-06-02 06:56:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:38] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:39] [INFO ] [Nat]Absence check using state equation in 1696 ms returned sat
[2025-06-02 06:56:40] [INFO ] [Nat]Added 500 Read/Feed constraints in 357 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:40] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:41] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:42] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:43] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 21 ms to minimize.
[2025-06-02 06:56:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:43] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2025-06-02 06:56:44] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2025-06-02 06:56:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:45] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2025-06-02 06:56:47] [INFO ] [Nat]Absence check using state equation in 2212 ms returned sat
[2025-06-02 06:56:47] [INFO ] [Nat]Added 500 Read/Feed constraints in 455 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:48] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:49] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 18 ms to minimize.
[2025-06-02 06:56:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:50] [INFO ] [Real]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-02 06:56:51] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2025-06-02 06:56:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:52] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2025-06-02 06:56:54] [INFO ] [Nat]Absence check using state equation in 2258 ms returned sat
[2025-06-02 06:56:54] [INFO ] [Nat]Added 500 Read/Feed constraints in 363 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:54] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:55] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:56:56] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 20 ms to minimize.
[2025-06-02 06:56:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:57] [INFO ] [Real]Absence check using 500 positive place invariants in 113 ms returned sat
[2025-06-02 06:56:58] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2025-06-02 06:56:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:56:59] [INFO ] [Nat]Absence check using 500 positive place invariants in 116 ms returned sat
[2025-06-02 06:57:01] [INFO ] [Nat]Absence check using state equation in 2242 ms returned sat
[2025-06-02 06:57:01] [INFO ] [Nat]Added 500 Read/Feed constraints in 501 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:02] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:03] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 18 ms to minimize.
[2025-06-02 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1822 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.6 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions (Output transitions of discarded places.) removed 3872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 38 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-02 06:57:33] [INFO ] Computed 16 invariants in 1 ms
[2025-06-02 06:57:33] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8301 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11122ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 11132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11183 ms. Remains : 80/2500 places, 128/4001 transitions.
[2025-06-02 06:57:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000178 steps (2 resets) in 1050 ms. (951 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 17910 ms. (893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[475, 501, 501, 501, 491, 482, 497, 500, 501, 495, 501, 501, 500, 501, 483, 486] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 06:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:58:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:58:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:58:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 30 ms returned sat
[2025-06-02 06:58:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:04] [INFO ] Added : 58 causal constraints over 13 iterations in 138 ms. Result :sat
Minimization took 63 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:04] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:58:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 150 ms returned sat
[2025-06-02 06:58:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:04] [INFO ] Added : 63 causal constraints over 15 iterations in 180 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:04] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:58:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:58:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 06:58:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:58:05] [INFO ] Added : 77 causal constraints over 16 iterations in 135 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-02 06:58:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 102 ms returned sat
[2025-06-02 06:58:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-02 06:58:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2025-06-02 06:58:05] [INFO ] Added : 73 causal constraints over 16 iterations in 302 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:58:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:58:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 06:58:05] [INFO ] Added : 51 causal constraints over 11 iterations in 92 ms. Result :sat
Minimization took 41 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 42 ms returned sat
[2025-06-02 06:58:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:58:06] [INFO ] Added : 59 causal constraints over 13 iterations in 115 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:58:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 114 ms returned sat
[2025-06-02 06:58:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:06] [INFO ] Added : 44 causal constraints over 9 iterations in 80 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:06] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 168 ms returned sat
[2025-06-02 06:58:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:07] [INFO ] Added : 41 causal constraints over 9 iterations in 170 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:07] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:58:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 78 ms returned sat
[2025-06-02 06:58:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:58:07] [INFO ] Added : 58 causal constraints over 12 iterations in 192 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:58:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:58:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:58:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:58:07] [INFO ] Added : 64 causal constraints over 14 iterations in 119 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 132 ms returned sat
[2025-06-02 06:58:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:58:08] [INFO ] Added : 58 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:58:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 131 ms returned sat
[2025-06-02 06:58:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:58:08] [INFO ] Added : 52 causal constraints over 12 iterations in 170 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:08] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:58:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 115 ms returned sat
[2025-06-02 06:58:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:09] [INFO ] Added : 40 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:58:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 169 ms returned sat
[2025-06-02 06:58:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:58:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-02 06:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 06:58:09] [INFO ] Added : 47 causal constraints over 10 iterations in 208 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:58:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:58:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 132 ms returned sat
[2025-06-02 06:58:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:58:10] [INFO ] Added : 62 causal constraints over 13 iterations in 275 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:58:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:58:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:58:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:58:10] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-02 06:58:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 95 ms returned sat
[2025-06-02 06:58:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:58:10] [INFO ] Added : 46 causal constraints over 12 iterations in 153 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[475, 501, 501, 501, 491, 482, 497, 500, 501, 495, 501, 501, 500, 501, 483, 486] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 06:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:58:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 06:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:58:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:58:50] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:58:50] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-02 06:58:50] [INFO ] Invariant cache hit.
[2025-06-02 06:58:50] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2771 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 10268 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13056ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13162 ms. Remains : 80/80 places, 128/128 transitions.
[2025-06-02 06:59:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000138 steps (2 resets) in 957 ms. (1043 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 18089 ms. (884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 06:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:22] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:59:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:22] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-06-02 06:59:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 06:59:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 269 ms returned sat
[2025-06-02 06:59:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:59:23] [INFO ] Added : 60 causal constraints over 15 iterations in 147 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:23] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:23] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:59:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:59:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 151 ms returned sat
[2025-06-02 06:59:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:23] [INFO ] Added : 63 causal constraints over 15 iterations in 172 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:23] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-02 06:59:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2025-06-02 06:59:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 06:59:24] [INFO ] Added : 77 causal constraints over 16 iterations in 138 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 06:59:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 94 ms returned sat
[2025-06-02 06:59:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-02 06:59:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2025-06-02 06:59:24] [INFO ] Added : 73 causal constraints over 16 iterations in 306 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:24] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:59:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:59:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:59:25] [INFO ] Added : 52 causal constraints over 13 iterations in 102 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:25] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 79 ms returned sat
[2025-06-02 06:59:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 06:59:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:59:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 115 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2025-06-02 06:59:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:25] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 06:59:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 167 ms returned sat
[2025-06-02 06:59:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:26] [INFO ] Added : 41 causal constraints over 9 iterations in 162 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:26] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 06:59:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 79 ms returned sat
[2025-06-02 06:59:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:26] [INFO ] Added : 58 causal constraints over 12 iterations in 192 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:59:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 77 ms returned sat
[2025-06-02 06:59:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:27] [INFO ] Added : 38 causal constraints over 9 iterations in 76 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2025-06-02 06:59:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:27] [INFO ] Added : 78 causal constraints over 18 iterations in 280 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:59:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 06:59:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 136 ms returned sat
[2025-06-02 06:59:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:28] [INFO ] Added : 52 causal constraints over 12 iterations in 178 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:28] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:59:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 115 ms returned sat
[2025-06-02 06:59:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 06:59:28] [INFO ] Added : 40 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:28] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 06:59:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 169 ms returned sat
[2025-06-02 06:59:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:59:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-02 06:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-02 06:59:29] [INFO ] Added : 47 causal constraints over 10 iterations in 199 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:29] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:59:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 06:59:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 06:59:29] [INFO ] Added : 57 causal constraints over 13 iterations in 112 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:29] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 06:59:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 06:59:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 06:59:29] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2025-06-02 06:59:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 173 ms returned sat
[2025-06-02 06:59:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 06:59:30] [INFO ] Added : 21 causal constraints over 6 iterations in 123 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 502, 502, 503, 503, 503, 503, 503, 503, 503, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-06 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-05 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2025-06-02 07:00:04] [INFO ] Computed 14 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000136 steps (2 resets) in 869 ms. (1149 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 14067 ms. (995 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 07:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 07:00:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 07:00:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 48 ms returned sat
[2025-06-02 07:00:19] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 07:00:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-02 07:00:19] [INFO ] Added : 36 causal constraints over 8 iterations in 196 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:00:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:00:19] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 07:00:19] [INFO ] Added : 26 causal constraints over 7 iterations in 122 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:00:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 07:00:20] [INFO ] Added : 41 causal constraints over 9 iterations in 186 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:00:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 130 ms returned sat
[2025-06-02 07:00:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:00:20] [INFO ] Added : 34 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 108 ms returned sat
[2025-06-02 07:00:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 07:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
Minimization took 12 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 109 ms returned sat
[2025-06-02 07:00:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:00:21] [INFO ] Added : 29 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:00:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 07:00:21] [INFO ] Added : 40 causal constraints over 9 iterations in 291 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 07:00:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 87 ms returned sat
[2025-06-02 07:00:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:00:21] [INFO ] Added : 28 causal constraints over 6 iterations in 49 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 233 ms returned sat
[2025-06-02 07:00:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:00:22] [INFO ] Added : 27 causal constraints over 8 iterations in 126 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 192 ms returned sat
[2025-06-02 07:00:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:00:22] [INFO ] Added : 32 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 07:00:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Nat]Added 14 Read/Feed constraints in 129 ms returned sat
[2025-06-02 07:00:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:00:23] [INFO ] Added : 22 causal constraints over 5 iterations in 89 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:00:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:00:23] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-02 07:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2025-06-02 07:00:23] [INFO ] Added : 41 causal constraints over 9 iterations in 254 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:00:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-06-02 07:00:23] [INFO ] [Nat]Added 14 Read/Feed constraints in 44 ms returned sat
[2025-06-02 07:00:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:00:23] [INFO ] Added : 27 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:24] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-02 07:00:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:00:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-02 07:00:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:00:24] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:00:24] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 07:00:24] [INFO ] Added : 34 causal constraints over 7 iterations in 229 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 502, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 502, 503, 503, 503, 503, 503, 503, 503, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-04 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 13 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 65 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /70 variables (removed 5) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 65/70 places, 104/112 transitions.
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:00:49] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000007 steps (2 resets) in 817 ms. (1222 steps per ms)
BEST_FIRST walk for 13000012 steps (26 resets) in 12361 ms. (1051 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 07:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:02] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-02 07:01:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:01:02] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2025-06-02 07:01:02] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:01:02] [INFO ] Added : 53 causal constraints over 12 iterations in 106 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:02] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:02] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 07:01:02] [INFO ] [Nat]Added 13 Read/Feed constraints in 110 ms returned sat
[2025-06-02 07:01:02] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:02] [INFO ] Added : 46 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:01:03] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 07:01:03] [INFO ] Added : 66 causal constraints over 14 iterations in 151 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:01:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2025-06-02 07:01:03] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:03] [INFO ] Added : 37 causal constraints over 10 iterations in 74 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 90 ms returned sat
[2025-06-02 07:01:03] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:03] [INFO ] Added : 62 causal constraints over 13 iterations in 94 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 90 ms returned sat
[2025-06-02 07:01:04] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:04] [INFO ] Added : 56 causal constraints over 12 iterations in 93 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 110 ms returned sat
[2025-06-02 07:01:04] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:01:04] [INFO ] Added : 30 causal constraints over 7 iterations in 84 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 133 ms returned sat
[2025-06-02 07:01:05] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:05] [INFO ] Added : 53 causal constraints over 12 iterations in 131 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:05] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:01:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 109 ms returned sat
[2025-06-02 07:01:05] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:01:05] [INFO ] Added : 49 causal constraints over 12 iterations in 219 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:05] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 197 ms returned sat
[2025-06-02 07:01:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:06] [INFO ] Added : 62 causal constraints over 14 iterations in 104 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 89 ms returned sat
[2025-06-02 07:01:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 07:01:06] [INFO ] Added : 68 causal constraints over 14 iterations in 108 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-02 07:01:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-02 07:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-06-02 07:01:06] [INFO ] Added : 59 causal constraints over 15 iterations in 177 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:01:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:07] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:01:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 206 ms returned sat
[2025-06-02 07:01:07] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2025-06-02 07:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 07:01:07] [INFO ] Added : 61 causal constraints over 14 iterations in 152 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 502, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-02 07:01:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 07:01:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:01:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:01:31] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-02 07:01:31] [INFO ] Invariant cache hit.
[2025-06-02 07:01:31] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6987 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8968ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9061 ms. Remains : 65/65 places, 104/104 transitions.
[2025-06-02 07:01:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 502, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000065 steps (2 resets) in 815 ms. (1225 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 12338 ms. (1053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 502, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-02 07:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:01:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-02 07:01:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:01:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 73 ms returned sat
[2025-06-02 07:01:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:53] [INFO ] Added : 53 causal constraints over 12 iterations in 85 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 07:01:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 113 ms returned sat
[2025-06-02 07:01:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:01:53] [INFO ] Added : 46 causal constraints over 10 iterations in 74 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:01:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:01:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 07:01:54] [INFO ] Added : 66 causal constraints over 14 iterations in 148 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2025-06-02 07:01:54] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 07:01:54] [INFO ] Added : 37 causal constraints over 10 iterations in 70 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:01:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 91 ms returned sat
[2025-06-02 07:01:54] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:54] [INFO ] Added : 62 causal constraints over 13 iterations in 93 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:01:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 90 ms returned sat
[2025-06-02 07:01:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:01:55] [INFO ] Added : 56 causal constraints over 12 iterations in 97 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:55] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:01:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 109 ms returned sat
[2025-06-02 07:01:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:01:55] [INFO ] Added : 30 causal constraints over 7 iterations in 83 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:55] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:01:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 133 ms returned sat
[2025-06-02 07:01:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:01:55] [INFO ] Added : 53 causal constraints over 12 iterations in 144 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:56] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:01:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 109 ms returned sat
[2025-06-02 07:01:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 07:01:56] [INFO ] Added : 49 causal constraints over 12 iterations in 230 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:56] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 197 ms returned sat
[2025-06-02 07:01:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:01:56] [INFO ] Added : 62 causal constraints over 14 iterations in 102 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 89 ms returned sat
[2025-06-02 07:01:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:01:57] [INFO ] Added : 68 causal constraints over 14 iterations in 117 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:01:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-02 07:01:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 07:01:57] [INFO ] Added : 39 causal constraints over 11 iterations in 108 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:01:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:01:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:01:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 194 ms returned sat
[2025-06-02 07:01:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:01:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 07:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-02 07:01:58] [INFO ] Added : 61 causal constraints over 14 iterations in 140 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 502, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 502, 501, 500, 501, 502, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-02 07:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 07:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:02:21] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:02:21] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-02 07:02:21] [INFO ] Invariant cache hit.
[2025-06-02 07:02:21] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 78 unsolved in 7123 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9058ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 9059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9156 ms. Remains : 65/65 places, 104/104 transitions.
RANDOM walk for 41372 steps (8 resets) in 89 ms. (459 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
[2025-06-02 07:02:31] [INFO ] Flatten gal took : 28 ms
[2025-06-02 07:02:31] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:02:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8735204990003880582.gal : 5 ms
[2025-06-02 07:02:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3827407694608824119.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8735204990003880582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3827407694608824119.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3827407694608824119.prop.
SDD proceeding with computation,26 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,26 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,26 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,26 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,26 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,26 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,26 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 152781 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 26
Probabilistic random walk after 152781 steps, saw 144274 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-02 07:02:33] [INFO ] Invariant cache hit.
[2025-06-02 07:02:33] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap 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-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap 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-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MIN11 is UNSAT
Problem MAX12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 12/25 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 104/169 variables, 65/90 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 13/103 constraints. Problems are: Problem set: 13 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/103 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/103 constraints. Problems are: Problem set: 13 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 103 constraints, problems are : Problem set: 13 solved, 13 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 11/23 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/23 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 96/156 variables, 60/83 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 12/95 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 13/108 constraints. Problems are: Problem set: 13 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/169 variables, and 108 constraints, problems are : Problem set: 13 solved, 13 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 60/65 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 13/26 constraints, Known Traps: 11/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5737ms problems are : Problem set: 13 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 60 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 60 /65 variables (removed 5) and now considering 96/104 (removed 8) transitions.
Running 72 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 60 cols
[2025-06-02 07:02:39] [INFO ] Computed 12 invariants in 0 ms
[2025-06-02 07:02:39] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
SDD proceeding with computation,26 properties remain. new max is 512
SDD size :11747 after 45400
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 84 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 12/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 158 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5660 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7054ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7059 ms. Remains : 60/65 places, 96/104 transitions.
RANDOM walk for 40513 steps (8 resets) in 63 ms. (633 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 213198 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 13
Probabilistic random walk after 213198 steps, saw 197976 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2025-06-02 07:02:50] [INFO ] Invariant cache hit.
[2025-06-02 07:02:50] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 96/156 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 84 constraints, problems are : Problem set: 0 solved, 13 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 96/156 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:52] [INFO ] Deduced a trap 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-06-02 07:02:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:02:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 105 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5125 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 60/60 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5320ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 12419 ms.
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 55 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 55 /60 variables (removed 5) and now considering 88/96 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/60 places, 88/96 transitions.
RANDOM walk for 40808 steps (8 resets) in 41 ms. (971 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 238363 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 11
Probabilistic random walk after 238363 steps, saw 218872 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 88 rows 55 cols
[2025-06-02 07:03:11] [INFO ] Computed 11 invariants in 0 ms
[2025-06-02 07:03:11] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 44/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 77 constraints, problems are : Problem set: 0 solved, 11 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 44/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Detected timeout of ITS tools.
[2025-06-02 07:03:21] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:03:21] [INFO ] Applying decomposition
[2025-06-02 07:03:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2172985993289262618.txt' '-o' '/tmp/graph2172985993289262618.bin' '-w' '/tmp/graph2172985993289262618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2172985993289262618.bin' '-l' '-1' '-v' '-w' '/tmp/graph2172985993289262618.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:03:21] [INFO ] Decomposing Gal with order
[2025-06-02 07:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:03:21] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:03:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1287494675203317284.gal : 2 ms
[2025-06-02 07:03:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9871048809209142301.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1287494675203317284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9871048809209142301.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9871048809209142301.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :851 after 3104
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :3104 after 11747
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 93 constraints, problems are : Problem set: 0 solved, 11 unsolved in 12285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12453ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :11747 after 45400
Parikh walk visited 2 properties in 27594 ms.
Support contains 9 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 45 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 5 ms. Remains 45 /55 variables (removed 10) and now considering 72/88 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 45/55 places, 72/88 transitions.
RANDOM walk for 40385 steps (8 resets) in 30 ms. (1302 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 211575 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 9
Probabilistic random walk after 211575 steps, saw 190557 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 72 rows 45 cols
[2025-06-02 07:03:54] [INFO ] Computed 9 invariants in 0 ms
[2025-06-02 07:03:54] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 36/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/117 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/117 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 63 constraints, problems are : Problem set: 0 solved, 9 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 36/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:03:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 75 constraints, problems are : Problem set: 0 solved, 9 unsolved in 10420 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10547ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
Parikh walk visited 1 properties in 8226 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /45 variables (removed 5) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/45 places, 64/72 transitions.
FORMULA JoinFreeModules-PT-0500-UpperBounds-14 502 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0500-UpperBounds-10 503 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 501, 500, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:04:13] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10209 steps (2 resets) in 7 ms. (1276 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[112] Max Struct:[503]
[2025-06-02 07:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:04:13] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:04:13] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:04:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:04:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:04:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-02 07:04:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:04:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2025-06-02 07:04:13] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2025-06-02 07:04:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2025-06-02 07:04:13] [INFO ] Added : 52 causal constraints over 11 iterations in 165 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[112] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:04:15] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:04:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:04:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000018 steps (2 resets) in 132 ms. (7518 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 443 ms. (2252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:04:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:04:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 07:04:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:04:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:04:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:04:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:04:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-02 07:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-02 07:04:16] [INFO ] Added : 4 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 07:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:04:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:04:16] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:04:16] [INFO ] Invariant cache hit.
[2025-06-02 07:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:04:16] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 40386 steps (8 resets) in 12 ms. (3106 steps per ms) remains 2/2 properties
[2025-06-02 07:04:16] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:04:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12063421901161962033.gal : 0 ms
[2025-06-02 07:04:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality540548724944636065.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12063421901161962033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality540548724944636065.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality540548724944636065.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1501999 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 2
Probabilistic random walk after 1501999 steps, saw 504401 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2025-06-02 07:04:19] [INFO ] Invariant cache hit.
[2025-06-02 07:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:04:20] [INFO ] Invariant cache hit.
[2025-06-02 07:04:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40178 steps (8 resets) in 11 ms. (3348 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3656460 steps, run timeout after 3001 ms. (steps per millisecond=1218 ) properties seen :0 out of 1
Probabilistic random walk after 3656460 steps, saw 1268187 distinct states, run finished after 3001 ms. (steps per millisecond=1218 ) properties seen :0
[2025-06-02 07:04:23] [INFO ] Invariant cache hit.
[2025-06-02 07:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 07:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:04:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:04:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:04:23] [INFO ] Invariant cache hit.
[2025-06-02 07:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:04:23] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:04:23] [INFO ] Applying decomposition
[2025-06-02 07:04:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6115560710580119273.txt' '-o' '/tmp/graph6115560710580119273.bin' '-w' '/tmp/graph6115560710580119273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6115560710580119273.bin' '-l' '-1' '-v' '-w' '/tmp/graph6115560710580119273.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:04:23] [INFO ] Decomposing Gal with order
[2025-06-02 07:04:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:04:23] [INFO ] Flatten gal took : 56 ms
[2025-06-02 07:04:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 07:04:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15671072149390795082.gal : 0 ms
[2025-06-02 07:04:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1272195863661041763.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15671072149390795082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1272195863661041763.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1272195863661041763.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9461 after 22822
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.72402e+07 after 5.72403e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00 in 60596 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:05:13] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10237 steps (2 resets) in 7 ms. (1279 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:05:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:05:13] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:05:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:05:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:05:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:05:13] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 07:05:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:05:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 109 ms returned sat
[2025-06-02 07:05:14] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:05:14] [INFO ] Added : 46 causal constraints over 10 iterations in 79 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:05:15] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:05:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000181 steps (2 resets) in 127 ms. (7813 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 561 ms. (1779 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:05:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:05:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:05:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:05:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:05:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:05:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:05:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 07:05:16] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 07:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:05:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:05:16] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:05:16] [INFO ] Invariant cache hit.
[2025-06-02 07:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:05:16] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:05:16] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:05:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8669977778847316893.gal : 1 ms
[2025-06-02 07:05:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1784346126664079825.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8669977778847316893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1784346126664079825.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40201 steps (8 resets) in 38 ms. (1030 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1784346126664079825.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1703008 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :0 out of 2
Probabilistic random walk after 1703008 steps, saw 577343 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
[2025-06-02 07:05:19] [INFO ] Invariant cache hit.
[2025-06-02 07:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:05:20] [INFO ] Invariant cache hit.
[2025-06-02 07:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40151 steps (8 resets) in 15 ms. (2509 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3563177 steps, run timeout after 3001 ms. (steps per millisecond=1187 ) properties seen :0 out of 1
Probabilistic random walk after 3563177 steps, saw 1236150 distinct states, run finished after 3001 ms. (steps per millisecond=1187 ) properties seen :0
[2025-06-02 07:05:23] [INFO ] Invariant cache hit.
[2025-06-02 07:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 07:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:05:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:05:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:05:23] [INFO ] Invariant cache hit.
[2025-06-02 07:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:05:23] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:05:23] [INFO ] Applying decomposition
[2025-06-02 07:05:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3322918404943299696.txt' '-o' '/tmp/graph3322918404943299696.bin' '-w' '/tmp/graph3322918404943299696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3322918404943299696.bin' '-l' '-1' '-v' '-w' '/tmp/graph3322918404943299696.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:05:23] [INFO ] Decomposing Gal with order
[2025-06-02 07:05:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:05:23] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:05:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:05:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14760541624288670900.gal : 0 ms
[2025-06-02 07:05:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7338953460254088678.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14760541624288670900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7338953460254088678.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7338953460254088678.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :18384 after 19371
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38113 after 84808
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84808 after 160583
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :160583 after 177288
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :177288 after 282041
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :282041 after 302551
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :302551 after 453352
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :639162 after 890461
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.34414e+06 after 1.8051e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01 in 60178 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:06:13] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10141 steps (2 resets) in 11 ms. (845 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[121] Max Struct:[503]
[2025-06-02 07:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:06:13] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:06:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:06:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:06:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:06:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:06:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:06:13] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 07:06:14] [INFO ] Added : 71 causal constraints over 15 iterations in 106 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[121] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:06:15] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:06:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000056 steps (2 resets) in 129 ms. (7692 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:06:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:06:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:06:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:06:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:06:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:06:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:06:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 07:06:16] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 07:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:06:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:06:16] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:06:16] [INFO ] Invariant cache hit.
[2025-06-02 07:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:06:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000042 steps (2 resets) in 129 ms. (7692 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:06:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:06:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:06:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:06:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:06:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:06:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 07:06:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 07:06:17] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 07:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:06:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:06:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:06:17] [INFO ] Invariant cache hit.
[2025-06-02 07:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:06:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:06:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:06:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12037549210807777495.gal : 1 ms
[2025-06-02 07:06:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10645353554881141565.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12037549210807777495.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10645353554881141565.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10645353554881141565.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
RANDOM walk for 40217 steps (8 resets) in 22 ms. (1748 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1417525 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 2
Probabilistic random walk after 1417525 steps, saw 473908 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2025-06-02 07:06:20] [INFO ] Invariant cache hit.
[2025-06-02 07:06:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:06:20] [INFO ] Invariant cache hit.
[2025-06-02 07:06:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40262 steps (8 resets) in 15 ms. (2516 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3526718 steps, run timeout after 3001 ms. (steps per millisecond=1175 ) properties seen :0 out of 1
Probabilistic random walk after 3526718 steps, saw 1223533 distinct states, run finished after 3001 ms. (steps per millisecond=1175 ) properties seen :0
[2025-06-02 07:06:24] [INFO ] Invariant cache hit.
[2025-06-02 07:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 07:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:06:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:06:24] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:06:24] [INFO ] Invariant cache hit.
[2025-06-02 07:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:06:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:06:24] [INFO ] Applying decomposition
[2025-06-02 07:06:24] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7186242289082637163.txt' '-o' '/tmp/graph7186242289082637163.bin' '-w' '/tmp/graph7186242289082637163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7186242289082637163.bin' '-l' '-1' '-v' '-w' '/tmp/graph7186242289082637163.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:06:24] [INFO ] Decomposing Gal with order
[2025-06-02 07:06:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:06:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:06:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:06:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13685764589033780859.gal : 1 ms
[2025-06-02 07:06:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5380573664406397101.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13685764589033780859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5380573664406397101.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5380573664406397101.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9467 after 20359
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.237e+07 after 6.77555e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02 in 60670 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:07:14] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10047 steps (2 resets) in 8 ms. (1116 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:07:14] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:07:14] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:07:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:07:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:07:14] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-02 07:07:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:07:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-02 07:07:14] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:07:14] [INFO ] Added : 37 causal constraints over 10 iterations in 68 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:07:16] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:07:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:07:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000011 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 516 ms. (1934 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:07:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:07:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:07:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:07:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:07:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:07:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:07:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 07:07:17] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 07:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:07:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:07:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:07:17] [INFO ] Invariant cache hit.
[2025-06-02 07:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:07:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:07:17] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40091 steps (8 resets) in 12 ms. (3083 steps per ms) remains 2/2 properties
[2025-06-02 07:07:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10878188573253144750.gal : 1 ms
[2025-06-02 07:07:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8371346900704651201.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10878188573253144750.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8371346900704651201.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8371346900704651201.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1078412 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 2
Probabilistic random walk after 1078412 steps, saw 419608 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
[2025-06-02 07:07:20] [INFO ] Invariant cache hit.
[2025-06-02 07:07:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:07:20] [INFO ] Invariant cache hit.
[2025-06-02 07:07:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40086 steps (8 resets) in 15 ms. (2505 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3554210 steps, run timeout after 3001 ms. (steps per millisecond=1184 ) properties seen :0 out of 1
Probabilistic random walk after 3554210 steps, saw 1232981 distinct states, run finished after 3001 ms. (steps per millisecond=1184 ) properties seen :0
[2025-06-02 07:07:23] [INFO ] Invariant cache hit.
[2025-06-02 07:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:07:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 07:07:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:07:24] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:07:24] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:07:24] [INFO ] Invariant cache hit.
[2025-06-02 07:07:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:07:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:07:24] [INFO ] Applying decomposition
[2025-06-02 07:07:24] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph248271307305136394.txt' '-o' '/tmp/graph248271307305136394.bin' '-w' '/tmp/graph248271307305136394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph248271307305136394.bin' '-l' '-1' '-v' '-w' '/tmp/graph248271307305136394.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:07:24] [INFO ] Decomposing Gal with order
[2025-06-02 07:07:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:07:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:07:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:07:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16182534323636687063.gal : 0 ms
[2025-06-02 07:07:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality486341385136774568.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16182534323636687063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality486341385136774568.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality486341385136774568.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18382
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 84787
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84787 after 162556
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :162556 after 181263
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :181263 after 286914
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :286914 after 306485
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :306485 after 455796
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :455796 after 639161
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.34608e+06 after 1.80801e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-03 in 59875 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:08:14] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10075 steps (2 resets) in 7 ms. (1259 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-02 07:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:08:14] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:08:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:08:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:08:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:08:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 07:08:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:08:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 92 ms returned sat
[2025-06-02 07:08:14] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 07:08:14] [INFO ] Added : 62 causal constraints over 13 iterations in 95 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:08:16] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:08:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000066 steps (2 resets) in 130 ms. (7634 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 415 ms. (2403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-02 07:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:08:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:08:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:08:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:08:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:08:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:08:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:08:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:08:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-02 07:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2025-06-02 07:08:17] [INFO ] Added : 5 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:08:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 07:08:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:08:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:08:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:08:17] [INFO ] Invariant cache hit.
[2025-06-02 07:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:08:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:08:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:08:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7920703098815254530.gal : 0 ms
[2025-06-02 07:08:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2503275304433019512.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7920703098815254530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2503275304433019512.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40377 steps (8 resets) in 11 ms. (3364 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2503275304433019512.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1418988 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 2
Probabilistic random walk after 1418988 steps, saw 474464 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2025-06-02 07:08:20] [INFO ] Invariant cache hit.
[2025-06-02 07:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:08:20] [INFO ] Invariant cache hit.
[2025-06-02 07:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40262 steps (8 resets) in 14 ms. (2684 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3629724 steps, run timeout after 3001 ms. (steps per millisecond=1209 ) properties seen :0 out of 1
Probabilistic random walk after 3629724 steps, saw 1259085 distinct states, run finished after 3001 ms. (steps per millisecond=1209 ) properties seen :0
[2025-06-02 07:08:23] [INFO ] Invariant cache hit.
[2025-06-02 07:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:08:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:23] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 07:08:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:08:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:08:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:08:23] [INFO ] Invariant cache hit.
[2025-06-02 07:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:08:24] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:08:24] [INFO ] Applying decomposition
[2025-06-02 07:08:24] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15876445051745642851.txt' '-o' '/tmp/graph15876445051745642851.bin' '-w' '/tmp/graph15876445051745642851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15876445051745642851.bin' '-l' '-1' '-v' '-w' '/tmp/graph15876445051745642851.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:08:24] [INFO ] Decomposing Gal with order
[2025-06-02 07:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:08:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:08:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6521636722956239163.gal : 0 ms
[2025-06-02 07:08:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8272678864288027421.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6521636722956239163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8272678864288027421.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8272678864288027421.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18382
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40567 after 99973
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :99973 after 103445
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :103445 after 103475
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :103475 after 173904
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :173904 after 292293
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :292293 after 462142
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :462142 after 646453
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.37456e+06 after 1.37991e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07 in 59695 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:09:14] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10297 steps (2 resets) in 6 ms. (1471 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[298] Max Struct:[503]
[2025-06-02 07:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:09:14] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:09:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:09:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:09:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:09:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:09:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:09:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 90 ms returned sat
[2025-06-02 07:09:14] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:09:14] [INFO ] Added : 53 causal constraints over 11 iterations in 84 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[298] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:09:16] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:09:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:09:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000092 steps (2 resets) in 134 ms. (7408 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:09:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:09:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:09:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:09:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:09:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:09:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:09:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-02 07:09:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 07:09:16] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 07:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:09:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:09:17] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:09:17] [INFO ] Invariant cache hit.
[2025-06-02 07:09:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:09:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:09:17] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:09:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13455138754222815061.gal : 0 ms
[2025-06-02 07:09:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17612869422985756530.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13455138754222815061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17612869422985756530.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17612869422985756530.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
RANDOM walk for 40239 steps (8 resets) in 24 ms. (1609 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1355289 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 2
Probabilistic random walk after 1355289 steps, saw 451183 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2025-06-02 07:09:20] [INFO ] Invariant cache hit.
[2025-06-02 07:09:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:09:20] [INFO ] Invariant cache hit.
[2025-06-02 07:09:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40291 steps (8 resets) in 11 ms. (3357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3595714 steps, run timeout after 3001 ms. (steps per millisecond=1198 ) properties seen :0 out of 1
Probabilistic random walk after 3595714 steps, saw 1247158 distinct states, run finished after 3001 ms. (steps per millisecond=1198 ) properties seen :0
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
[2025-06-02 07:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:23] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:09:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:09:23] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:09:23] [INFO ] Invariant cache hit.
[2025-06-02 07:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:09:23] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:09:23] [INFO ] Applying decomposition
[2025-06-02 07:09:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9879097808893624113.txt' '-o' '/tmp/graph9879097808893624113.bin' '-w' '/tmp/graph9879097808893624113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9879097808893624113.bin' '-l' '-1' '-v' '-w' '/tmp/graph9879097808893624113.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:09:23] [INFO ] Decomposing Gal with order
[2025-06-02 07:09:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:09:23] [INFO ] Flatten gal took : 2 ms
[2025-06-02 07:09:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:09:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6424923482536437664.gal : 0 ms
[2025-06-02 07:09:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11842756906696044251.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6424923482536437664.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11842756906696044251.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11842756906696044251.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18379
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40572 after 87253
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :87253 after 164032
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :164032 after 182697
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :182697 after 182740
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :182740 after 292286
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :292286 after 461048
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :461048 after 643531
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.35662e+06 after 1.81626e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08 in 59907 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:10:14] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250] Max Struct:[503]
[2025-06-02 07:10:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:10:14] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-02 07:10:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 07:10:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:10:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:10:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:10:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:10:14] [INFO ] [Nat]Added 13 Read/Feed constraints in 90 ms returned sat
[2025-06-02 07:10:14] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 2 ms to minimize.
[2025-06-02 07:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2025-06-02 07:10:14] [INFO ] Added : 65 causal constraints over 14 iterations in 183 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[250] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[502] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:10:16] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:10:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[502] Max Struct:[503]
RANDOM walk for 1000085 steps (2 resets) in 126 ms. (7874 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[502] Max Struct:[503]
[2025-06-02 07:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:10:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:10:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:10:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:10:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:10:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:10:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-02 07:10:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
Current structural bounds on expressions (after SMT) : Max Seen:[502] Max Struct:[502]
FORMULA JoinFreeModules-PT-0500-UpperBounds-09 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-02 07:10:17] [INFO ] Flatten gal took : 2 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 07:10:17] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:10:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5510458396452980105.gal : 0 ms
[2025-06-02 07:10:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16502734606901301772.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5510458396452980105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16502734606901301772.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-09 in 3301 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:10:17] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10084 steps (2 resets) in 7 ms. (1260 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:10:17] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:10:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 07:10:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:10:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:10:17] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 07:10:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:10:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 116 ms returned sat
[2025-06-02 07:10:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:10:17] [INFO ] Added : 49 causal constraints over 12 iterations in 232 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:10:19] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:10:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:10:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000050 steps (2 resets) in 126 ms. (7874 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:10:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:10:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:10:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:10:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:10:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:10:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:10:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 07:10:20] [INFO ] Added : 6 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 07:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:10:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:10:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:10:20] [INFO ] Invariant cache hit.
[2025-06-02 07:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:10:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:10:20] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:10:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4281057683156912410.gal : 0 ms
[2025-06-02 07:10:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9057719009335639481.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4281057683156912410.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9057719009335639481.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9057719009335639481.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
RANDOM walk for 40102 steps (8 resets) in 28 ms. (1382 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1444528 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :0 out of 2
Probabilistic random walk after 1444528 steps, saw 483848 distinct states, run finished after 3001 ms. (steps per millisecond=481 ) properties seen :0
[2025-06-02 07:10:23] [INFO ] Invariant cache hit.
[2025-06-02 07:10:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:10:23] [INFO ] Invariant cache hit.
[2025-06-02 07:10:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40689 steps (8 resets) in 17 ms. (2260 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3531748 steps, run timeout after 3001 ms. (steps per millisecond=1176 ) properties seen :0 out of 1
Probabilistic random walk after 3531748 steps, saw 1225273 distinct states, run finished after 3001 ms. (steps per millisecond=1176 ) properties seen :0
[2025-06-02 07:10:27] [INFO ] Invariant cache hit.
[2025-06-02 07:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:10:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 07:10:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:10:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:10:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:10:27] [INFO ] Invariant cache hit.
[2025-06-02 07:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:10:27] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:10:27] [INFO ] Applying decomposition
[2025-06-02 07:10:27] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5343098340884236681.txt' '-o' '/tmp/graph5343098340884236681.bin' '-w' '/tmp/graph5343098340884236681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5343098340884236681.bin' '-l' '-1' '-v' '-w' '/tmp/graph5343098340884236681.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:10:27] [INFO ] Decomposing Gal with order
[2025-06-02 07:10:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:10:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 07:10:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:10:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8808763178552284617.gal : 0 ms
[2025-06-02 07:10:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8390039417940704984.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8808763178552284617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8390039417940704984.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8390039417940704984.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40572 after 99075
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :99075 after 102036
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :102036 after 171909
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :171909 after 183732
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :183732 after 292306
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :292306 after 461080
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :643542 after 952061
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.37318e+06 after 1.81627e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-11 in 60156 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:11:17] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10008 steps (2 resets) in 7 ms. (1251 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-02 07:11:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:11:17] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 07:11:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:11:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:11:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:11:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 07:11:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:11:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 200 ms returned sat
[2025-06-02 07:11:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:11:17] [INFO ] Added : 62 causal constraints over 14 iterations in 115 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:11:19] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:11:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:11:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000003 steps (2 resets) in 133 ms. (7462 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-02 07:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:11:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:11:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:11:20] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 07:11:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:11:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 07:11:20] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-02 07:11:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 07:11:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
[2025-06-02 07:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2025-06-02 07:11:20] [INFO ] Added : 5 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:20] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 07:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:11:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:11:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:11:20] [INFO ] Invariant cache hit.
[2025-06-02 07:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:11:20] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:11:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:11:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1525837209336050927.gal : 1 ms
[2025-06-02 07:11:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12148094001207582047.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1525837209336050927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12148094001207582047.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12148094001207582047.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
RANDOM walk for 40096 steps (8 resets) in 22 ms. (1743 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1452206 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 2
Probabilistic random walk after 1452206 steps, saw 486692 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
[2025-06-02 07:11:23] [INFO ] Invariant cache hit.
[2025-06-02 07:11:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:11:23] [INFO ] Invariant cache hit.
[2025-06-02 07:11:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40180 steps (8 resets) in 10 ms. (3652 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3564796 steps, run timeout after 3001 ms. (steps per millisecond=1187 ) properties seen :0 out of 1
Probabilistic random walk after 3564796 steps, saw 1236736 distinct states, run finished after 3001 ms. (steps per millisecond=1187 ) properties seen :0
[2025-06-02 07:11:26] [INFO ] Invariant cache hit.
[2025-06-02 07:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:11:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 07:11:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:11:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:11:26] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:11:26] [INFO ] Invariant cache hit.
[2025-06-02 07:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:11:27] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:11:27] [INFO ] Applying decomposition
[2025-06-02 07:11:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17560586220265681437.txt' '-o' '/tmp/graph17560586220265681437.bin' '-w' '/tmp/graph17560586220265681437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17560586220265681437.bin' '-l' '-1' '-v' '-w' '/tmp/graph17560586220265681437.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:11:27] [INFO ] Decomposing Gal with order
[2025-06-02 07:11:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:11:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:11:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 07:11:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6918570957495424073.gal : 0 ms
[2025-06-02 07:11:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13025183346203595039.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6918570957495424073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13025183346203595039.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13025183346203595039.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9467 after 20359
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.237e+07 after 6.77555e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-12 in 59728 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:12:17] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10460 steps (2 resets) in 7 ms. (1307 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:12:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:12:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 07:12:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:12:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 07:12:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 07:12:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:12:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 94 ms returned sat
[2025-06-02 07:12:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 07:12:17] [INFO ] Added : 68 causal constraints over 14 iterations in 104 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:12:19] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 07:12:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:12:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000092 steps (2 resets) in 127 ms. (7813 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:12:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:12:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:12:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:12:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:12:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 07:12:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:12:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 07:12:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 07:12:20] [INFO ] Added : 6 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 07:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:12:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:12:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:12:20] [INFO ] Invariant cache hit.
[2025-06-02 07:12:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:12:20] [INFO ] Flatten gal took : 0 ms
[2025-06-02 07:12:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:12:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9495163492578441727.gal : 1 ms
[2025-06-02 07:12:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3587060097459004407.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9495163492578441727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3587060097459004407.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3587060097459004407.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
RANDOM walk for 40217 steps (8 resets) in 17 ms. (2234 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1084837 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 2
Probabilistic random walk after 1084837 steps, saw 421878 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
[2025-06-02 07:12:23] [INFO ] Invariant cache hit.
[2025-06-02 07:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:12:23] [INFO ] Invariant cache hit.
[2025-06-02 07:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40307 steps (8 resets) in 14 ms. (2687 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3044590 steps, run timeout after 3001 ms. (steps per millisecond=1014 ) properties seen :0 out of 1
Probabilistic random walk after 3044590 steps, saw 1055155 distinct states, run finished after 3001 ms. (steps per millisecond=1014 ) properties seen :0
[2025-06-02 07:12:26] [INFO ] Invariant cache hit.
[2025-06-02 07:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 07:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:12:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:12:26] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:12:26] [INFO ] Invariant cache hit.
[2025-06-02 07:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:12:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:12:27] [INFO ] Applying decomposition
[2025-06-02 07:12:27] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9499276894217662857.txt' '-o' '/tmp/graph9499276894217662857.bin' '-w' '/tmp/graph9499276894217662857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9499276894217662857.bin' '-l' '-1' '-v' '-w' '/tmp/graph9499276894217662857.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:12:27] [INFO ] Decomposing Gal with order
[2025-06-02 07:12:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:12:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:12:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:12:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6084969233795815504.gal : 1 ms
[2025-06-02 07:12:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6601458781047276894.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6084969233795815504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6601458781047276894.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6601458781047276894.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18380
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 97571
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97571 after 101996
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :101996 after 172415
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :172415 after 183254
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :183254 after 286973
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286973 after 456823
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :456823 after 642141
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.36409e+06 after 1.80802e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-13 in 59928 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 104 rows 65 cols
[2025-06-02 07:13:17] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10084 steps (2 resets) in 12 ms. (775 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250] Max Struct:[503]
[2025-06-02 07:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:13:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:13:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 07:13:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:13:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 07:13:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 07:13:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 07:13:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-02 07:13:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2025-06-02 07:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-02 07:13:17] [INFO ] Added : 60 causal constraints over 13 iterations in 145 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[250] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 07:13:19] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 07:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-02 07:13:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000001 steps (2 resets) in 135 ms. (7352 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 421 ms. (2369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-02 07:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:13:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:13:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 07:13:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:13:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 07:13:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 07:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:13:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 07:13:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-02 07:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-02 07:13:20] [INFO ] Added : 4 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 07:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:13:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:13:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:13:20] [INFO ] Invariant cache hit.
[2025-06-02 07:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 07:13:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:13:20] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:13:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16290717341957332185.gal : 0 ms
[2025-06-02 07:13:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10697537885545780643.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16290717341957332185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10697537885545780643.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10697537885545780643.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
RANDOM walk for 40178 steps (8 resets) in 15 ms. (2511 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1035801 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 2
Probabilistic random walk after 1035801 steps, saw 403766 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2025-06-02 07:13:23] [INFO ] Invariant cache hit.
[2025-06-02 07:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 07:13:23] [INFO ] Invariant cache hit.
[2025-06-02 07:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40300 steps (8 resets) in 14 ms. (2686 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3454745 steps, run timeout after 3001 ms. (steps per millisecond=1151 ) properties seen :0 out of 1
Probabilistic random walk after 3454745 steps, saw 1197896 distinct states, run finished after 3001 ms. (steps per millisecond=1151 ) properties seen :0
[2025-06-02 07:13:27] [INFO ] Invariant cache hit.
[2025-06-02 07:13:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 07:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 07:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 07:13:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:13:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 07:13:27] [INFO ] Invariant cache hit.
[2025-06-02 07:13:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:13:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:13:27] [INFO ] Applying decomposition
[2025-06-02 07:13:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2833486707641117919.txt' '-o' '/tmp/graph2833486707641117919.bin' '-w' '/tmp/graph2833486707641117919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2833486707641117919.bin' '-l' '-1' '-v' '-w' '/tmp/graph2833486707641117919.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:13:27] [INFO ] Decomposing Gal with order
[2025-06-02 07:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:13:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 07:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:13:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1050165930791601024.gal : 1 ms
[2025-06-02 07:13:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6686005148086828415.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1050165930791601024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6686005148086828415.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6686005148086828415.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18383
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38113 after 96615
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96615 after 100546
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :100546 after 170448
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :170448 after 182251
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :182251 after 286945
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286945 after 456725
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :642203 after 942967
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.36416e+06 after 1.80812e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15 in 60332 ms.
[2025-06-02 07:14:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:14:17] [INFO ] Applying decomposition
[2025-06-02 07:14:17] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15112425398539035512.txt' '-o' '/tmp/graph15112425398539035512.bin' '-w' '/tmp/graph15112425398539035512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15112425398539035512.bin' '-l' '-1' '-v' '-w' '/tmp/graph15112425398539035512.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:14:17] [INFO ] Decomposing Gal with order
[2025-06-02 07:14:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:14:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:14:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 07:14:17] [INFO ] Time to serialize gal into /tmp/UpperBounds17044421659130361267.gal : 0 ms
[2025-06-02 07:14:17] [INFO ] Time to serialize properties into /tmp/UpperBounds1752946300255487805.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17044421659130361267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1752946300255487805.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1752946300255487805.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.47376e+122,121.628,1138860,15,3519,43,2.01088e+06,52,0,63,2.38547e+06,0
Total reachable state count : 4.47376239188324141974083838248172351407e+122

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-00 :0 <= u3.p734 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-00 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-00,0,121.742,1138860,1,0,80,2.01088e+06,130,14,578,2.38547e+06,158
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-01 :0 <= u7.p1797 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-01 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-01,0,123.24,1138860,1,0,89,2.01088e+06,158,14,1090,2.38547e+06,181
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-02 :0 <= u1.p337 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-02 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-02,0,123.24,1138860,1,0,102,2.01088e+06,178,14,1090,2.38547e+06,206
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-03 :0 <= u4.p1212 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-03 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-03,0,123.241,1138860,1,0,112,2.01088e+06,197,14,1090,2.38547e+06,225
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-07 :0 <= u8.p2043 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-07 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-07,0,123.923,1138860,1,0,119,2.01088e+06,222,14,1598,2.38547e+06,239
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-08 :0 <= u6.p1727 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-08 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-08,0,123.924,1138860,1,0,127,2.01088e+06,243,14,1598,2.38547e+06,254
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-11 :0 <= u0.p202 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-11 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-11,0,123.924,1138860,1,0,140,2.01088e+06,259,14,1598,2.38547e+06,279
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-12 :0 <= u2.p478 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-12 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-12,0,123.924,1138860,1,0,152,2.01088e+06,276,14,1598,2.38547e+06,302
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-13 :0 <= u12.p2377 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-13 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-13,0,123.924,1138860,1,0,154,2.01088e+06,305,14,1598,2.38547e+06,313
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-15 :0 <= u9.p2094 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-15 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-15,0,123.924,1138860,1,0,159,2.01088e+06,329,14,1598,2.38547e+06,322
Total runtime 1275721 ms.

BK_STOP 1748848581672

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="UpperBounds"
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 JoinFreeModules-PT-0500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422800461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;