fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597400084
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1858.752 300145.00 408417.00 119.00 FTTFF?FTFFTFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597400084.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 795K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678608534603

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:08:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 08:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:08:57] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-12 08:08:57] [INFO ] Transformed 2430 places.
[2023-03-12 08:08:57] [INFO ] Transformed 3040 transitions.
[2023-03-12 08:08:57] [INFO ] Found NUPN structural information;
[2023-03-12 08:08:57] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 2281 transition count 2891
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 2281 transition count 2891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 299 place count 2281 transition count 2890
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 356 place count 2224 transition count 2805
Iterating global reduction 1 with 57 rules applied. Total rules applied 413 place count 2224 transition count 2805
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 431 place count 2224 transition count 2787
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 439 place count 2216 transition count 2779
Iterating global reduction 2 with 8 rules applied. Total rules applied 447 place count 2216 transition count 2779
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 451 place count 2212 transition count 2768
Iterating global reduction 2 with 4 rules applied. Total rules applied 455 place count 2212 transition count 2768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 458 place count 2209 transition count 2765
Iterating global reduction 2 with 3 rules applied. Total rules applied 461 place count 2209 transition count 2765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 464 place count 2206 transition count 2755
Iterating global reduction 2 with 3 rules applied. Total rules applied 467 place count 2206 transition count 2755
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 468 place count 2205 transition count 2747
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 2205 transition count 2747
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 470 place count 2204 transition count 2746
Iterating global reduction 2 with 1 rules applied. Total rules applied 471 place count 2204 transition count 2746
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 472 place count 2203 transition count 2738
Iterating global reduction 2 with 1 rules applied. Total rules applied 473 place count 2203 transition count 2738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 2202 transition count 2730
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 2202 transition count 2730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 476 place count 2201 transition count 2729
Iterating global reduction 2 with 1 rules applied. Total rules applied 477 place count 2201 transition count 2729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 478 place count 2200 transition count 2721
Iterating global reduction 2 with 1 rules applied. Total rules applied 479 place count 2200 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 480 place count 2199 transition count 2713
Iterating global reduction 2 with 1 rules applied. Total rules applied 481 place count 2199 transition count 2713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 482 place count 2198 transition count 2712
Iterating global reduction 2 with 1 rules applied. Total rules applied 483 place count 2198 transition count 2712
Applied a total of 483 rules in 2612 ms. Remains 2198 /2430 variables (removed 232) and now considering 2712/3040 (removed 328) transitions.
// Phase 1: matrix 2712 rows 2198 cols
[2023-03-12 08:09:00] [INFO ] Computed 238 place invariants in 119 ms
[2023-03-12 08:09:02] [INFO ] Implicit Places using invariants in 1999 ms returned [2032, 2043, 2054, 2062, 2070, 2078, 2086, 2097, 2105, 2113, 2124]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2063 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2187/2430 places, 2712/3040 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2175 transition count 2700
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2175 transition count 2700
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 2165 transition count 2690
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 2165 transition count 2690
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 2157 transition count 2682
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 2157 transition count 2682
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 2153 transition count 2678
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 2153 transition count 2678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 2151 transition count 2676
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 2151 transition count 2676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 2149 transition count 2674
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 2149 transition count 2674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 2147 transition count 2672
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 2147 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 2145 transition count 2670
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 2145 transition count 2670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2144 transition count 2669
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2144 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2143 transition count 2668
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2143 transition count 2668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2142 transition count 2667
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2142 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2141 transition count 2666
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2141 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2140 transition count 2665
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2140 transition count 2665
Applied a total of 94 rules in 1237 ms. Remains 2140 /2187 variables (removed 47) and now considering 2665/2712 (removed 47) transitions.
// Phase 1: matrix 2665 rows 2140 cols
[2023-03-12 08:09:04] [INFO ] Computed 227 place invariants in 97 ms
[2023-03-12 08:09:04] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-12 08:09:04] [INFO ] Invariant cache hit.
[2023-03-12 08:09:11] [INFO ] Implicit Places using invariants and state equation in 6746 ms returned []
Implicit Place search using SMT with State Equation took 7685 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2140/2430 places, 2665/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13597 ms. Remains : 2140/2430 places, 2665/3040 transitions.
Support contains 41 out of 2140 places after structural reductions.
[2023-03-12 08:09:12] [INFO ] Flatten gal took : 238 ms
[2023-03-12 08:09:12] [INFO ] Flatten gal took : 145 ms
[2023-03-12 08:09:12] [INFO ] Input system was already deterministic with 2665 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 27) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-12 08:09:13] [INFO ] Invariant cache hit.
[2023-03-12 08:09:15] [INFO ] [Real]Absence check using 57 positive place invariants in 48 ms returned sat
[2023-03-12 08:09:15] [INFO ] [Real]Absence check using 57 positive and 170 generalized place invariants in 143 ms returned sat
[2023-03-12 08:09:19] [INFO ] After 6302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 08:09:20] [INFO ] [Nat]Absence check using 57 positive place invariants in 76 ms returned sat
[2023-03-12 08:09:21] [INFO ] [Nat]Absence check using 57 positive and 170 generalized place invariants in 223 ms returned sat
[2023-03-12 08:09:44] [INFO ] After 22526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-12 08:09:44] [INFO ] After 22536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 08:09:44] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 18 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 249 ms.
Support contains 29 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2140 transition count 2280
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1755 transition count 2277
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 777 place count 1753 transition count 2275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 779 place count 1751 transition count 2275
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 574 Pre rules applied. Total rules applied 779 place count 1751 transition count 1701
Deduced a syphon composed of 574 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 628 places and 0 transitions.
Iterating global reduction 4 with 1202 rules applied. Total rules applied 1981 place count 1123 transition count 1701
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2020 place count 1118 transition count 1667
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2054 place count 1084 transition count 1667
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2054 place count 1084 transition count 1646
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 63 rules applied. Total rules applied 2117 place count 1042 transition count 1646
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2117 place count 1042 transition count 1626
Deduced a syphon composed of 20 places in 8 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2157 place count 1022 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2158 place count 1021 transition count 1625
Iterating global reduction 6 with 1 rules applied. Total rules applied 2159 place count 1021 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2160 place count 1020 transition count 1624
Iterating global reduction 6 with 1 rules applied. Total rules applied 2161 place count 1020 transition count 1624
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 6 with 332 rules applied. Total rules applied 2493 place count 853 transition count 1459
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2497 place count 849 transition count 1455
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2502 place count 848 transition count 1455
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2503 place count 848 transition count 1454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2504 place count 847 transition count 1454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2504 place count 847 transition count 1453
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2506 place count 846 transition count 1453
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2508 place count 844 transition count 1451
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 844 transition count 1451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2512 place count 844 transition count 1449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2513 place count 843 transition count 1449
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2515 place count 842 transition count 1454
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 2522 place count 842 transition count 1447
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2529 place count 835 transition count 1447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2532 place count 835 transition count 1444
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2535 place count 832 transition count 1444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 2539 place count 832 transition count 1444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2540 place count 831 transition count 1443
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 14 rules applied. Total rules applied 2554 place count 821 transition count 1439
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2558 place count 817 transition count 1439
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 2558 place count 817 transition count 1423
Deduced a syphon composed of 16 places in 15 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 33 rules applied. Total rules applied 2591 place count 800 transition count 1423
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2597 place count 794 transition count 1423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2597 place count 794 transition count 1422
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2599 place count 793 transition count 1422
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 2619 place count 783 transition count 1412
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2624 place count 778 transition count 1407
Iterating global reduction 15 with 5 rules applied. Total rules applied 2629 place count 778 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2630 place count 777 transition count 1406
Iterating global reduction 15 with 1 rules applied. Total rules applied 2631 place count 777 transition count 1406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2632 place count 777 transition count 1405
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2636 place count 777 transition count 1401
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2640 place count 773 transition count 1401
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2641 place count 773 transition count 1401
Applied a total of 2641 rules in 1329 ms. Remains 773 /2140 variables (removed 1367) and now considering 1401/2665 (removed 1264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1330 ms. Remains : 773/2140 places, 1401/2665 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1401 rows 773 cols
[2023-03-12 08:09:47] [INFO ] Computed 127 place invariants in 25 ms
[2023-03-12 08:09:47] [INFO ] [Real]Absence check using 36 positive place invariants in 193 ms returned sat
[2023-03-12 08:09:47] [INFO ] [Real]Absence check using 36 positive and 91 generalized place invariants in 38 ms returned sat
[2023-03-12 08:09:49] [INFO ] After 2605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 08:09:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-12 08:09:50] [INFO ] [Nat]Absence check using 36 positive and 91 generalized place invariants in 50 ms returned sat
[2023-03-12 08:09:53] [INFO ] After 3006ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :5
[2023-03-12 08:09:54] [INFO ] Deduced a trap composed of 37 places in 780 ms of which 6 ms to minimize.
[2023-03-12 08:09:55] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 14 ms to minimize.
[2023-03-12 08:09:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1179 ms
[2023-03-12 08:09:55] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 1 ms to minimize.
[2023-03-12 08:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-12 08:09:55] [INFO ] After 5064ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :4
Attempting to minimize the solution found.
Minimization took 388 ms.
[2023-03-12 08:09:56] [INFO ] After 6488ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :4
Fused 16 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 7 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 1401/1401 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 773 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 772 transition count 1400
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 772 transition count 1393
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 765 transition count 1393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 763 transition count 1379
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 763 transition count 1379
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 762 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 761 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 761 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 760 transition count 1363
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 760 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 759 transition count 1355
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 759 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 758 transition count 1347
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 758 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 757 transition count 1339
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 757 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 756 transition count 1331
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 756 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 755 transition count 1323
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 755 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 754 transition count 1315
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 754 transition count 1315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 753 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 752 transition count 1313
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 752 transition count 1313
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 752 transition count 1312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 751 transition count 1312
Applied a total of 43 rules in 233 ms. Remains 751 /773 variables (removed 22) and now considering 1312/1401 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 751/773 places, 1312/1401 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1312 rows 751 cols
[2023-03-12 08:09:57] [INFO ] Computed 126 place invariants in 10 ms
[2023-03-12 08:09:57] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-12 08:09:57] [INFO ] [Real]Absence check using 36 positive and 90 generalized place invariants in 108 ms returned sat
[2023-03-12 08:09:58] [INFO ] After 1184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:09:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 08:09:58] [INFO ] [Nat]Absence check using 36 positive and 90 generalized place invariants in 38 ms returned sat
[2023-03-12 08:09:59] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:09:59] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 2 ms to minimize.
[2023-03-12 08:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-12 08:10:00] [INFO ] After 1662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-12 08:10:00] [INFO ] After 2255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 6 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1312/1312 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 751 transition count 1311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 750 transition count 1311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 750 transition count 1310
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 4 place count 749 transition count 1310
Applied a total of 4 rules in 29 ms. Remains 749 /751 variables (removed 2) and now considering 1310/1312 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 749/751 places, 1310/1312 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 302179 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302179 steps, saw 62197 distinct states, run finished after 3003 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1310 rows 749 cols
[2023-03-12 08:10:03] [INFO ] Computed 126 place invariants in 30 ms
[2023-03-12 08:10:04] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-12 08:10:04] [INFO ] [Real]Absence check using 36 positive and 90 generalized place invariants in 62 ms returned sat
[2023-03-12 08:10:04] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:10:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 160 ms returned sat
[2023-03-12 08:10:05] [INFO ] [Nat]Absence check using 36 positive and 90 generalized place invariants in 83 ms returned sat
[2023-03-12 08:10:06] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:10:07] [INFO ] Deduced a trap composed of 45 places in 799 ms of which 27 ms to minimize.
[2023-03-12 08:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 917 ms
[2023-03-12 08:10:08] [INFO ] Deduced a trap composed of 98 places in 283 ms of which 14 ms to minimize.
[2023-03-12 08:10:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2023-03-12 08:10:08] [INFO ] After 2658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-12 08:10:08] [INFO ] After 3632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1310/1310 transitions.
Applied a total of 0 rules in 25 ms. Remains 749 /749 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 749/749 places, 1310/1310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1310/1310 transitions.
Applied a total of 0 rules in 21 ms. Remains 749 /749 variables (removed 0) and now considering 1310/1310 (removed 0) transitions.
[2023-03-12 08:10:08] [INFO ] Invariant cache hit.
[2023-03-12 08:10:09] [INFO ] Implicit Places using invariants in 1253 ms returned [1, 18, 19, 31, 48, 66, 86, 135, 145, 146, 150, 256, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 400, 436, 505, 509, 510, 521, 522, 524, 541, 559, 628, 632, 633, 636, 647, 648, 649, 667, 688, 689, 690, 691]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1256 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 704/749 places, 1310/1310 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 704 transition count 1230
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 164 place count 624 transition count 1226
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 164 place count 624 transition count 1199
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 219 place count 596 transition count 1199
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 231 place count 592 transition count 1191
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 239 place count 584 transition count 1191
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 243 place count 580 transition count 1187
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 580 transition count 1187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 250 place count 580 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 251 place count 579 transition count 1183
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 579 transition count 1183
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 310 place count 550 transition count 1154
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 313 place count 547 transition count 1151
Iterating global reduction 5 with 3 rules applied. Total rules applied 316 place count 547 transition count 1151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 319 place count 547 transition count 1148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 323 place count 545 transition count 1149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 324 place count 545 transition count 1148
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 325 place count 545 transition count 1147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 326 place count 544 transition count 1147
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 336 place count 544 transition count 1137
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 347 place count 533 transition count 1137
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 356 place count 533 transition count 1137
Applied a total of 356 rules in 199 ms. Remains 533 /704 variables (removed 171) and now considering 1137/1310 (removed 173) transitions.
// Phase 1: matrix 1137 rows 533 cols
[2023-03-12 08:10:10] [INFO ] Computed 75 place invariants in 23 ms
[2023-03-12 08:10:10] [INFO ] Implicit Places using invariants in 441 ms returned [86, 92, 95, 97, 164, 185, 193, 199, 206, 207, 260, 276, 282, 285, 287, 292, 293, 349, 369, 377, 383, 388, 389, 442, 458, 464, 467, 469]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 443 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 505/749 places, 1137/1310 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 492 transition count 1124
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 492 transition count 1124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 485 transition count 1117
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 485 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 481 transition count 1113
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 481 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 479 transition count 1111
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 479 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 478 transition count 1110
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 478 transition count 1110
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 469 transition count 1101
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 87 place count 469 transition count 1086
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 102 place count 454 transition count 1086
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 454 transition count 1083
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 451 transition count 1083
Applied a total of 108 rules in 119 ms. Remains 451 /505 variables (removed 54) and now considering 1083/1137 (removed 54) transitions.
// Phase 1: matrix 1083 rows 451 cols
[2023-03-12 08:10:10] [INFO ] Computed 47 place invariants in 22 ms
[2023-03-12 08:10:11] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-12 08:10:11] [INFO ] Invariant cache hit.
[2023-03-12 08:10:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:12] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 451/749 places, 1083/1310 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3458 ms. Remains : 451/749 places, 1083/1310 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 08:10:12] [INFO ] Invariant cache hit.
[2023-03-12 08:10:12] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 08:10:12] [INFO ] [Real]Absence check using 14 positive and 33 generalized place invariants in 13 ms returned sat
[2023-03-12 08:10:12] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:10:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-12 08:10:13] [INFO ] [Nat]Absence check using 14 positive and 33 generalized place invariants in 38 ms returned sat
[2023-03-12 08:10:14] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:14] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:14] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 08:10:14] [INFO ] After 1904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 1083/1083 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 450 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 1082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 449 transition count 1081
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 448 transition count 1080
Applied a total of 5 rules in 65 ms. Remains 448 /451 variables (removed 3) and now considering 1080/1083 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 448/451 places, 1080/1083 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 332436 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332436 steps, saw 98326 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1080 rows 448 cols
[2023-03-12 08:10:18] [INFO ] Computed 47 place invariants in 8 ms
[2023-03-12 08:10:18] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 08:10:18] [INFO ] [Real]Absence check using 12 positive and 35 generalized place invariants in 30 ms returned sat
[2023-03-12 08:10:18] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:10:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 08:10:18] [INFO ] [Nat]Absence check using 12 positive and 35 generalized place invariants in 20 ms returned sat
[2023-03-12 08:10:19] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:19] [INFO ] After 136ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:19] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-12 08:10:20] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1080/1080 transitions.
Applied a total of 0 rules in 22 ms. Remains 448 /448 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 448/448 places, 1080/1080 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1080/1080 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 1080/1080 (removed 0) transitions.
[2023-03-12 08:10:20] [INFO ] Invariant cache hit.
[2023-03-12 08:10:20] [INFO ] Implicit Places using invariants in 293 ms returned [263]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/448 places, 1080/1080 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 1079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 446 transition count 1079
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 443 transition count 1076
Applied a total of 8 rules in 22 ms. Remains 443 /447 variables (removed 4) and now considering 1076/1080 (removed 4) transitions.
// Phase 1: matrix 1076 rows 443 cols
[2023-03-12 08:10:20] [INFO ] Computed 46 place invariants in 10 ms
[2023-03-12 08:10:20] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 08:10:20] [INFO ] Invariant cache hit.
[2023-03-12 08:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:21] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 443/448 places, 1076/1080 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1812 ms. Remains : 443/448 places, 1076/1080 transitions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 315953 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 315953 steps, saw 93278 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 08:10:25] [INFO ] Invariant cache hit.
[2023-03-12 08:10:25] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 08:10:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 19 ms returned sat
[2023-03-12 08:10:25] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:10:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 08:10:25] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2023-03-12 08:10:26] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:26] [INFO ] After 144ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:26] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 08:10:26] [INFO ] After 1138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1076/1076 transitions.
Applied a total of 0 rules in 23 ms. Remains 443 /443 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 443/443 places, 1076/1076 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1076/1076 transitions.
Applied a total of 0 rules in 17 ms. Remains 443 /443 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2023-03-12 08:10:26] [INFO ] Invariant cache hit.
[2023-03-12 08:10:27] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 08:10:27] [INFO ] Invariant cache hit.
[2023-03-12 08:10:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:10:28] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
[2023-03-12 08:10:28] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-12 08:10:28] [INFO ] Invariant cache hit.
[2023-03-12 08:10:29] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2346 ms. Remains : 443/443 places, 1076/1076 transitions.
Applied a total of 0 rules in 15 ms. Remains 443 /443 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 08:10:29] [INFO ] Invariant cache hit.
[2023-03-12 08:10:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 08:10:29] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned sat
[2023-03-12 08:10:29] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 08:10:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 79 ms returned sat
[2023-03-12 08:10:30] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 32 ms returned sat
[2023-03-12 08:10:30] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:10:30] [INFO ] After 792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 08:10:30] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ASLink-PT-05b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-05b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 86 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2137 transition count 2650
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2137 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 2134 transition count 2640
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 2134 transition count 2640
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2132 transition count 2638
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2131 transition count 2630
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2131 transition count 2630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2130 transition count 2622
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2130 transition count 2622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2128 transition count 2613
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2128 transition count 2613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2127 transition count 2605
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2127 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2125 transition count 2596
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2125 transition count 2596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2124 transition count 2588
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2124 transition count 2588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2122 transition count 2579
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2122 transition count 2579
Applied a total of 36 rules in 1306 ms. Remains 2122 /2140 variables (removed 18) and now considering 2579/2665 (removed 86) transitions.
// Phase 1: matrix 2579 rows 2122 cols
[2023-03-12 08:10:32] [INFO ] Computed 227 place invariants in 21 ms
[2023-03-12 08:10:33] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-12 08:10:33] [INFO ] Invariant cache hit.
[2023-03-12 08:10:40] [INFO ] Implicit Places using invariants and state equation in 6775 ms returned []
Implicit Place search using SMT with State Equation took 7706 ms to find 0 implicit places.
[2023-03-12 08:10:40] [INFO ] Invariant cache hit.
[2023-03-12 08:10:42] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2140 places, 2579/2665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10769 ms. Remains : 2122/2140 places, 2579/2665 transitions.
Stuttering acceptance computed with spot in 383 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1729 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-00 finished in 11285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2139 transition count 2273
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 394 rules applied. Total rules applied 785 place count 1748 transition count 2270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 787 place count 1746 transition count 2270
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 787 place count 1746 transition count 1690
Deduced a syphon composed of 580 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1214 rules applied. Total rules applied 2001 place count 1112 transition count 1690
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2040 place count 1107 transition count 1656
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2074 place count 1073 transition count 1656
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2074 place count 1073 transition count 1635
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2137 place count 1031 transition count 1635
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2137 place count 1031 transition count 1615
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2177 place count 1011 transition count 1615
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2180 place count 1008 transition count 1600
Iterating global reduction 5 with 3 rules applied. Total rules applied 2183 place count 1008 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2185 place count 1006 transition count 1591
Iterating global reduction 5 with 2 rules applied. Total rules applied 2187 place count 1006 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2188 place count 1005 transition count 1583
Iterating global reduction 5 with 1 rules applied. Total rules applied 2189 place count 1005 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2190 place count 1004 transition count 1575
Iterating global reduction 5 with 1 rules applied. Total rules applied 2191 place count 1004 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 1003 transition count 1567
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 1003 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1002 transition count 1559
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1002 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1001 transition count 1551
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1001 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2198 place count 1000 transition count 1543
Iterating global reduction 5 with 1 rules applied. Total rules applied 2199 place count 1000 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2200 place count 999 transition count 1535
Iterating global reduction 5 with 1 rules applied. Total rules applied 2201 place count 999 transition count 1535
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 5 with 338 rules applied. Total rules applied 2539 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2543 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2548 place count 824 transition count 1363
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2549 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2550 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2550 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2552 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2554 place count 820 transition count 1359
Iterating global reduction 7 with 2 rules applied. Total rules applied 2556 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2558 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2559 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2561 place count 818 transition count 1362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2563 place count 816 transition count 1360
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2578 place count 806 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2583 place count 801 transition count 1355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2583 place count 801 transition count 1340
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2614 place count 785 transition count 1340
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2625 place count 774 transition count 1340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2625 place count 774 transition count 1339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2627 place count 773 transition count 1339
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2659 place count 757 transition count 1323
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2669 place count 747 transition count 1313
Iterating global reduction 12 with 10 rules applied. Total rules applied 2679 place count 747 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2684 place count 742 transition count 1308
Iterating global reduction 12 with 5 rules applied. Total rules applied 2689 place count 742 transition count 1308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2694 place count 742 transition count 1303
Applied a total of 2694 rules in 899 ms. Remains 742 /2140 variables (removed 1398) and now considering 1303/2665 (removed 1362) transitions.
// Phase 1: matrix 1303 rows 742 cols
[2023-03-12 08:10:43] [INFO ] Computed 122 place invariants in 10 ms
[2023-03-12 08:10:44] [INFO ] Implicit Places using invariants in 529 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 151, 168, 186, 206, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 628, 639, 640, 641, 659, 680, 681, 682, 683]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 543 ms to find 48 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 694/2140 places, 1303/2665 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 694 transition count 1216
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 607 transition count 1216
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 174 place count 607 transition count 1189
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 229 place count 579 transition count 1189
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 241 place count 575 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 249 place count 567 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 564 transition count 1178
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 564 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 258 place count 564 transition count 1175
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 336 place count 525 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 523 transition count 1137
Applied a total of 340 rules in 64 ms. Remains 523 /694 variables (removed 171) and now considering 1137/1303 (removed 166) transitions.
// Phase 1: matrix 1137 rows 523 cols
[2023-03-12 08:10:44] [INFO ] Computed 69 place invariants in 9 ms
[2023-03-12 08:10:44] [INFO ] Implicit Places using invariants in 335 ms returned [88, 94, 99, 178, 184, 189, 268, 274, 279, 356, 362, 367, 444, 450, 455, 520]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 337 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 507/2140 places, 1137/2665 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 507 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 506 transition count 1136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 496 transition count 1126
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 496 transition count 1126
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 486 transition count 1116
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 486 transition count 1116
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 481 transition count 1111
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 481 transition count 1111
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 476 transition count 1106
Applied a total of 62 rules in 61 ms. Remains 476 /507 variables (removed 31) and now considering 1106/1137 (removed 31) transitions.
// Phase 1: matrix 1106 rows 476 cols
[2023-03-12 08:10:44] [INFO ] Computed 53 place invariants in 14 ms
[2023-03-12 08:10:44] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-12 08:10:44] [INFO ] Invariant cache hit.
[2023-03-12 08:10:46] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 476/2140 places, 1106/2665 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3749 ms. Remains : 476/2140 places, 1106/2665 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s94 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 12 ms.
FORMULA ASLink-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-03 finished in 3903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2136 transition count 2649
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2136 transition count 2649
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2133 transition count 2639
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2133 transition count 2639
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 2131 transition count 2637
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2130 transition count 2629
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2129 transition count 2621
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2128 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2127 transition count 2612
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2126 transition count 2604
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2125 transition count 2603
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2124 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2123 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 2122 transition count 2586
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 2121 transition count 2578
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 2121 transition count 2578
Applied a total of 38 rules in 1658 ms. Remains 2121 /2140 variables (removed 19) and now considering 2578/2665 (removed 87) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2023-03-12 08:10:48] [INFO ] Computed 227 place invariants in 49 ms
[2023-03-12 08:10:49] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2023-03-12 08:10:49] [INFO ] Invariant cache hit.
[2023-03-12 08:10:54] [INFO ] Implicit Places using invariants and state equation in 4814 ms returned []
Implicit Place search using SMT with State Equation took 6124 ms to find 0 implicit places.
[2023-03-12 08:10:54] [INFO ] Invariant cache hit.
[2023-03-12 08:10:56] [INFO ] Dead Transitions using invariants and state equation in 1798 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2121/2140 places, 2578/2665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9583 ms. Remains : 2121/2140 places, 2578/2665 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s510 1) (NEQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 186 reset in 560 ms.
Product exploration explored 100000 steps with 179 reset in 457 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272238 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272238 steps, saw 47743 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:11:00] [INFO ] Invariant cache hit.
[2023-03-12 08:11:01] [INFO ] [Real]Absence check using 54 positive place invariants in 17 ms returned sat
[2023-03-12 08:11:01] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 95 ms returned sat
[2023-03-12 08:11:03] [INFO ] After 2209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:03] [INFO ] [Nat]Absence check using 54 positive place invariants in 44 ms returned sat
[2023-03-12 08:11:03] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 179 ms returned sat
[2023-03-12 08:11:06] [INFO ] After 2928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:07] [INFO ] Deduced a trap composed of 23 places in 686 ms of which 3 ms to minimize.
[2023-03-12 08:11:08] [INFO ] Deduced a trap composed of 101 places in 952 ms of which 1 ms to minimize.
[2023-03-12 08:11:09] [INFO ] Deduced a trap composed of 66 places in 347 ms of which 1 ms to minimize.
[2023-03-12 08:11:09] [INFO ] Deduced a trap composed of 135 places in 488 ms of which 0 ms to minimize.
[2023-03-12 08:11:10] [INFO ] Deduced a trap composed of 93 places in 282 ms of which 1 ms to minimize.
[2023-03-12 08:11:10] [INFO ] Deduced a trap composed of 98 places in 592 ms of which 1 ms to minimize.
[2023-03-12 08:11:11] [INFO ] Deduced a trap composed of 93 places in 455 ms of which 1 ms to minimize.
[2023-03-12 08:11:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4614 ms
[2023-03-12 08:11:11] [INFO ] After 7813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-12 08:11:11] [INFO ] After 8552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2121 transition count 2188
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 574 Pre rules applied. Total rules applied 785 place count 1729 transition count 1611
Deduced a syphon composed of 574 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 628 places and 0 transitions.
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1987 place count 1101 transition count 1611
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2026 place count 1096 transition count 1577
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2060 place count 1062 transition count 1577
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2060 place count 1062 transition count 1556
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2123 place count 1020 transition count 1556
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2123 place count 1020 transition count 1536
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2163 place count 1000 transition count 1536
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 340 rules applied. Total rules applied 2503 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2507 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2512 place count 824 transition count 1363
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2513 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2514 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2514 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2516 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2518 place count 820 transition count 1359
Iterating global reduction 7 with 2 rules applied. Total rules applied 2520 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2522 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2523 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2525 place count 818 transition count 1362
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 2532 place count 818 transition count 1355
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2539 place count 811 transition count 1355
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2543 place count 811 transition count 1351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2547 place count 807 transition count 1351
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2552 place count 807 transition count 1351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2553 place count 806 transition count 1350
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 14 rules applied. Total rules applied 2567 place count 796 transition count 1346
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2571 place count 792 transition count 1346
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 2571 place count 792 transition count 1330
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 33 rules applied. Total rules applied 2604 place count 775 transition count 1330
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 2610 place count 769 transition count 1330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2610 place count 769 transition count 1329
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2612 place count 768 transition count 1329
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 2632 place count 758 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 2637 place count 753 transition count 1314
Iterating global reduction 14 with 5 rules applied. Total rules applied 2642 place count 753 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 2647 place count 753 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2652 place count 748 transition count 1309
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2653 place count 748 transition count 1309
Applied a total of 2653 rules in 588 ms. Remains 748 /2121 variables (removed 1373) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 748/2121 places, 1309/2578 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432416 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432416 steps, saw 86711 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1309 rows 748 cols
[2023-03-12 08:11:15] [INFO ] Computed 127 place invariants in 25 ms
[2023-03-12 08:11:15] [INFO ] [Real]Absence check using 36 positive place invariants in 74 ms returned sat
[2023-03-12 08:11:15] [INFO ] [Real]Absence check using 36 positive and 91 generalized place invariants in 28 ms returned sat
[2023-03-12 08:11:16] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-12 08:11:16] [INFO ] [Nat]Absence check using 36 positive and 91 generalized place invariants in 39 ms returned sat
[2023-03-12 08:11:17] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:17] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 08:11:17] [INFO ] After 968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 21 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 748/748 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 21 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2023-03-12 08:11:17] [INFO ] Invariant cache hit.
[2023-03-12 08:11:17] [INFO ] Implicit Places using invariants in 683 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 152, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 635, 646, 647, 648, 666, 687, 688, 689, 690]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 697 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 701/748 places, 1309/1309 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 701 transition count 1223
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 615 transition count 1219
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 615 transition count 1192
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 587 transition count 1192
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 583 transition count 1184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 575 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 255 place count 571 transition count 1180
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 571 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 571 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 263 place count 570 transition count 1176
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 570 transition count 1176
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 330 place count 537 transition count 1143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 334 place count 533 transition count 1139
Iterating global reduction 5 with 4 rules applied. Total rules applied 338 place count 533 transition count 1139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 342 place count 533 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 531 transition count 1136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 531 transition count 1135
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 348 place count 531 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 349 place count 530 transition count 1134
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 360 place count 530 transition count 1123
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 372 place count 518 transition count 1123
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 384 place count 518 transition count 1123
Applied a total of 384 rules in 168 ms. Remains 518 /701 variables (removed 183) and now considering 1123/1309 (removed 186) transitions.
// Phase 1: matrix 1123 rows 518 cols
[2023-03-12 08:11:18] [INFO ] Computed 74 place invariants in 9 ms
[2023-03-12 08:11:18] [INFO ] Implicit Places using invariants in 554 ms returned [73, 89, 95, 98, 100, 103, 104, 161, 182, 190, 196, 201, 202, 255, 271, 277, 280, 282, 287, 288, 341, 357, 363, 366, 368, 373, 374, 427, 443, 449, 452, 454]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 556 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 486/748 places, 1123/1309 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 472 transition count 1109
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 472 transition count 1109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 466 transition count 1103
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 466 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 464 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 464 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 463 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 463 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 462 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 462 transition count 1099
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 452 transition count 1089
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 452 transition count 1074
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 437 transition count 1074
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 437 transition count 1070
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 433 transition count 1070
Applied a total of 106 rules in 95 ms. Remains 433 /486 variables (removed 53) and now considering 1070/1123 (removed 53) transitions.
// Phase 1: matrix 1070 rows 433 cols
[2023-03-12 08:11:18] [INFO ] Computed 42 place invariants in 21 ms
[2023-03-12 08:11:19] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2023-03-12 08:11:19] [INFO ] Invariant cache hit.
[2023-03-12 08:11:21] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 2362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/748 places, 1070/1309 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3900 ms. Remains : 433/748 places, 1070/1309 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 491273 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 491273 steps, saw 144888 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:11:24] [INFO ] Invariant cache hit.
[2023-03-12 08:11:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 08:11:24] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 55 ms returned sat
[2023-03-12 08:11:24] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 79 ms returned sat
[2023-03-12 08:11:24] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-12 08:11:25] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:25] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-12 08:11:25] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 433/433 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2023-03-12 08:11:25] [INFO ] Invariant cache hit.
[2023-03-12 08:11:26] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 08:11:26] [INFO ] Invariant cache hit.
[2023-03-12 08:11:27] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2023-03-12 08:11:27] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-12 08:11:27] [INFO ] Invariant cache hit.
[2023-03-12 08:11:27] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2020 ms. Remains : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 12 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 08:11:27] [INFO ] Invariant cache hit.
[2023-03-12 08:11:27] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:11:27] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-12 08:11:28] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:11:28] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-12 08:11:28] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:28] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-12 08:11:28] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 92 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2023-03-12 08:11:29] [INFO ] Computed 227 place invariants in 18 ms
[2023-03-12 08:11:31] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2023-03-12 08:11:31] [INFO ] Invariant cache hit.
[2023-03-12 08:11:36] [INFO ] Implicit Places using invariants and state equation in 4998 ms returned []
Implicit Place search using SMT with State Equation took 6803 ms to find 0 implicit places.
[2023-03-12 08:11:36] [INFO ] Invariant cache hit.
[2023-03-12 08:11:38] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8554 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290744 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290744 steps, saw 50593 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:11:41] [INFO ] Invariant cache hit.
[2023-03-12 08:11:42] [INFO ] [Real]Absence check using 54 positive place invariants in 35 ms returned sat
[2023-03-12 08:11:42] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 126 ms returned sat
[2023-03-12 08:11:44] [INFO ] After 2619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:45] [INFO ] [Nat]Absence check using 54 positive place invariants in 268 ms returned sat
[2023-03-12 08:11:45] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 136 ms returned sat
[2023-03-12 08:11:48] [INFO ] After 2898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:49] [INFO ] Deduced a trap composed of 23 places in 702 ms of which 2 ms to minimize.
[2023-03-12 08:11:49] [INFO ] Deduced a trap composed of 101 places in 473 ms of which 0 ms to minimize.
[2023-03-12 08:11:50] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 1 ms to minimize.
[2023-03-12 08:11:50] [INFO ] Deduced a trap composed of 135 places in 556 ms of which 0 ms to minimize.
[2023-03-12 08:11:51] [INFO ] Deduced a trap composed of 93 places in 728 ms of which 2 ms to minimize.
[2023-03-12 08:11:52] [INFO ] Deduced a trap composed of 98 places in 461 ms of which 1 ms to minimize.
[2023-03-12 08:11:52] [INFO ] Deduced a trap composed of 93 places in 420 ms of which 1 ms to minimize.
[2023-03-12 08:11:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4522 ms
[2023-03-12 08:11:53] [INFO ] After 7747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-12 08:11:53] [INFO ] After 8723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2121 transition count 2188
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 574 Pre rules applied. Total rules applied 785 place count 1729 transition count 1611
Deduced a syphon composed of 574 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 628 places and 0 transitions.
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1987 place count 1101 transition count 1611
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2026 place count 1096 transition count 1577
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2060 place count 1062 transition count 1577
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2060 place count 1062 transition count 1556
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2123 place count 1020 transition count 1556
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2123 place count 1020 transition count 1536
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2163 place count 1000 transition count 1536
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 340 rules applied. Total rules applied 2503 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2507 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2512 place count 824 transition count 1363
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2513 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2514 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2514 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2516 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2518 place count 820 transition count 1359
Iterating global reduction 7 with 2 rules applied. Total rules applied 2520 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2522 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2523 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2525 place count 818 transition count 1362
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 2532 place count 818 transition count 1355
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2539 place count 811 transition count 1355
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2543 place count 811 transition count 1351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2547 place count 807 transition count 1351
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2552 place count 807 transition count 1351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2553 place count 806 transition count 1350
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 14 rules applied. Total rules applied 2567 place count 796 transition count 1346
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2571 place count 792 transition count 1346
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 2571 place count 792 transition count 1330
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 33 rules applied. Total rules applied 2604 place count 775 transition count 1330
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 2610 place count 769 transition count 1330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2610 place count 769 transition count 1329
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2612 place count 768 transition count 1329
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 2632 place count 758 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 2637 place count 753 transition count 1314
Iterating global reduction 14 with 5 rules applied. Total rules applied 2642 place count 753 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 2647 place count 753 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2652 place count 748 transition count 1309
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2653 place count 748 transition count 1309
Applied a total of 2653 rules in 453 ms. Remains 748 /2121 variables (removed 1373) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 748/2121 places, 1309/2578 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469587 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469587 steps, saw 93434 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1309 rows 748 cols
[2023-03-12 08:11:56] [INFO ] Computed 127 place invariants in 9 ms
[2023-03-12 08:11:56] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-12 08:11:56] [INFO ] [Real]Absence check using 36 positive and 91 generalized place invariants in 48 ms returned sat
[2023-03-12 08:11:57] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:11:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 08:11:57] [INFO ] [Nat]Absence check using 36 positive and 91 generalized place invariants in 40 ms returned sat
[2023-03-12 08:11:58] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:11:58] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-12 08:11:58] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 22 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 748/748 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 31 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2023-03-12 08:11:58] [INFO ] Invariant cache hit.
[2023-03-12 08:11:59] [INFO ] Implicit Places using invariants in 644 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 152, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 635, 646, 647, 648, 666, 687, 688, 689, 690]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 646 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 701/748 places, 1309/1309 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 701 transition count 1223
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 176 place count 615 transition count 1219
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 615 transition count 1192
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 587 transition count 1192
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 583 transition count 1184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 575 transition count 1184
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 255 place count 571 transition count 1180
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 571 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 571 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 263 place count 570 transition count 1176
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 570 transition count 1176
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 330 place count 537 transition count 1143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 334 place count 533 transition count 1139
Iterating global reduction 5 with 4 rules applied. Total rules applied 338 place count 533 transition count 1139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 342 place count 533 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 531 transition count 1136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 531 transition count 1135
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 348 place count 531 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 349 place count 530 transition count 1134
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 360 place count 530 transition count 1123
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 372 place count 518 transition count 1123
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 384 place count 518 transition count 1123
Applied a total of 384 rules in 126 ms. Remains 518 /701 variables (removed 183) and now considering 1123/1309 (removed 186) transitions.
// Phase 1: matrix 1123 rows 518 cols
[2023-03-12 08:11:59] [INFO ] Computed 74 place invariants in 20 ms
[2023-03-12 08:12:00] [INFO ] Implicit Places using invariants in 1070 ms returned [73, 89, 95, 98, 100, 103, 104, 161, 182, 190, 196, 201, 202, 255, 271, 277, 280, 282, 287, 288, 341, 357, 363, 366, 368, 373, 374, 427, 443, 449, 452, 454]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 486/748 places, 1123/1309 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 472 transition count 1109
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 472 transition count 1109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 466 transition count 1103
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 466 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 464 transition count 1101
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 464 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 463 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 463 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 462 transition count 1099
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 462 transition count 1099
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 452 transition count 1089
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 452 transition count 1074
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 437 transition count 1074
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 437 transition count 1070
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 433 transition count 1070
Applied a total of 106 rules in 86 ms. Remains 433 /486 variables (removed 53) and now considering 1070/1123 (removed 53) transitions.
// Phase 1: matrix 1070 rows 433 cols
[2023-03-12 08:12:00] [INFO ] Computed 42 place invariants in 16 ms
[2023-03-12 08:12:01] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 08:12:01] [INFO ] Invariant cache hit.
[2023-03-12 08:12:02] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/748 places, 1070/1309 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3287 ms. Remains : 433/748 places, 1070/1309 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486268 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486268 steps, saw 143566 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:12:05] [INFO ] Invariant cache hit.
[2023-03-12 08:12:05] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 08:12:05] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 30 ms returned sat
[2023-03-12 08:12:05] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:12:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 08:12:06] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-12 08:12:06] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:12:06] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 08:12:06] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 30 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 433/433 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 21 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2023-03-12 08:12:06] [INFO ] Invariant cache hit.
[2023-03-12 08:12:07] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-12 08:12:07] [INFO ] Invariant cache hit.
[2023-03-12 08:12:09] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2023-03-12 08:12:09] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 08:12:09] [INFO ] Invariant cache hit.
[2023-03-12 08:12:10] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3648 ms. Remains : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 11 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 08:12:10] [INFO ] Invariant cache hit.
[2023-03-12 08:12:10] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:12:10] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 33 ms returned sat
[2023-03-12 08:12:10] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:12:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 29 ms returned sat
[2023-03-12 08:12:10] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-12 08:12:11] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:12:11] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-12 08:12:11] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 300 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 195 reset in 328 ms.
Product exploration explored 100000 steps with 192 reset in 359 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 381 place count 2121 transition count 2577
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 381 place count 2121 transition count 2674
Deduced a syphon composed of 767 places in 6 ms
Iterating global reduction 2 with 387 rules applied. Total rules applied 768 place count 2121 transition count 2674
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 977 place count 1912 transition count 2465
Deduced a syphon composed of 558 places in 5 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1186 place count 1912 transition count 2465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1186 place count 1912 transition count 2470
Deduced a syphon composed of 563 places in 5 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1191 place count 1912 transition count 2470
Performed 365 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 928 places in 5 ms
Iterating global reduction 2 with 365 rules applied. Total rules applied 1556 place count 1912 transition count 2471
Discarding 147 places :
Symmetric choice reduction at 2 with 147 rule applications. Total rules 1703 place count 1765 transition count 2322
Deduced a syphon composed of 785 places in 3 ms
Iterating global reduction 2 with 147 rules applied. Total rules applied 1850 place count 1765 transition count 2322
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1852 place count 1763 transition count 2319
Deduced a syphon composed of 785 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1854 place count 1763 transition count 2319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1856 place count 1763 transition count 2317
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 815 places in 3 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 1886 place count 1763 transition count 2416
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1895 place count 1754 transition count 2396
Deduced a syphon composed of 806 places in 3 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1904 place count 1754 transition count 2396
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 807 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1905 place count 1754 transition count 2398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1906 place count 1753 transition count 2396
Deduced a syphon composed of 806 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1907 place count 1753 transition count 2396
Deduced a syphon composed of 806 places in 3 ms
Applied a total of 1907 rules in 1371 ms. Remains 1753 /2121 variables (removed 368) and now considering 2396/2578 (removed 182) transitions.
[2023-03-12 08:12:15] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2396 rows 1753 cols
[2023-03-12 08:12:15] [INFO ] Computed 227 place invariants in 21 ms
[2023-03-12 08:12:18] [INFO ] Dead Transitions using invariants and state equation in 3256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1753/2121 places, 2396/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4723 ms. Remains : 1753/2121 places, 2396/2578 transitions.
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 115 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2023-03-12 08:12:18] [INFO ] Computed 227 place invariants in 55 ms
[2023-03-12 08:12:21] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2023-03-12 08:12:21] [INFO ] Invariant cache hit.
[2023-03-12 08:12:27] [INFO ] Implicit Places using invariants and state equation in 6173 ms returned []
Implicit Place search using SMT with State Equation took 8864 ms to find 0 implicit places.
[2023-03-12 08:12:27] [INFO ] Invariant cache hit.
[2023-03-12 08:12:29] [INFO ] Dead Transitions using invariants and state equation in 2301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11281 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Treatment of property ASLink-PT-05b-LTLFireability-05 finished in 103449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 3 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2137 transition count 2650
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2137 transition count 2650
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 2135 transition count 2641
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 2135 transition count 2641
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2134 transition count 2640
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2134 transition count 2640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2133 transition count 2632
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2133 transition count 2632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2132 transition count 2624
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2132 transition count 2624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2131 transition count 2623
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2131 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2130 transition count 2615
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2130 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2129 transition count 2607
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2129 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2128 transition count 2606
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2128 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2127 transition count 2598
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2127 transition count 2598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2126 transition count 2590
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2126 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2125 transition count 2589
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2125 transition count 2589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2124 transition count 2581
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2124 transition count 2581
Applied a total of 32 rules in 1444 ms. Remains 2124 /2140 variables (removed 16) and now considering 2581/2665 (removed 84) transitions.
// Phase 1: matrix 2581 rows 2124 cols
[2023-03-12 08:12:31] [INFO ] Computed 227 place invariants in 51 ms
[2023-03-12 08:12:32] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2023-03-12 08:12:32] [INFO ] Invariant cache hit.
[2023-03-12 08:12:40] [INFO ] Implicit Places using invariants and state equation in 8133 ms returned []
Implicit Place search using SMT with State Equation took 9458 ms to find 0 implicit places.
[2023-03-12 08:12:40] [INFO ] Invariant cache hit.
[2023-03-12 08:12:42] [INFO ] Dead Transitions using invariants and state equation in 1914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2124/2140 places, 2581/2665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12822 ms. Remains : 2124/2140 places, 2581/2665 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1916 1) (EQ s2038 1)), p0:(EQ s1498 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-06 finished in 13085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2139 transition count 2274
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1749 transition count 2271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 1747 transition count 2271
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 785 place count 1747 transition count 1691
Deduced a syphon composed of 580 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1214 rules applied. Total rules applied 1999 place count 1113 transition count 1691
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2038 place count 1108 transition count 1657
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2072 place count 1074 transition count 1657
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2072 place count 1074 transition count 1636
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2135 place count 1032 transition count 1636
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2135 place count 1032 transition count 1616
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2175 place count 1012 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2178 place count 1009 transition count 1601
Iterating global reduction 5 with 3 rules applied. Total rules applied 2181 place count 1009 transition count 1601
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2183 place count 1007 transition count 1592
Iterating global reduction 5 with 2 rules applied. Total rules applied 2185 place count 1007 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2186 place count 1006 transition count 1584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2187 place count 1006 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2188 place count 1005 transition count 1576
Iterating global reduction 5 with 1 rules applied. Total rules applied 2189 place count 1005 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2190 place count 1004 transition count 1568
Iterating global reduction 5 with 1 rules applied. Total rules applied 2191 place count 1004 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 1003 transition count 1560
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 1003 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1002 transition count 1552
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1002 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1001 transition count 1544
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1001 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2198 place count 1000 transition count 1536
Iterating global reduction 5 with 1 rules applied. Total rules applied 2199 place count 1000 transition count 1536
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2541 place count 828 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2545 place count 824 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2550 place count 823 transition count 1362
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2551 place count 823 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2552 place count 822 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2552 place count 822 transition count 1360
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2554 place count 821 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2556 place count 819 transition count 1358
Iterating global reduction 7 with 2 rules applied. Total rules applied 2558 place count 819 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2560 place count 819 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2561 place count 818 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2563 place count 817 transition count 1361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2565 place count 815 transition count 1359
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2580 place count 805 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2585 place count 800 transition count 1354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2585 place count 800 transition count 1339
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2616 place count 784 transition count 1339
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2627 place count 773 transition count 1339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2627 place count 773 transition count 1338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2629 place count 772 transition count 1338
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2661 place count 756 transition count 1322
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2671 place count 746 transition count 1312
Iterating global reduction 12 with 10 rules applied. Total rules applied 2681 place count 746 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2686 place count 741 transition count 1307
Iterating global reduction 12 with 5 rules applied. Total rules applied 2691 place count 741 transition count 1307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2696 place count 741 transition count 1302
Applied a total of 2696 rules in 772 ms. Remains 741 /2140 variables (removed 1399) and now considering 1302/2665 (removed 1363) transitions.
// Phase 1: matrix 1302 rows 741 cols
[2023-03-12 08:12:43] [INFO ] Computed 122 place invariants in 19 ms
[2023-03-12 08:12:45] [INFO ] Implicit Places using invariants in 1285 ms returned [1, 18, 19, 31, 48, 66, 87, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 627, 638, 639, 640, 658, 679, 680, 681, 682]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1288 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 692/2140 places, 1302/2665 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 692 transition count 1214
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 604 transition count 1214
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 604 transition count 1187
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 576 transition count 1187
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 572 transition count 1179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 564 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 561 transition count 1176
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 561 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 260 place count 561 transition count 1173
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 342 place count 520 transition count 1132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 346 place count 518 transition count 1133
Applied a total of 346 rules in 72 ms. Remains 518 /692 variables (removed 174) and now considering 1133/1302 (removed 169) transitions.
// Phase 1: matrix 1133 rows 518 cols
[2023-03-12 08:12:45] [INFO ] Computed 68 place invariants in 28 ms
[2023-03-12 08:12:45] [INFO ] Implicit Places using invariants in 612 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 351, 357, 362, 439, 445, 450, 515]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 618 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/2140 places, 1133/2665 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 1132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 491 transition count 1122
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 491 transition count 1122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 481 transition count 1112
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 481 transition count 1112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 476 transition count 1107
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 476 transition count 1107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 471 transition count 1102
Applied a total of 62 rules in 71 ms. Remains 471 /502 variables (removed 31) and now considering 1102/1133 (removed 31) transitions.
// Phase 1: matrix 1102 rows 471 cols
[2023-03-12 08:12:45] [INFO ] Computed 52 place invariants in 7 ms
[2023-03-12 08:12:46] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-12 08:12:46] [INFO ] Invariant cache hit.
[2023-03-12 08:12:47] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 471/2140 places, 1102/2665 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4307 ms. Remains : 471/2140 places, 1102/2665 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 185 steps with 0 reset in 15 ms.
FORMULA ASLink-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-08 finished in 4433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(G(p1)))))'
Support contains 5 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2137 transition count 2655
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2137 transition count 2655
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 2135 transition count 2646
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 2135 transition count 2646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 2133 transition count 2644
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 2133 transition count 2644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2132 transition count 2636
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2132 transition count 2636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2131 transition count 2628
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2131 transition count 2628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2130 transition count 2627
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2130 transition count 2627
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2129 transition count 2619
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2129 transition count 2619
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2128 transition count 2611
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2128 transition count 2611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2127 transition count 2610
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2127 transition count 2610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2126 transition count 2602
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2126 transition count 2602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2125 transition count 2594
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2125 transition count 2594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2124 transition count 2593
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2124 transition count 2593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2123 transition count 2585
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2123 transition count 2585
Applied a total of 34 rules in 1497 ms. Remains 2123 /2140 variables (removed 17) and now considering 2585/2665 (removed 80) transitions.
// Phase 1: matrix 2585 rows 2123 cols
[2023-03-12 08:12:49] [INFO ] Computed 227 place invariants in 48 ms
[2023-03-12 08:12:50] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2023-03-12 08:12:50] [INFO ] Invariant cache hit.
[2023-03-12 08:12:54] [INFO ] Implicit Places using invariants and state equation in 4359 ms returned []
Implicit Place search using SMT with State Equation took 5583 ms to find 0 implicit places.
[2023-03-12 08:12:54] [INFO ] Invariant cache hit.
[2023-03-12 08:12:56] [INFO ] Dead Transitions using invariants and state equation in 1974 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2140 places, 2585/2665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9059 ms. Remains : 2123/2140 places, 2585/2665 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1202 1) (EQ s1341 1)), p1:(AND (OR (EQ s88 0) (EQ s236 0)) (EQ s2011 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-09 finished in 9424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2139 transition count 2274
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1749 transition count 2271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 1747 transition count 2271
Performed 579 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 579 Pre rules applied. Total rules applied 785 place count 1747 transition count 1692
Deduced a syphon composed of 579 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1212 rules applied. Total rules applied 1997 place count 1114 transition count 1692
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2036 place count 1109 transition count 1658
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2070 place count 1075 transition count 1658
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2070 place count 1075 transition count 1637
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2133 place count 1033 transition count 1637
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2133 place count 1033 transition count 1617
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2173 place count 1013 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2176 place count 1010 transition count 1602
Iterating global reduction 5 with 3 rules applied. Total rules applied 2179 place count 1010 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2181 place count 1008 transition count 1593
Iterating global reduction 5 with 2 rules applied. Total rules applied 2183 place count 1008 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2184 place count 1007 transition count 1585
Iterating global reduction 5 with 1 rules applied. Total rules applied 2185 place count 1007 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2186 place count 1006 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 2187 place count 1006 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2188 place count 1005 transition count 1569
Iterating global reduction 5 with 1 rules applied. Total rules applied 2189 place count 1005 transition count 1569
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2190 place count 1004 transition count 1561
Iterating global reduction 5 with 1 rules applied. Total rules applied 2191 place count 1004 transition count 1561
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 1003 transition count 1553
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 1003 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1002 transition count 1545
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1002 transition count 1545
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1001 transition count 1537
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1001 transition count 1537
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2539 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2543 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2548 place count 824 transition count 1363
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2549 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2550 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2550 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2552 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2554 place count 820 transition count 1359
Iterating global reduction 7 with 2 rules applied. Total rules applied 2556 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2558 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2559 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2561 place count 818 transition count 1362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2563 place count 816 transition count 1360
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2578 place count 806 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2583 place count 801 transition count 1355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2583 place count 801 transition count 1340
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2614 place count 785 transition count 1340
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2625 place count 774 transition count 1340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2625 place count 774 transition count 1339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2627 place count 773 transition count 1339
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2659 place count 757 transition count 1323
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2669 place count 747 transition count 1313
Iterating global reduction 12 with 10 rules applied. Total rules applied 2679 place count 747 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2684 place count 742 transition count 1308
Iterating global reduction 12 with 5 rules applied. Total rules applied 2689 place count 742 transition count 1308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2694 place count 742 transition count 1303
Applied a total of 2694 rules in 694 ms. Remains 742 /2140 variables (removed 1398) and now considering 1303/2665 (removed 1362) transitions.
// Phase 1: matrix 1303 rows 742 cols
[2023-03-12 08:12:57] [INFO ] Computed 122 place invariants in 28 ms
[2023-03-12 08:12:58] [INFO ] Implicit Places using invariants in 601 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 628, 639, 640, 641, 659, 680, 681, 682, 683]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 603 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 693/2140 places, 1303/2665 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 693 transition count 1215
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 605 transition count 1215
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 605 transition count 1188
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 577 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 573 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 565 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 562 transition count 1177
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 562 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 562 transition count 1174
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 342 place count 521 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 346 place count 519 transition count 1134
Applied a total of 346 rules in 64 ms. Remains 519 /693 variables (removed 174) and now considering 1134/1303 (removed 169) transitions.
// Phase 1: matrix 1134 rows 519 cols
[2023-03-12 08:12:58] [INFO ] Computed 68 place invariants in 21 ms
[2023-03-12 08:12:58] [INFO ] Implicit Places using invariants in 363 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 352, 358, 363, 440, 446, 451, 516]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 378 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 503/2140 places, 1134/2665 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 503 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 1133
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 492 transition count 1123
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 492 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 482 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 482 transition count 1113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 477 transition count 1108
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 477 transition count 1108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 472 transition count 1103
Applied a total of 62 rules in 53 ms. Remains 472 /503 variables (removed 31) and now considering 1103/1134 (removed 31) transitions.
// Phase 1: matrix 1103 rows 472 cols
[2023-03-12 08:12:58] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-12 08:12:59] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-12 08:12:59] [INFO ] Invariant cache hit.
[2023-03-12 08:13:00] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 472/2140 places, 1103/2665 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3286 ms. Remains : 472/2140 places, 1103/2665 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-11 finished in 3390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Found a Lengthening insensitive property : ASLink-PT-05b-LTLFireability-05
Stuttering acceptance computed with spot in 262 ms :[true, p0, (NOT p0), false, false]
Support contains 2 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2140/2140 places, 2665/2665 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2139 transition count 2273
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 394 rules applied. Total rules applied 785 place count 1748 transition count 2270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 787 place count 1746 transition count 2270
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 787 place count 1746 transition count 1690
Deduced a syphon composed of 580 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1214 rules applied. Total rules applied 2001 place count 1112 transition count 1690
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2040 place count 1107 transition count 1656
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2074 place count 1073 transition count 1656
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2074 place count 1073 transition count 1635
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2137 place count 1031 transition count 1635
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2137 place count 1031 transition count 1615
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2177 place count 1011 transition count 1615
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2180 place count 1008 transition count 1600
Iterating global reduction 5 with 3 rules applied. Total rules applied 2183 place count 1008 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2185 place count 1006 transition count 1591
Iterating global reduction 5 with 2 rules applied. Total rules applied 2187 place count 1006 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2188 place count 1005 transition count 1583
Iterating global reduction 5 with 1 rules applied. Total rules applied 2189 place count 1005 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2190 place count 1004 transition count 1575
Iterating global reduction 5 with 1 rules applied. Total rules applied 2191 place count 1004 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2192 place count 1003 transition count 1567
Iterating global reduction 5 with 1 rules applied. Total rules applied 2193 place count 1003 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1002 transition count 1559
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1002 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1001 transition count 1551
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1001 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2198 place count 1000 transition count 1543
Iterating global reduction 5 with 1 rules applied. Total rules applied 2199 place count 1000 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2200 place count 999 transition count 1535
Iterating global reduction 5 with 1 rules applied. Total rules applied 2201 place count 999 transition count 1535
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 5 with 336 rules applied. Total rules applied 2537 place count 830 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2541 place count 826 transition count 1364
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2546 place count 825 transition count 1364
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2547 place count 825 transition count 1363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2548 place count 824 transition count 1363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2548 place count 824 transition count 1362
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2550 place count 823 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2552 place count 821 transition count 1360
Iterating global reduction 7 with 2 rules applied. Total rules applied 2554 place count 821 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2556 place count 821 transition count 1358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2557 place count 820 transition count 1358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2559 place count 819 transition count 1363
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2561 place count 819 transition count 1363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2563 place count 817 transition count 1361
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2578 place count 807 transition count 1356
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2583 place count 802 transition count 1356
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2583 place count 802 transition count 1341
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2614 place count 786 transition count 1341
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2625 place count 775 transition count 1341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2625 place count 775 transition count 1340
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2627 place count 774 transition count 1340
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2659 place count 758 transition count 1324
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2669 place count 748 transition count 1314
Iterating global reduction 12 with 10 rules applied. Total rules applied 2679 place count 748 transition count 1314
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2683 place count 744 transition count 1310
Iterating global reduction 12 with 4 rules applied. Total rules applied 2687 place count 744 transition count 1310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2691 place count 744 transition count 1306
Applied a total of 2691 rules in 680 ms. Remains 744 /2140 variables (removed 1396) and now considering 1306/2665 (removed 1359) transitions.
// Phase 1: matrix 1306 rows 744 cols
[2023-03-12 08:13:01] [INFO ] Computed 122 place invariants in 38 ms
[2023-03-12 08:13:02] [INFO ] Implicit Places using invariants in 787 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 151, 207, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 630, 641, 642, 643, 661, 682, 683, 684, 685]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 789 ms to find 47 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 697/2140 places, 1306/2665 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 697 transition count 1223
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 614 transition count 1223
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 166 place count 614 transition count 1196
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 221 place count 586 transition count 1196
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 233 place count 582 transition count 1188
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 241 place count 574 transition count 1188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 571 transition count 1185
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 571 transition count 1185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 250 place count 571 transition count 1182
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 326 place count 533 transition count 1144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 330 place count 531 transition count 1145
Applied a total of 330 rules in 122 ms. Remains 531 /697 variables (removed 166) and now considering 1145/1306 (removed 161) transitions.
// Phase 1: matrix 1145 rows 531 cols
[2023-03-12 08:13:02] [INFO ] Computed 70 place invariants in 21 ms
[2023-03-12 08:13:02] [INFO ] Implicit Places using invariants in 413 ms returned [88, 94, 99, 184, 192, 198, 276, 282, 287, 364, 370, 375, 452, 458, 463, 528]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 427 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 515/2140 places, 1145/2665 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 1144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 504 transition count 1134
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 504 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 494 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 494 transition count 1124
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 488 transition count 1118
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 488 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 487 transition count 1117
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 487 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 486 transition count 1116
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 486 transition count 1116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 481 transition count 1111
Applied a total of 68 rules in 72 ms. Remains 481 /515 variables (removed 34) and now considering 1111/1145 (removed 34) transitions.
// Phase 1: matrix 1111 rows 481 cols
[2023-03-12 08:13:02] [INFO ] Computed 54 place invariants in 20 ms
[2023-03-12 08:13:03] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-12 08:13:03] [INFO ] Invariant cache hit.
[2023-03-12 08:13:04] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 481/2140 places, 1111/2665 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3662 ms. Remains : 481/2140 places, 1111/2665 transitions.
Running random walk in product with property : ASLink-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s134 1) (NEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1404 reset in 273 ms.
Product exploration explored 100000 steps with 1351 reset in 310 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 143 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469257 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469257 steps, saw 127105 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:13:08] [INFO ] Invariant cache hit.
[2023-03-12 08:13:08] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:08] [INFO ] [Real]Absence check using 12 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-12 08:13:08] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 08:13:09] [INFO ] [Nat]Absence check using 12 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-12 08:13:09] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:09] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-12 08:13:09] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1111/1111 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 481 transition count 1086
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 55 place count 456 transition count 1081
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 456 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 85 place count 441 transition count 1066
Applied a total of 85 rules in 92 ms. Remains 441 /481 variables (removed 40) and now considering 1066/1111 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 441/481 places, 1066/1111 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 488736 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488736 steps, saw 138278 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1066 rows 441 cols
[2023-03-12 08:13:12] [INFO ] Computed 54 place invariants in 19 ms
[2023-03-12 08:13:13] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 08:13:13] [INFO ] [Real]Absence check using 11 positive and 43 generalized place invariants in 195 ms returned sat
[2023-03-12 08:13:13] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 50 ms returned sat
[2023-03-12 08:13:13] [INFO ] [Nat]Absence check using 11 positive and 43 generalized place invariants in 75 ms returned sat
[2023-03-12 08:13:14] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:14] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-12 08:13:14] [INFO ] After 941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 441/441 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2023-03-12 08:13:14] [INFO ] Invariant cache hit.
[2023-03-12 08:13:15] [INFO ] Implicit Places using invariants in 395 ms returned [88, 89, 169, 170, 240, 241, 311, 312]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 396 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 436 ms. Remains : 433/441 places, 1066/1066 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 522962 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 522962 steps, saw 148406 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1066 rows 433 cols
[2023-03-12 08:13:18] [INFO ] Computed 46 place invariants in 7 ms
[2023-03-12 08:13:18] [INFO ] [Real]Absence check using 13 positive place invariants in 68 ms returned sat
[2023-03-12 08:13:18] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 55 ms returned sat
[2023-03-12 08:13:18] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:18] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 13 ms returned sat
[2023-03-12 08:13:19] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:19] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-12 08:13:19] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 23 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2023-03-12 08:13:19] [INFO ] Invariant cache hit.
[2023-03-12 08:13:20] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-12 08:13:20] [INFO ] Invariant cache hit.
[2023-03-12 08:13:22] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2023-03-12 08:13:22] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-12 08:13:22] [INFO ] Invariant cache hit.
[2023-03-12 08:13:22] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3073 ms. Remains : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 08:13:22] [INFO ] Invariant cache hit.
[2023-03-12 08:13:22] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 08:13:22] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 21 ms returned sat
[2023-03-12 08:13:23] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:23] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 43 ms returned sat
[2023-03-12 08:13:23] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:23] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 08:13:23] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 1111/1111 transitions.
Applied a total of 0 rules in 22 ms. Remains 481 /481 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 481 cols
[2023-03-12 08:13:24] [INFO ] Computed 54 place invariants in 20 ms
[2023-03-12 08:13:25] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 08:13:25] [INFO ] Invariant cache hit.
[2023-03-12 08:13:27] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2023-03-12 08:13:27] [INFO ] Invariant cache hit.
[2023-03-12 08:13:27] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3308 ms. Remains : 481/481 places, 1111/1111 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 453914 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 453914 steps, saw 122611 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:13:31] [INFO ] Invariant cache hit.
[2023-03-12 08:13:31] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 08:13:31] [INFO ] [Real]Absence check using 12 positive and 42 generalized place invariants in 46 ms returned sat
[2023-03-12 08:13:32] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:32] [INFO ] [Nat]Absence check using 12 positive and 42 generalized place invariants in 56 ms returned sat
[2023-03-12 08:13:32] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:32] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-12 08:13:32] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1111/1111 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 481 transition count 1086
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 55 place count 456 transition count 1081
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 456 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 85 place count 441 transition count 1066
Applied a total of 85 rules in 137 ms. Remains 441 /481 variables (removed 40) and now considering 1066/1111 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 441/481 places, 1066/1111 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499060 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499060 steps, saw 141350 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1066 rows 441 cols
[2023-03-12 08:13:36] [INFO ] Computed 54 place invariants in 20 ms
[2023-03-12 08:13:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:36] [INFO ] [Real]Absence check using 11 positive and 43 generalized place invariants in 19 ms returned sat
[2023-03-12 08:13:36] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 08:13:36] [INFO ] [Nat]Absence check using 11 positive and 43 generalized place invariants in 18 ms returned sat
[2023-03-12 08:13:37] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:37] [INFO ] After 727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-12 08:13:37] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 18 ms. Remains 441 /441 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 441/441 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2023-03-12 08:13:37] [INFO ] Invariant cache hit.
[2023-03-12 08:13:38] [INFO ] Implicit Places using invariants in 465 ms returned [88, 89, 169, 170, 240, 241, 311, 312]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 482 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 433/441 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 513 ms. Remains : 433/441 places, 1066/1066 transitions.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497184 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497184 steps, saw 140785 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1066 rows 433 cols
[2023-03-12 08:13:41] [INFO ] Computed 46 place invariants in 18 ms
[2023-03-12 08:13:41] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:41] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 66 ms returned sat
[2023-03-12 08:13:42] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 08:13:42] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 109 ms returned sat
[2023-03-12 08:13:42] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:42] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 08:13:42] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 23 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2023-03-12 08:13:42] [INFO ] Invariant cache hit.
[2023-03-12 08:13:43] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-12 08:13:43] [INFO ] Invariant cache hit.
[2023-03-12 08:13:45] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
[2023-03-12 08:13:45] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 08:13:45] [INFO ] Invariant cache hit.
[2023-03-12 08:13:46] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3499 ms. Remains : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 24 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 08:13:46] [INFO ] Invariant cache hit.
[2023-03-12 08:13:46] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 08:13:46] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 20 ms returned sat
[2023-03-12 08:13:46] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:13:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 08:13:47] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 44 ms returned sat
[2023-03-12 08:13:47] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:13:47] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-12 08:13:47] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1387 reset in 249 ms.
Product exploration explored 100000 steps with 1374 reset in 292 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 1111/1111 transitions.
Applied a total of 0 rules in 34 ms. Remains 481 /481 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2023-03-12 08:13:49] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1111 rows 481 cols
[2023-03-12 08:13:49] [INFO ] Computed 54 place invariants in 8 ms
[2023-03-12 08:13:50] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1207 ms. Remains : 481/481 places, 1111/1111 transitions.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 1111/1111 transitions.
Applied a total of 0 rules in 8 ms. Remains 481 /481 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2023-03-12 08:13:50] [INFO ] Invariant cache hit.
[2023-03-12 08:13:50] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-12 08:13:50] [INFO ] Invariant cache hit.
[2023-03-12 08:13:52] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-12 08:13:52] [INFO ] Invariant cache hit.
[2023-03-12 08:13:52] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2142 ms. Remains : 481/481 places, 1111/1111 transitions.
Treatment of property ASLink-PT-05b-LTLFireability-05 finished in 52422 ms.
[2023-03-12 08:13:52] [INFO ] Flatten gal took : 96 ms
[2023-03-12 08:13:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 08:13:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2140 places, 2665 transitions and 8305 arcs took 14 ms.
Total runtime 295359 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1390/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ASLink-PT-05b-LTLFireability-05

BK_STOP 1678608834748

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ASLink-PT-05b-LTLFireability-05
ltl formula formula --ltl=/tmp/1390/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2140 places, 2665 transitions and 8305 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.260 user 0.430 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1390/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ASLink-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-05b, 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 r009-oct2-167813597400084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;