fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876812100196
Last Updated
June 24, 2025

About the Execution of ITS-Tools for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 241687.00 0.00 0.00 FTFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100196.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 NoC3x3-PT-3B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 581K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748821604858

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 23:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 23:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 23:46:46] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2025-06-01 23:46:46] [INFO ] Transformed 2117 places.
[2025-06-01 23:46:46] [INFO ] Transformed 2435 transitions.
[2025-06-01 23:46:46] [INFO ] Found NUPN structural information;
[2025-06-01 23:46:46] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-3B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2112 transition count 2435
Discarding 527 places :
Symmetric choice reduction at 1 with 527 rule applications. Total rules 532 place count 1585 transition count 1908
Iterating global reduction 1 with 527 rules applied. Total rules applied 1059 place count 1585 transition count 1908
Discarding 181 places :
Symmetric choice reduction at 1 with 181 rule applications. Total rules 1240 place count 1404 transition count 1727
Iterating global reduction 1 with 181 rules applied. Total rules applied 1421 place count 1404 transition count 1727
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1424 place count 1404 transition count 1724
Discarding 198 places :
Symmetric choice reduction at 2 with 198 rule applications. Total rules 1622 place count 1206 transition count 1513
Iterating global reduction 2 with 198 rules applied. Total rules applied 1820 place count 1206 transition count 1513
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1869 place count 1157 transition count 1419
Iterating global reduction 2 with 49 rules applied. Total rules applied 1918 place count 1157 transition count 1419
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 1931 place count 1156 transition count 1407
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1966 place count 1121 transition count 1372
Iterating global reduction 3 with 35 rules applied. Total rules applied 2001 place count 1121 transition count 1372
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 2005 place count 1117 transition count 1372
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2029 place count 1093 transition count 1324
Iterating global reduction 4 with 24 rules applied. Total rules applied 2053 place count 1093 transition count 1324
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2074 place count 1072 transition count 1303
Iterating global reduction 4 with 21 rules applied. Total rules applied 2095 place count 1072 transition count 1303
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 2100 place count 1067 transition count 1303
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 2120 place count 1047 transition count 1283
Iterating global reduction 5 with 20 rules applied. Total rules applied 2140 place count 1047 transition count 1283
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 2160 place count 1047 transition count 1263
Applied a total of 2160 rules in 1362 ms. Remains 1047 /2117 variables (removed 1070) and now considering 1263/2435 (removed 1172) transitions.
// Phase 1: matrix 1263 rows 1047 cols
[2025-06-01 23:46:47] [INFO ] Computed 54 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:46:48] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-01 23:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:46:49] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned [72, 81, 139, 142, 146, 147, 155, 158, 251, 254, 258, 332, 333, 345, 348, 352, 353, 447, 448, 449, 450, 454, 455, 456, 467, 470, 478, 481, 484, 658, 662, 663, 668, 669, 670, 788, 789, 797, 856, 857, 858, 863, 873, 876, 985, 989]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 1628 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1001/2117 places, 1263/2435 transitions.
Applied a total of 0 rules in 32 ms. Remains 1001 /1001 variables (removed 0) and now considering 1263/1263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3036 ms. Remains : 1001/2117 places, 1263/2435 transitions.
Support contains 49 out of 1001 places after structural reductions.
[2025-06-01 23:46:49] [INFO ] Flatten gal took : 99 ms
[2025-06-01 23:46:49] [INFO ] Flatten gal took : 57 ms
[2025-06-01 23:46:49] [INFO ] Input system was already deterministic with 1263 transitions.
Support contains 46 out of 1001 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (61 resets) in 1914 ms. (20 steps per ms) remains 5/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
// Phase 1: matrix 1263 rows 1001 cols
[2025-06-01 23:46:50] [INFO ] Computed 42 invariants in 8 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 125/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 725/857 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/857 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1206/2063 variables, 857/899 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2063 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 201/2264 variables, 144/1043 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2264 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/2264 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2264/2264 variables, and 1043 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 1001/1001 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 125/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 725/857 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/857 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1206/2063 variables, 857/899 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2063 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2063 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 201/2264 variables, 144/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2264 variables, 4/1048 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2264 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2264 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2264/2264 variables, and 1048 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 1001/1001 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3221ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 569 ms.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 817 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 938 transition count 1051
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 798 transition count 1050
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 282 place count 798 transition count 968
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 446 place count 716 transition count 968
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 484 place count 678 transition count 902
Iterating global reduction 2 with 38 rules applied. Total rules applied 522 place count 678 transition count 902
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 527 place count 678 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 528 place count 677 transition count 897
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 528 place count 677 transition count 893
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 536 place count 673 transition count 893
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 546 place count 663 transition count 872
Iterating global reduction 4 with 10 rules applied. Total rules applied 556 place count 663 transition count 872
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 557 place count 663 transition count 871
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 562 place count 658 transition count 866
Iterating global reduction 5 with 5 rules applied. Total rules applied 567 place count 658 transition count 866
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 570 place count 658 transition count 863
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 572 place count 656 transition count 859
Iterating global reduction 6 with 2 rules applied. Total rules applied 574 place count 656 transition count 859
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 576 place count 654 transition count 857
Iterating global reduction 6 with 2 rules applied. Total rules applied 578 place count 654 transition count 857
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 580 place count 654 transition count 855
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 7 with 676 rules applied. Total rules applied 1256 place count 316 transition count 517
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1271 place count 301 transition count 489
Iterating global reduction 7 with 15 rules applied. Total rules applied 1286 place count 301 transition count 489
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1290 place count 301 transition count 485
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1294 place count 297 transition count 477
Iterating global reduction 8 with 4 rules applied. Total rules applied 1298 place count 297 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1300 place count 297 transition count 475
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1302 place count 295 transition count 471
Iterating global reduction 9 with 2 rules applied. Total rules applied 1304 place count 295 transition count 471
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1338 place count 278 transition count 506
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 1361 place count 278 transition count 483
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 1391 place count 255 transition count 476
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 10 with 39 rules applied. Total rules applied 1430 place count 255 transition count 447
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 48 rules applied. Total rules applied 1478 place count 216 transition count 438
Applied a total of 1478 rules in 289 ms. Remains 216 /1001 variables (removed 785) and now considering 438/1263 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 216/1001 places, 438/1263 transitions.
RANDOM walk for 40000 steps (494 resets) in 808 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1163610 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1163610 steps, saw 138460 distinct states, run finished after 3004 ms. (steps per millisecond=387 ) properties seen :0
[2025-06-01 23:46:58] [INFO ] Flow matrix only has 435 transitions (discarded 3 similar events)
// Phase 1: matrix 435 rows 216 cols
[2025-06-01 23:46:58] [INFO ] Computed 42 invariants in 7 ms
[2025-06-01 23:46:58] [INFO ] State equation strengthened by 136 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/151 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/499 variables, 151/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 25/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 152/651 variables, 65/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 111/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/651 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 216/216 constraints, ReadFeed: 136/136 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/151 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/499 variables, 151/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 25/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 152/651 variables, 65/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 111/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/651 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 216/216 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 5 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-3B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 67 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(X(F((p0||G(F(p1)))))))))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 816 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 937 transition count 1060
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 798 transition count 1059
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 280 place count 798 transition count 983
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 432 place count 722 transition count 983
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 470 place count 684 transition count 915
Iterating global reduction 2 with 38 rules applied. Total rules applied 508 place count 684 transition count 915
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 513 place count 684 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 514 place count 683 transition count 910
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 514 place count 683 transition count 907
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 520 place count 680 transition count 907
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 529 place count 671 transition count 888
Iterating global reduction 4 with 9 rules applied. Total rules applied 538 place count 671 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 539 place count 671 transition count 887
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 543 place count 667 transition count 883
Iterating global reduction 5 with 4 rules applied. Total rules applied 547 place count 667 transition count 883
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 549 place count 667 transition count 881
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 551 place count 665 transition count 877
Iterating global reduction 6 with 2 rules applied. Total rules applied 553 place count 665 transition count 877
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 555 place count 663 transition count 875
Iterating global reduction 6 with 2 rules applied. Total rules applied 557 place count 663 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 559 place count 663 transition count 873
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 0 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 7 with 690 rules applied. Total rules applied 1249 place count 318 transition count 528
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1263 place count 304 transition count 502
Iterating global reduction 7 with 14 rules applied. Total rules applied 1277 place count 304 transition count 502
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1280 place count 304 transition count 499
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1284 place count 300 transition count 491
Iterating global reduction 8 with 4 rules applied. Total rules applied 1288 place count 300 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1290 place count 300 transition count 489
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1292 place count 298 transition count 485
Iterating global reduction 9 with 2 rules applied. Total rules applied 1294 place count 298 transition count 485
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1320 place count 285 transition count 484
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1322 place count 285 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1323 place count 284 transition count 483
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1332 place count 275 transition count 483
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1380 place count 251 transition count 459
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 1404 place count 251 transition count 435
Applied a total of 1404 rules in 246 ms. Remains 251 /1001 variables (removed 750) and now considering 435/1263 (removed 828) transitions.
[2025-06-01 23:46:59] [INFO ] Flow matrix only has 427 transitions (discarded 8 similar events)
// Phase 1: matrix 427 rows 251 cols
[2025-06-01 23:46:59] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:46:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-01 23:46:59] [INFO ] Flow matrix only has 427 transitions (discarded 8 similar events)
[2025-06-01 23:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:46:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:46:59] [INFO ] Implicit Places using invariants and state equation in 293 ms returned [55, 159, 162]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 420 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/1001 places, 435/1263 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 245 transition count 432
Applied a total of 6 rules in 9 ms. Remains 245 /248 variables (removed 3) and now considering 432/435 (removed 3) transitions.
[2025-06-01 23:46:59] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 245 cols
[2025-06-01 23:46:59] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:46:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-01 23:46:59] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2025-06-01 23:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:00] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:47:00] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/1001 places, 432/1263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1064 ms. Remains : 245/1001 places, 432/1263 transitions.
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-00 finished in 1497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (p1||G(p0)))))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 974 transition count 1234
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 974 transition count 1234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 974 transition count 1232
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 72 place count 958 transition count 1208
Iterating global reduction 1 with 16 rules applied. Total rules applied 88 place count 958 transition count 1208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 958 transition count 1204
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 949 transition count 1194
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 949 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 949 transition count 1192
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 119 place count 942 transition count 1182
Iterating global reduction 3 with 7 rules applied. Total rules applied 126 place count 942 transition count 1182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 942 transition count 1179
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 938 transition count 1174
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 938 transition count 1174
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 934 transition count 1170
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 934 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 934 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 933 transition count 1166
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 933 transition count 1166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 933 transition count 1165
Applied a total of 151 rules in 198 ms. Remains 933 /1001 variables (removed 68) and now considering 1165/1263 (removed 98) transitions.
// Phase 1: matrix 1165 rows 933 cols
[2025-06-01 23:47:00] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:01] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-01 23:47:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:01] [INFO ] Implicit Places using invariants and state equation in 763 ms returned [246, 422, 596, 600]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1045 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/1001 places, 1165/1263 transitions.
Applied a total of 0 rules in 24 ms. Remains 929 /929 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1267 ms. Remains : 929/1001 places, 1165/1263 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Product exploration explored 100000 steps with 33333 reset in 279 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLFireability-01 finished in 2079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&F(!p1)))||(F(p2)&&((!p0&&X((p0&&F(!p1))))||X(G((p0&&F(!p1)))))))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 815 edges and 1001 vertex of which 64 / 1001 are part of one of the 8 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 944 transition count 1063
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 145 rules applied. Total rules applied 289 place count 801 transition count 1061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 800 transition count 1061
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 290 place count 800 transition count 984
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 444 place count 723 transition count 984
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 481 place count 686 transition count 917
Iterating global reduction 3 with 37 rules applied. Total rules applied 518 place count 686 transition count 917
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 523 place count 686 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 524 place count 685 transition count 912
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 524 place count 685 transition count 909
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 530 place count 682 transition count 909
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 539 place count 673 transition count 890
Iterating global reduction 5 with 9 rules applied. Total rules applied 548 place count 673 transition count 890
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 549 place count 673 transition count 889
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 553 place count 669 transition count 885
Iterating global reduction 6 with 4 rules applied. Total rules applied 557 place count 669 transition count 885
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 559 place count 669 transition count 883
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 561 place count 667 transition count 879
Iterating global reduction 7 with 2 rules applied. Total rules applied 563 place count 667 transition count 879
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 565 place count 665 transition count 877
Iterating global reduction 7 with 2 rules applied. Total rules applied 567 place count 665 transition count 877
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 665 transition count 875
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 8 with 694 rules applied. Total rules applied 1263 place count 318 transition count 528
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1278 place count 303 transition count 500
Iterating global reduction 8 with 15 rules applied. Total rules applied 1293 place count 303 transition count 500
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1297 place count 303 transition count 496
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1301 place count 299 transition count 488
Iterating global reduction 9 with 4 rules applied. Total rules applied 1305 place count 299 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1307 place count 299 transition count 486
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1309 place count 297 transition count 482
Iterating global reduction 10 with 2 rules applied. Total rules applied 1311 place count 297 transition count 482
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1337 place count 284 transition count 481
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1338 place count 284 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1339 place count 283 transition count 480
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1347 place count 275 transition count 480
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 11 with 44 rules applied. Total rules applied 1391 place count 253 transition count 458
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 1413 place count 253 transition count 436
Applied a total of 1413 rules in 193 ms. Remains 253 /1001 variables (removed 748) and now considering 436/1263 (removed 827) transitions.
[2025-06-01 23:47:02] [INFO ] Flow matrix only has 429 transitions (discarded 7 similar events)
// Phase 1: matrix 429 rows 253 cols
[2025-06-01 23:47:02] [INFO ] Computed 34 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:03] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-01 23:47:03] [INFO ] Flow matrix only has 429 transitions (discarded 7 similar events)
[2025-06-01 23:47:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:47:03] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [55, 109, 160]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 361 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/1001 places, 436/1263 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 247 transition count 433
Applied a total of 6 rules in 10 ms. Remains 247 /250 variables (removed 3) and now considering 433/436 (removed 3) transitions.
[2025-06-01 23:47:03] [INFO ] Flow matrix only has 426 transitions (discarded 7 similar events)
// Phase 1: matrix 426 rows 247 cols
[2025-06-01 23:47:03] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-01 23:47:03] [INFO ] Flow matrix only has 426 transitions (discarded 7 similar events)
[2025-06-01 23:47:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:47:03] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/1001 places, 433/1263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 911 ms. Remains : 247/1001 places, 433/1263 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p2) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-02
Stuttering criterion allowed to conclude after 1731 steps with 24 reset in 19 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-02 finished in 1237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U (p2||F(p3)))))'
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 812 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 937 transition count 1060
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 798 transition count 1059
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 280 place count 798 transition count 984
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 430 place count 723 transition count 984
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 465 place count 688 transition count 921
Iterating global reduction 2 with 35 rules applied. Total rules applied 500 place count 688 transition count 921
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 503 place count 688 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 687 transition count 918
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 504 place count 687 transition count 915
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 510 place count 684 transition count 915
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 520 place count 674 transition count 894
Iterating global reduction 4 with 10 rules applied. Total rules applied 530 place count 674 transition count 894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 531 place count 674 transition count 893
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 536 place count 669 transition count 888
Iterating global reduction 5 with 5 rules applied. Total rules applied 541 place count 669 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 544 place count 669 transition count 885
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 546 place count 667 transition count 881
Iterating global reduction 6 with 2 rules applied. Total rules applied 548 place count 667 transition count 881
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 550 place count 665 transition count 879
Iterating global reduction 6 with 2 rules applied. Total rules applied 552 place count 665 transition count 879
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 554 place count 665 transition count 877
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 7 with 674 rules applied. Total rules applied 1228 place count 328 transition count 540
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1243 place count 313 transition count 512
Iterating global reduction 7 with 15 rules applied. Total rules applied 1258 place count 313 transition count 512
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1262 place count 313 transition count 508
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1266 place count 309 transition count 500
Iterating global reduction 8 with 4 rules applied. Total rules applied 1270 place count 309 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1272 place count 309 transition count 498
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1274 place count 307 transition count 494
Iterating global reduction 9 with 2 rules applied. Total rules applied 1276 place count 307 transition count 494
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1308 place count 291 transition count 498
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1314 place count 291 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1315 place count 290 transition count 497
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1319 place count 286 transition count 497
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1343 place count 274 transition count 485
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1356 place count 274 transition count 472
Applied a total of 1356 rules in 167 ms. Remains 274 /1001 variables (removed 727) and now considering 472/1263 (removed 791) transitions.
[2025-06-01 23:47:04] [INFO ] Flow matrix only has 464 transitions (discarded 8 similar events)
// Phase 1: matrix 464 rows 274 cols
[2025-06-01 23:47:04] [INFO ] Computed 38 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:04] [INFO ] Implicit Places using invariants in 139 ms returned [8, 33, 68, 93]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 140 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 270/1001 places, 472/1263 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 260 transition count 462
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 260 transition count 452
Applied a total of 30 rules in 10 ms. Remains 260 /270 variables (removed 10) and now considering 452/472 (removed 20) transitions.
[2025-06-01 23:47:04] [INFO ] Flow matrix only has 444 transitions (discarded 8 similar events)
// Phase 1: matrix 444 rows 260 cols
[2025-06-01 23:47:04] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:04] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-01 23:47:04] [INFO ] Flow matrix only has 444 transitions (discarded 8 similar events)
[2025-06-01 23:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:04] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-01 23:47:04] [INFO ] Implicit Places using invariants and state equation in 303 ms returned [60, 114, 164, 167]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 428 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/1001 places, 452/1263 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 252 transition count 448
Applied a total of 8 rules in 11 ms. Remains 252 /256 variables (removed 4) and now considering 448/452 (removed 4) transitions.
[2025-06-01 23:47:04] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
// Phase 1: matrix 440 rows 252 cols
[2025-06-01 23:47:04] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:04] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-01 23:47:04] [INFO ] Flow matrix only has 440 transitions (discarded 8 similar events)
[2025-06-01 23:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:04] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-01 23:47:05] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 252/1001 places, 448/1263 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1151 ms. Remains : 252/1001 places, 448/1263 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p3) (NOT p1)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-04 finished in 1349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 817 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 937 transition count 1061
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 799 transition count 1060
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 278 place count 799 transition count 984
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 430 place count 723 transition count 984
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 469 place count 684 transition count 915
Iterating global reduction 2 with 39 rules applied. Total rules applied 508 place count 684 transition count 915
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 513 place count 684 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 514 place count 683 transition count 910
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 514 place count 683 transition count 907
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 520 place count 680 transition count 907
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 530 place count 670 transition count 886
Iterating global reduction 4 with 10 rules applied. Total rules applied 540 place count 670 transition count 886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 541 place count 670 transition count 885
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 546 place count 665 transition count 880
Iterating global reduction 5 with 5 rules applied. Total rules applied 551 place count 665 transition count 880
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 554 place count 665 transition count 877
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 556 place count 663 transition count 873
Iterating global reduction 6 with 2 rules applied. Total rules applied 558 place count 663 transition count 873
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 560 place count 661 transition count 871
Iterating global reduction 6 with 2 rules applied. Total rules applied 562 place count 661 transition count 871
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 564 place count 661 transition count 869
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 1 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 7 with 692 rules applied. Total rules applied 1256 place count 315 transition count 523
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1270 place count 301 transition count 497
Iterating global reduction 7 with 14 rules applied. Total rules applied 1284 place count 301 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1288 place count 301 transition count 493
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1291 place count 298 transition count 487
Iterating global reduction 8 with 3 rules applied. Total rules applied 1294 place count 298 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1295 place count 298 transition count 486
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1297 place count 296 transition count 482
Iterating global reduction 9 with 2 rules applied. Total rules applied 1299 place count 296 transition count 482
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1325 place count 283 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1326 place count 282 transition count 480
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1335 place count 273 transition count 480
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1383 place count 249 transition count 456
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 1407 place count 249 transition count 432
Applied a total of 1407 rules in 159 ms. Remains 249 /1001 variables (removed 752) and now considering 432/1263 (removed 831) transitions.
[2025-06-01 23:47:05] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 249 cols
[2025-06-01 23:47:05] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:05] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-01 23:47:05] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2025-06-01 23:47:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:47:05] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [55, 105, 153, 156]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 419 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1001 places, 432/1263 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 241 transition count 428
Applied a total of 8 rules in 9 ms. Remains 241 /245 variables (removed 4) and now considering 428/432 (removed 4) transitions.
[2025-06-01 23:47:05] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 241 cols
[2025-06-01 23:47:05] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:06] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-01 23:47:06] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2025-06-01 23:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:47:06] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 241/1001 places, 428/1263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 950 ms. Remains : 241/1001 places, 428/1263 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-06 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)||(F(p1) U (p2&&X(p3)))) U p4))))'
Support contains 6 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 976 transition count 1236
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 976 transition count 1236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 976 transition count 1234
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 962 transition count 1213
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 962 transition count 1213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 962 transition count 1210
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 954 transition count 1201
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 954 transition count 1201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 954 transition count 1200
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 947 transition count 1190
Iterating global reduction 3 with 7 rules applied. Total rules applied 114 place count 947 transition count 1190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 117 place count 947 transition count 1187
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 943 transition count 1182
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 943 transition count 1182
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 939 transition count 1178
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 939 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 939 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 938 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 938 transition count 1174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 938 transition count 1173
Applied a total of 139 rules in 195 ms. Remains 938 /1001 variables (removed 63) and now considering 1173/1263 (removed 90) transitions.
// Phase 1: matrix 1173 rows 938 cols
[2025-06-01 23:47:06] [INFO ] Computed 42 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:06] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-06-01 23:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:07] [INFO ] Implicit Places using invariants and state equation in 741 ms returned [245, 421, 598, 602]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1008 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 934/1001 places, 1173/1263 transitions.
Applied a total of 0 rules in 24 ms. Remains 934 /934 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1227 ms. Remains : 934/1001 places, 1173/1263 transitions.
Stuttering acceptance computed with spot in 564 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-07
Product exploration explored 100000 steps with 22211 reset in 233 ms.
Product exploration explored 100000 steps with 22202 reset in 264 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p0) p2 (NOT p1) p3), (X (X p2)), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) (NOT p0) p2))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2)))), (X (X (NOT (AND (NOT p4) p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p4) (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p4))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 156 ms. Reduced automaton from 11 states, 41 edges and 5 AP (stutter sensitive) to 11 states, 41 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (60 resets) in 408 ms. (97 steps per ms) remains 17/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 12/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 12/12 properties
// Phase 1: matrix 1173 rows 934 cols
[2025-06-01 23:47:09] [INFO ] Computed 42 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 628/796 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1117/1913 variables, 796/838 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1913 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 194/2107 variables, 138/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2107 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/2107 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2107/2107 variables, and 976 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3476 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 628/796 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1117/1913 variables, 796/838 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1913 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 194/2107 variables, 138/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2107 variables, 12/988 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 23:47:15] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2107 variables, 1/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2107 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/2107 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2107/2107 variables, and 989 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4936 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8436ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2962 ms.
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1173/1173 transitions.
Graph (trivial) has 741 edges and 934 vertex of which 64 / 934 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 878 transition count 983
Reduce places removed 126 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 127 rules applied. Total rules applied 254 place count 752 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 751 transition count 982
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 255 place count 751 transition count 894
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 431 place count 663 transition count 894
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 453 place count 641 transition count 838
Iterating global reduction 3 with 22 rules applied. Total rules applied 475 place count 641 transition count 838
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 1139 place count 309 transition count 506
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1150 place count 298 transition count 486
Iterating global reduction 3 with 11 rules applied. Total rules applied 1161 place count 298 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1163 place count 298 transition count 484
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1165 place count 296 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 1167 place count 296 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1169 place count 294 transition count 476
Iterating global reduction 4 with 2 rules applied. Total rules applied 1171 place count 294 transition count 476
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1207 place count 276 transition count 517
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1227 place count 276 transition count 497
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1254 place count 256 transition count 490
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1294 place count 256 transition count 462
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 1340 place count 216 transition count 456
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1342 place count 216 transition count 456
Applied a total of 1342 rules in 102 ms. Remains 216 /934 variables (removed 718) and now considering 456/1173 (removed 717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 216/934 places, 456/1173 transitions.
RANDOM walk for 40000 steps (11 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
[2025-06-01 23:47:21] [INFO ] Flow matrix only has 451 transitions (discarded 5 similar events)
// Phase 1: matrix 451 rows 216 cols
[2025-06-01 23:47:21] [INFO ] Computed 42 invariants in 3 ms
[2025-06-01 23:47:21] [INFO ] State equation strengthened by 138 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 127/156 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 366/522 variables, 156/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 31/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 145/667 variables, 60/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 107/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/667 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 396 constraints, problems are : Problem set: 0 solved, 4 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 216/216 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 127/156 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 366/522 variables, 156/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 31/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 145/667 variables, 60/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 107/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/667 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 400 constraints, problems are : Problem set: 0 solved, 4 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 216/216 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1091ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 78 ms.
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 456/456 transitions.
Graph (trivial) has 2 edges and 216 vertex of which 2 / 216 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 7 ms. Remains 215 /216 variables (removed 1) and now considering 454/456 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 215/216 places, 454/456 transitions.
RANDOM walk for 40000 steps (532 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (21 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 879848 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 879848 steps, saw 124304 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2025-06-01 23:47:25] [INFO ] Flow matrix only has 449 transitions (discarded 5 similar events)
// Phase 1: matrix 449 rows 215 cols
[2025-06-01 23:47:25] [INFO ] Computed 42 invariants in 3 ms
[2025-06-01 23:47:25] [INFO ] State equation strengthened by 138 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/155 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 364/519 variables, 155/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 31/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 145/664 variables, 60/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 107/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/664 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 395 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 215/215 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/155 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 364/519 variables, 155/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 31/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 145/664 variables, 60/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 107/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/664 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 215/215 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND (NOT p4) (NOT p0) p2 (NOT p1) p3), (X (X p2)), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) (NOT p0) p2))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2)))), (X (X (NOT (AND (NOT p4) p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p4) (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p4))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2 p4 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1 p3))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p4 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p2) p4 p1))), (F (NOT (OR p2 p1 p3))), (F p4), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p4))), (F p1), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2) p1 p3))), (F (NOT (OR (NOT p0) p2 p4))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p2 (NOT p4)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 (NOT p4) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (NOT p0) p2 p1 p3))), (F (NOT (OR (NOT p2) p3)))]
Knowledge based reduction with 13 factoid took 1419 ms. Reduced automaton from 11 states, 41 edges and 5 AP (stutter sensitive) to 11 states, 41 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 546 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 560 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p3))]
// Phase 1: matrix 1173 rows 934 cols
[2025-06-01 23:47:29] [INFO ] Computed 42 invariants in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 23:47:29] [INFO ] [Real]Absence check using 42 positive place invariants in 55 ms returned unsat
Proved EG (NOT p4)
Knowledge obtained : [(AND (NOT p4) (NOT p0) p2 (NOT p1) p3), (X (X p2)), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) (NOT p0) p2))), (X (X (NOT (AND (NOT p4) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p4) p0 p2)))), (X (X (NOT (AND (NOT p4) p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p4) (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p4))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2 p4 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1 p3))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p4 p1))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p2) p4 p1))), (F (NOT (OR p2 p1 p3))), (F p4), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p4))), (F p1), (F p0), (F (NOT (OR p2 p1))), (F (NOT (OR p0 (NOT p2) p1 p3))), (F (NOT (OR (NOT p0) p2 p4))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p2 (NOT p4)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 (NOT p4) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (NOT p0) p2 p1 p3))), (F (NOT (OR (NOT p2) p3))), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 13 factoid took 1402 ms. Reduced automaton from 11 states, 41 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLFireability-07 finished in 24590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)&&X(G(p1))))))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 976 transition count 1237
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 976 transition count 1237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 976 transition count 1236
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 961 transition count 1213
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 961 transition count 1213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 961 transition count 1210
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 952 transition count 1200
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 952 transition count 1200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 952 transition count 1198
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 945 transition count 1188
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 945 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 945 transition count 1185
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 941 transition count 1180
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 941 transition count 1180
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 937 transition count 1176
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 937 transition count 1176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 140 place count 937 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 936 transition count 1172
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 936 transition count 1172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 936 transition count 1171
Applied a total of 143 rules in 195 ms. Remains 936 /1001 variables (removed 65) and now considering 1171/1263 (removed 92) transitions.
// Phase 1: matrix 1171 rows 936 cols
[2025-06-01 23:47:31] [INFO ] Computed 42 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:31] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-01 23:47:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:32] [INFO ] Implicit Places using invariants and state equation in 839 ms returned [245, 424, 598, 602]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1127 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/1001 places, 1171/1263 transitions.
Applied a total of 0 rules in 23 ms. Remains 932 /932 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1346 ms. Remains : 932/1001 places, 1171/1263 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-08
Product exploration explored 100000 steps with 160 reset in 222 ms.
Product exploration explored 100000 steps with 158 reset in 355 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (62 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 265337 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 3
Probabilistic random walk after 265337 steps, saw 138285 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1171 rows 932 cols
[2025-06-01 23:47:36] [INFO ] Computed 42 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 705/793 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1907 variables, 793/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1907 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 196/2103 variables, 139/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2103 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2103 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2103/2103 variables, and 974 constraints, problems are : Problem set: 0 solved, 3 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 705/793 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1907 variables, 793/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1907 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1907 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 196/2103 variables, 139/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2103 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2103 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2103 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2103/2103 variables, and 977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1787ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 6896 steps, including 18 resets, run visited all 3 properties in 22 ms. (steps per millisecond=313 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 22 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 279 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1171/1171 transitions.
Applied a total of 0 rules in 31 ms. Remains 932 /932 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
[2025-06-01 23:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:39] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-01 23:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:47:40] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-01 23:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30228ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30232ms
Finished structural reductions in LTL mode , in 1 iterations and 31229 ms. Remains : 932/932 places, 1171/1171 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (64 resets) in 237 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 271449 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 3
Probabilistic random walk after 271449 steps, saw 139993 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-01 23:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 705/793 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1907 variables, 793/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1907 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 196/2103 variables, 139/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2103 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2103 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2103/2103 variables, and 974 constraints, problems are : Problem set: 0 solved, 3 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 705/793 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1907 variables, 793/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1907 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1907 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 196/2103 variables, 139/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2103 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2103 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2103 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2103/2103 variables, and 977 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 288 ms.
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1171/1171 transitions.
Graph (trivial) has 748 edges and 932 vertex of which 72 / 932 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 869 transition count 978
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 748 transition count 978
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 243 place count 748 transition count 890
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 419 place count 660 transition count 890
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 441 place count 638 transition count 837
Iterating global reduction 2 with 22 rules applied. Total rules applied 463 place count 638 transition count 837
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 463 place count 638 transition count 836
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 465 place count 637 transition count 836
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 466 place count 636 transition count 832
Iterating global reduction 2 with 1 rules applied. Total rules applied 467 place count 636 transition count 832
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1135 place count 302 transition count 498
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1146 place count 291 transition count 478
Iterating global reduction 2 with 11 rules applied. Total rules applied 1157 place count 291 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1159 place count 291 transition count 476
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1161 place count 289 transition count 472
Iterating global reduction 3 with 2 rules applied. Total rules applied 1163 place count 289 transition count 472
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1165 place count 287 transition count 468
Iterating global reduction 3 with 2 rules applied. Total rules applied 1167 place count 287 transition count 468
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1199 place count 271 transition count 499
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1200 place count 271 transition count 498
Free-agglomeration rule applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 1225 place count 271 transition count 473
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 1257 place count 246 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1258 place count 246 transition count 465
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 1301 place count 246 transition count 433
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 54 rules applied. Total rules applied 1355 place count 203 transition count 422
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1358 place count 203 transition count 422
Applied a total of 1358 rules in 117 ms. Remains 203 /932 variables (removed 729) and now considering 422/1171 (removed 749) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 203/932 places, 422/1171 transitions.
RANDOM walk for 28108 steps (348 resets) in 140 ms. (199 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 267 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 156 reset in 212 ms.
Product exploration explored 100000 steps with 162 reset in 229 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 251 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1171/1171 transitions.
Graph (trivial) has 747 edges and 932 vertex of which 72 / 932 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 869 transition count 1108
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 122 place count 869 transition count 1154
Deduced a syphon composed of 168 places in 2 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 169 place count 869 transition count 1154
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 194 place count 844 transition count 1104
Deduced a syphon composed of 162 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 219 place count 844 transition count 1104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 219 place count 844 transition count 1110
Deduced a syphon composed of 165 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 844 transition count 1110
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 241 place count 825 transition count 1063
Deduced a syphon composed of 146 places in 8 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 260 place count 825 transition count 1063
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 260 place count 825 transition count 1069
Deduced a syphon composed of 152 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 266 place count 825 transition count 1069
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 496 places in 0 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 610 place count 825 transition count 1269
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 677 place count 758 transition count 1178
Deduced a syphon composed of 442 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 744 place count 758 transition count 1178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 748 place count 758 transition count 1174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 752 place count 754 transition count 1168
Deduced a syphon composed of 440 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 756 place count 754 transition count 1168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 758 place count 752 transition count 1162
Deduced a syphon composed of 440 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 760 place count 752 transition count 1162
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -242
Deduced a syphon composed of 475 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 795 place count 752 transition count 1404
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 818 place count 729 transition count 1302
Deduced a syphon composed of 452 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 841 place count 729 transition count 1302
Deduced a syphon composed of 452 places in 0 ms
Applied a total of 841 rules in 349 ms. Remains 729 /932 variables (removed 203) and now considering 1302/1171 (removed -131) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 23:48:18] [INFO ] Redundant transitions in 84 ms returned []
Running 1301 sub problems to find dead transitions.
[2025-06-01 23:48:18] [INFO ] Flow matrix only has 1292 transitions (discarded 10 similar events)
// Phase 1: matrix 1292 rows 729 cols
[2025-06-01 23:48:18] [INFO ] Computed 42 invariants in 12 ms
[2025-06-01 23:48:18] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
SMT process timed out in 30984ms, After SMT, problems are : Problem set: 0 solved, 1301 unsolved
Search for dead transitions found 0 dead transitions in 30987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 729/932 places, 1302/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31432 ms. Remains : 729/932 places, 1302/1171 transitions.
Built C files in :
/tmp/ltsmin5193410363363414215
[2025-06-01 23:48:49] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5193410363363414215
Running compilation step : cd /tmp/ltsmin5193410363363414215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1935 ms.
Running link step : cd /tmp/ltsmin5193410363363414215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5193410363363414215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17649340685388264779.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1171/1171 transitions.
Applied a total of 0 rules in 21 ms. Remains 932 /932 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
// Phase 1: matrix 1171 rows 932 cols
[2025-06-01 23:49:04] [INFO ] Computed 42 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:49:04] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-01 23:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:49:05] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-01 23:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30155ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30157ms
Finished structural reductions in LTL mode , in 1 iterations and 31127 ms. Remains : 932/932 places, 1171/1171 transitions.
Built C files in :
/tmp/ltsmin14742105303607678048
[2025-06-01 23:49:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14742105303607678048
Running compilation step : cd /tmp/ltsmin14742105303607678048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1946 ms.
Running link step : cd /tmp/ltsmin14742105303607678048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14742105303607678048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9524762560795428381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 23:49:50] [INFO ] Flatten gal took : 38 ms
[2025-06-01 23:49:51] [INFO ] Flatten gal took : 38 ms
[2025-06-01 23:49:51] [INFO ] Time to serialize gal into /tmp/LTL7391610230135224461.gal : 8 ms
[2025-06-01 23:49:51] [INFO ] Time to serialize properties into /tmp/LTL16209390142375131795.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7391610230135224461.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15844634595555183071.hoa' '-atoms' '/tmp/LTL16209390142375131795.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16209390142375131795.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15844634595555183071.hoa
Detected timeout of ITS tools.
[2025-06-01 23:50:06] [INFO ] Flatten gal took : 33 ms
[2025-06-01 23:50:06] [INFO ] Flatten gal took : 30 ms
[2025-06-01 23:50:06] [INFO ] Time to serialize gal into /tmp/LTL8251525193267901128.gal : 7 ms
[2025-06-01 23:50:06] [INFO ] Time to serialize properties into /tmp/LTL2966615843801633735.ltl : 5 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8251525193267901128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2966615843801633735.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((G("((p443==0)||(p1267==0))"))&&(X(G("(p532==0)")))))))))
Formula 0 simplified : XXXX(F!"((p443==0)||(p1267==0))" | XF!"(p532==0)")
Detected timeout of ITS tools.
[2025-06-01 23:50:21] [INFO ] Flatten gal took : 29 ms
[2025-06-01 23:50:21] [INFO ] Applying decomposition
[2025-06-01 23:50:21] [INFO ] Flatten gal took : 25 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/graph7616688978518346471.txt' '-o' '/tmp/graph7616688978518346471.bin' '-w' '/tmp/graph7616688978518346471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7616688978518346471.bin' '-l' '-1' '-v' '-w' '/tmp/graph7616688978518346471.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:50:21] [INFO ] Decomposing Gal with order
[2025-06-01 23:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:50:21] [INFO ] Removed a total of 466 redundant transitions.
[2025-06-01 23:50:21] [INFO ] Flatten gal took : 95 ms
[2025-06-01 23:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 24 ms.
[2025-06-01 23:50:21] [INFO ] Time to serialize gal into /tmp/LTL6352043849807549163.gal : 14 ms
[2025-06-01 23:50:21] [INFO ] Time to serialize properties into /tmp/LTL13972256171044671599.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6352043849807549163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13972256171044671599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((G("((i6.u105.p443==0)||(i13.i0.i1.u241.p1267==0))"))&&(X(G("(i8.u122.p532==0)")))))))))
Formula 0 simplified : XXXX(F!"((i6.u105.p443==0)||(i13.i0.i1.u241.p1267==0))" | XF!"(i8.u122.p532==0)")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-3B-LTLFireability-08 finished in 185874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 817 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 937 transition count 1059
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 797 transition count 1058
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 282 place count 797 transition count 982
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 434 place count 721 transition count 982
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 472 place count 683 transition count 915
Iterating global reduction 2 with 38 rules applied. Total rules applied 510 place count 683 transition count 915
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 515 place count 683 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 682 transition count 910
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 516 place count 682 transition count 907
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 522 place count 679 transition count 907
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 531 place count 670 transition count 887
Iterating global reduction 4 with 9 rules applied. Total rules applied 540 place count 670 transition count 887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 541 place count 670 transition count 886
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 546 place count 665 transition count 881
Iterating global reduction 5 with 5 rules applied. Total rules applied 551 place count 665 transition count 881
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 554 place count 665 transition count 878
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 556 place count 663 transition count 874
Iterating global reduction 6 with 2 rules applied. Total rules applied 558 place count 663 transition count 874
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 560 place count 661 transition count 872
Iterating global reduction 6 with 2 rules applied. Total rules applied 562 place count 661 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 564 place count 661 transition count 870
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 7 with 692 rules applied. Total rules applied 1256 place count 315 transition count 524
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1271 place count 300 transition count 496
Iterating global reduction 7 with 15 rules applied. Total rules applied 1286 place count 300 transition count 496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1290 place count 300 transition count 492
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1294 place count 296 transition count 484
Iterating global reduction 8 with 4 rules applied. Total rules applied 1298 place count 296 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1300 place count 296 transition count 482
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1302 place count 294 transition count 478
Iterating global reduction 9 with 2 rules applied. Total rules applied 1304 place count 294 transition count 478
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1330 place count 281 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1331 place count 280 transition count 476
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1340 place count 271 transition count 476
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1388 place count 247 transition count 452
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 1412 place count 247 transition count 428
Applied a total of 1412 rules in 147 ms. Remains 247 /1001 variables (removed 754) and now considering 428/1263 (removed 835) transitions.
[2025-06-01 23:50:36] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
// Phase 1: matrix 420 rows 247 cols
[2025-06-01 23:50:36] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:37] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-01 23:50:37] [INFO ] Flow matrix only has 420 transitions (discarded 8 similar events)
[2025-06-01 23:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:50:37] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [55, 105, 155, 158]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 535 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1001 places, 428/1263 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 239 transition count 424
Applied a total of 8 rules in 8 ms. Remains 239 /243 variables (removed 4) and now considering 424/428 (removed 4) transitions.
[2025-06-01 23:50:37] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
// Phase 1: matrix 416 rows 239 cols
[2025-06-01 23:50:37] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:37] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-01 23:50:37] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
[2025-06-01 23:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:50:38] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 239/1001 places, 424/1263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1244 ms. Remains : 239/1001 places, 424/1263 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-09 finished in 1297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 974 transition count 1234
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 974 transition count 1234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 974 transition count 1232
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 72 place count 958 transition count 1208
Iterating global reduction 1 with 16 rules applied. Total rules applied 88 place count 958 transition count 1208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 958 transition count 1204
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 949 transition count 1194
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 949 transition count 1194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 949 transition count 1192
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 119 place count 942 transition count 1182
Iterating global reduction 3 with 7 rules applied. Total rules applied 126 place count 942 transition count 1182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 942 transition count 1179
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 938 transition count 1174
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 938 transition count 1174
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 934 transition count 1170
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 934 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 934 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 933 transition count 1166
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 933 transition count 1166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 933 transition count 1165
Applied a total of 151 rules in 162 ms. Remains 933 /1001 variables (removed 68) and now considering 1165/1263 (removed 98) transitions.
// Phase 1: matrix 1165 rows 933 cols
[2025-06-01 23:50:38] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:38] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-01 23:50:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:39] [INFO ] Implicit Places using invariants and state equation in 758 ms returned [245, 421, 595, 599]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1018 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/1001 places, 1165/1263 transitions.
Applied a total of 0 rules in 21 ms. Remains 929 /929 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1201 ms. Remains : 929/1001 places, 1165/1263 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-10 finished in 1339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X((F(p1) U G(p2)))))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 975 transition count 1235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 975 transition count 1235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 975 transition count 1233
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 960 transition count 1211
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 960 transition count 1211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 960 transition count 1207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 96 place count 952 transition count 1198
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 952 transition count 1198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 952 transition count 1196
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 112 place count 946 transition count 1188
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 946 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 946 transition count 1185
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 124 place count 943 transition count 1181
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 943 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 940 transition count 1178
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 940 transition count 1178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 940 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 939 transition count 1175
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 939 transition count 1175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 939 transition count 1174
Applied a total of 138 rules in 172 ms. Remains 939 /1001 variables (removed 62) and now considering 1174/1263 (removed 89) transitions.
// Phase 1: matrix 1174 rows 939 cols
[2025-06-01 23:50:39] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:39] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-01 23:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:40] [INFO ] Implicit Places using invariants and state equation in 724 ms returned [245, 421, 595]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 977 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/1001 places, 1174/1263 transitions.
Applied a total of 0 rules in 25 ms. Remains 936 /936 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1174 ms. Remains : 936/1001 places, 1174/1263 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-11
Product exploration explored 100000 steps with 3996 reset in 138 ms.
Stack based approach found an accepted trace after 3798 steps with 150 reset with depth 23 and stack size 23 in 6 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-11 finished in 1606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p1)))&&p0))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 975 transition count 1235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 975 transition count 1235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 975 transition count 1233
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 960 transition count 1210
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 960 transition count 1210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 960 transition count 1207
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 96 place count 951 transition count 1197
Iterating global reduction 2 with 9 rules applied. Total rules applied 105 place count 951 transition count 1197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 951 transition count 1195
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 944 transition count 1185
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 944 transition count 1185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 944 transition count 1182
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 940 transition count 1177
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 940 transition count 1177
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 136 place count 936 transition count 1173
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 936 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 143 place count 936 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 935 transition count 1169
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 935 transition count 1169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 146 place count 935 transition count 1168
Applied a total of 146 rules in 170 ms. Remains 935 /1001 variables (removed 66) and now considering 1168/1263 (removed 95) transitions.
// Phase 1: matrix 1168 rows 935 cols
[2025-06-01 23:50:41] [INFO ] Computed 42 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:41] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-01 23:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:42] [INFO ] Implicit Places using invariants and state equation in 741 ms returned [246, 422, 596, 600]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 991 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/1001 places, 1168/1263 transitions.
Applied a total of 0 rules in 21 ms. Remains 931 /931 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1182 ms. Remains : 931/1001 places, 1168/1263 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-13 finished in 1385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 976 transition count 1236
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 976 transition count 1236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 976 transition count 1234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 963 transition count 1216
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 963 transition count 1216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 963 transition count 1212
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 957 transition count 1205
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 957 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 957 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 952 transition count 1197
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 952 transition count 1197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 952 transition count 1195
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 949 transition count 1191
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 949 transition count 1191
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 946 transition count 1188
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 946 transition count 1188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 946 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 945 transition count 1185
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 945 transition count 1185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 945 transition count 1184
Applied a total of 124 rules in 169 ms. Remains 945 /1001 variables (removed 56) and now considering 1184/1263 (removed 79) transitions.
// Phase 1: matrix 1184 rows 945 cols
[2025-06-01 23:50:42] [INFO ] Computed 42 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-01 23:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:43] [INFO ] Implicit Places using invariants and state equation in 738 ms returned [245, 421, 598, 602]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1004 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 941/1001 places, 1184/1263 transitions.
Applied a total of 0 rules in 21 ms. Remains 941 /941 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1195 ms. Remains : 941/1001 places, 1184/1263 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-14 finished in 1300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||X(F(p0)))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 975 transition count 1235
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 975 transition count 1235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 975 transition count 1233
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 960 transition count 1211
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 960 transition count 1211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 960 transition count 1207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 96 place count 952 transition count 1198
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 952 transition count 1198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 952 transition count 1196
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 112 place count 946 transition count 1188
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 946 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 946 transition count 1185
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 124 place count 943 transition count 1181
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 943 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 940 transition count 1178
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 940 transition count 1178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 940 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 939 transition count 1175
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 939 transition count 1175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 939 transition count 1174
Applied a total of 138 rules in 162 ms. Remains 939 /1001 variables (removed 62) and now considering 1174/1263 (removed 89) transitions.
// Phase 1: matrix 1174 rows 939 cols
[2025-06-01 23:50:43] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:44] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-01 23:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:44] [INFO ] Implicit Places using invariants and state equation in 736 ms returned [428, 602, 606]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 995 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/1001 places, 1174/1263 transitions.
Applied a total of 0 rules in 20 ms. Remains 936 /936 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1177 ms. Remains : 936/1001 places, 1174/1263 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-15
Stuttering criterion allowed to conclude after 621 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-15 finished in 1369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)&&X(G(p1))))))))'
Found a Lengthening insensitive property : NoC3x3-PT-3B-LTLFireability-08
Stuttering acceptance computed with spot in 223 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1001/1001 places, 1263/1263 transitions.
Graph (trivial) has 814 edges and 1001 vertex of which 72 / 1001 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 937 transition count 1060
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 798 transition count 1060
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 279 place count 798 transition count 984
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 431 place count 722 transition count 984
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 468 place count 685 transition count 918
Iterating global reduction 2 with 37 rules applied. Total rules applied 505 place count 685 transition count 918
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 509 place count 685 transition count 914
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 509 place count 685 transition count 912
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 513 place count 683 transition count 912
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 521 place count 675 transition count 896
Iterating global reduction 3 with 8 rules applied. Total rules applied 529 place count 675 transition count 896
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 534 place count 670 transition count 891
Iterating global reduction 3 with 5 rules applied. Total rules applied 539 place count 670 transition count 891
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 542 place count 670 transition count 888
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 544 place count 668 transition count 884
Iterating global reduction 4 with 2 rules applied. Total rules applied 546 place count 668 transition count 884
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 548 place count 666 transition count 882
Iterating global reduction 4 with 2 rules applied. Total rules applied 550 place count 666 transition count 882
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 552 place count 666 transition count 880
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 0 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 5 with 692 rules applied. Total rules applied 1244 place count 320 transition count 534
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1259 place count 305 transition count 506
Iterating global reduction 5 with 15 rules applied. Total rules applied 1274 place count 305 transition count 506
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1278 place count 305 transition count 502
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1282 place count 301 transition count 494
Iterating global reduction 6 with 4 rules applied. Total rules applied 1286 place count 301 transition count 494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1288 place count 301 transition count 492
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1290 place count 299 transition count 487
Iterating global reduction 7 with 2 rules applied. Total rules applied 1292 place count 299 transition count 487
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1320 place count 285 transition count 492
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1324 place count 285 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1325 place count 284 transition count 491
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1334 place count 275 transition count 491
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 1382 place count 251 transition count 467
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1407 place count 251 transition count 442
Applied a total of 1407 rules in 146 ms. Remains 251 /1001 variables (removed 750) and now considering 442/1263 (removed 821) transitions.
[2025-06-01 23:50:45] [INFO ] Flow matrix only has 432 transitions (discarded 10 similar events)
// Phase 1: matrix 432 rows 251 cols
[2025-06-01 23:50:45] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:45] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 23:50:45] [INFO ] Flow matrix only has 432 transitions (discarded 10 similar events)
[2025-06-01 23:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:50:45] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [55, 109, 157, 160]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 382 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 247/1001 places, 442/1263 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 243 transition count 438
Applied a total of 8 rules in 6 ms. Remains 243 /247 variables (removed 4) and now considering 438/442 (removed 4) transitions.
[2025-06-01 23:50:45] [INFO ] Flow matrix only has 428 transitions (discarded 10 similar events)
// Phase 1: matrix 428 rows 243 cols
[2025-06-01 23:50:45] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:46] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-01 23:50:46] [INFO ] Flow matrix only has 428 transitions (discarded 10 similar events)
[2025-06-01 23:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:50:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 23:50:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 243/1001 places, 438/1263 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 901 ms. Remains : 243/1001 places, 438/1263 transitions.
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 33304 steps with 429 reset in 113 ms.
Treatment of property NoC3x3-PT-3B-LTLFireability-08 finished in 1353 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-01 23:50:46] [INFO ] Flatten gal took : 30 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 240447 ms.

BK_STOP 1748821846545

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-3B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;