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

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11429.363 3600000.00 12647064.00 5061.10 ?FFFFTTFF?TFTFFF 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.r293-tall-167873945300380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-COL-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945300380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.9K Feb 26 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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 PolyORBLF-COL-S02J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678842341042

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-15 01:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 01:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:05:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 01:05:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 01:05:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1348 ms
[2023-03-15 01:05:43] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 01:05:44] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2023-03-15 01:05:44] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 6 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:05:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 01:05:44] [INFO ] Computed 26 place invariants in 11 ms
[2023-03-15 01:05:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 01:05:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 01:05:44] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-15 01:05:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 01:05:44] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 01:05:44] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 01:05:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 01:05:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-15 01:05:44] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 01:05:45] [INFO ] After 49ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 01:05:45] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 01:05:45] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 42 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
[2023-03-15 01:05:45] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2023-03-15 01:05:45] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-15 01:05:45] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 116 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-15 01:05:45] [INFO ] Flatten gal took : 29 ms
[2023-03-15 01:05:45] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-15 01:05:45] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 30 ms.
[2023-03-15 01:05:45] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 405 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Applied a total of 16 rules in 121 ms. Remains 682 /690 variables (removed 8) and now considering 1298/1306 (removed 8) transitions.
[2023-03-15 01:05:45] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 682 cols
[2023-03-15 01:05:45] [INFO ] Computed 54 place invariants in 63 ms
[2023-03-15 01:05:46] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2023-03-15 01:05:46] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
// Phase 1: matrix 1194 rows 682 cols
[2023-03-15 01:05:46] [INFO ] Computed 54 place invariants in 44 ms
[2023-03-15 01:05:46] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-15 01:05:46] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
[2023-03-15 01:05:46] [INFO ] Invariant cache hit.
[2023-03-15 01:05:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:05:50] [INFO ] Implicit Places using invariants and state equation in 3586 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/690 places, 1210/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1194
Reduce places removed 8 places and 16 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 672 transition count 1178
Deduced a syphon composed of 8 places in 3 ms
Applied a total of 10 rules in 21 ms. Remains 672 /682 variables (removed 10) and now considering 1178/1210 (removed 32) transitions.
[2023-03-15 01:05:50] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2023-03-15 01:05:50] [INFO ] Computed 62 place invariants in 33 ms
[2023-03-15 01:05:50] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-15 01:05:50] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-15 01:05:50] [INFO ] Invariant cache hit.
[2023-03-15 01:05:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:05:53] [INFO ] Implicit Places using invariants and state equation in 2885 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 672/690 places, 1178/1306 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8158 ms. Remains : 672/690 places, 1178/1306 transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Support contains 397 out of 664 places after structural reductions.
[2023-03-15 01:05:53] [INFO ] Flatten gal took : 104 ms
[2023-03-15 01:05:53] [INFO ] Flatten gal took : 101 ms
[2023-03-15 01:05:54] [INFO ] Input system was already deterministic with 1178 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:05:54] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 664 cols
[2023-03-15 01:05:54] [INFO ] Computed 54 place invariants in 32 ms
[2023-03-15 01:05:54] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-15 01:05:54] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 35 ms returned sat
[2023-03-15 01:05:54] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 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(X((G(F((p1||G(p2))))||p0))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 656 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 656 transition count 1170
Applied a total of 16 rules in 32 ms. Remains 656 /664 variables (removed 8) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:05:54] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 656 cols
[2023-03-15 01:05:54] [INFO ] Computed 54 place invariants in 22 ms
[2023-03-15 01:05:55] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
[2023-03-15 01:05:55] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:05:55] [INFO ] Invariant cache hit.
[2023-03-15 01:05:55] [INFO ] Implicit Places using invariants in 442 ms returned [514, 515, 516, 517, 518, 519, 520, 521]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 446 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 648/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 18 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1046 ms. Remains : 648/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s337 1) (GEQ s338 1) (GEQ s357 1) (GEQ s447 1)) (AND (GEQ s337 1) (GEQ s339 1) (GEQ s358 1) (GEQ s447 1))), p2:(AND (LT s534 1) (LT s535 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 194 reset in 424 ms.
Product exploration explored 100000 steps with 187 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 276 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:05:57] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 648 cols
[2023-03-15 01:05:57] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-15 01:05:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2)) p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (OR (AND p1 p0) (AND (NOT p2) p0))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 400 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 234 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Applied a total of 0 rules in 15 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:05:58] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:05:58] [INFO ] Invariant cache hit.
[2023-03-15 01:05:59] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
[2023-03-15 01:05:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:05:59] [INFO ] Invariant cache hit.
[2023-03-15 01:05:59] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-15 01:05:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:05:59] [INFO ] Invariant cache hit.
[2023-03-15 01:05:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:06:04] [INFO ] Implicit Places using invariants and state equation in 5201 ms returned []
Implicit Place search using SMT with State Equation took 5603 ms to find 0 implicit places.
[2023-03-15 01:06:04] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:06:04] [INFO ] Invariant cache hit.
[2023-03-15 01:06:05] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6626 ms. Remains : 648/648 places, 1170/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:06:05] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:06:05] [INFO ] Invariant cache hit.
[2023-03-15 01:06:06] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p2 p0))), (F (OR (AND p1 p0) (AND (NOT p2) p0))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 697 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 259 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 242 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Product exploration explored 100000 steps with 261 reset in 268 ms.
Product exploration explored 100000 steps with 270 reset in 297 ms.
Applying partial POR strategy [true, true, true, false, false, true]
Stuttering acceptance computed with spot in 260 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 648 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 32 place count 648 transition count 1258
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 120 place count 648 transition count 1258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 632 transition count 1242
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 632 transition count 1242
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 184 place count 632 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 208 place count 608 transition count 1218
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 232 place count 608 transition count 1218
Deduced a syphon composed of 120 places in 1 ms
Applied a total of 232 rules in 147 ms. Remains 608 /648 variables (removed 40) and now considering 1218/1170 (removed -48) transitions.
[2023-03-15 01:06:08] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
// Phase 1: matrix 1202 rows 608 cols
[2023-03-15 01:06:08] [INFO ] Computed 46 place invariants in 17 ms
[2023-03-15 01:06:09] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
[2023-03-15 01:06:09] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-15 01:06:09] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
[2023-03-15 01:06:09] [INFO ] Invariant cache hit.
[2023-03-15 01:06:09] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 608/648 places, 1218/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1269 ms. Remains : 608/648 places, 1218/1170 transitions.
Built C files in :
/tmp/ltsmin4790975801274792367
[2023-03-15 01:06:09] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4790975801274792367
Running compilation step : cd /tmp/ltsmin4790975801274792367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2396 ms.
Running link step : cd /tmp/ltsmin4790975801274792367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4790975801274792367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13287112976823149494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Applied a total of 0 rules in 20 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:06:24] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 648 cols
[2023-03-15 01:06:24] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-15 01:06:25] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
[2023-03-15 01:06:25] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:06:25] [INFO ] Invariant cache hit.
[2023-03-15 01:06:25] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-15 01:06:25] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:06:25] [INFO ] Invariant cache hit.
[2023-03-15 01:06:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:06:31] [INFO ] Implicit Places using invariants and state equation in 5750 ms returned []
Implicit Place search using SMT with State Equation took 6183 ms to find 0 implicit places.
[2023-03-15 01:06:31] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:06:31] [INFO ] Invariant cache hit.
[2023-03-15 01:06:32] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7275 ms. Remains : 648/648 places, 1170/1170 transitions.
Built C files in :
/tmp/ltsmin16288537261171655966
[2023-03-15 01:06:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16288537261171655966
Running compilation step : cd /tmp/ltsmin16288537261171655966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2142 ms.
Running link step : cd /tmp/ltsmin16288537261171655966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16288537261171655966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6304320181581491967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 01:06:47] [INFO ] Flatten gal took : 58 ms
[2023-03-15 01:06:47] [INFO ] Flatten gal took : 56 ms
[2023-03-15 01:06:47] [INFO ] Time to serialize gal into /tmp/LTL5320316842933275732.gal : 8 ms
[2023-03-15 01:06:47] [INFO ] Time to serialize properties into /tmp/LTL6718862894236781436.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5320316842933275732.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12864289174224834231.hoa' '-atoms' '/tmp/LTL6718862894236781436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6718862894236781436.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12864289174224834231.hoa
Detected timeout of ITS tools.
[2023-03-15 01:07:02] [INFO ] Flatten gal took : 59 ms
[2023-03-15 01:07:02] [INFO ] Flatten gal took : 47 ms
[2023-03-15 01:07:02] [INFO ] Time to serialize gal into /tmp/LTL1709713042126193400.gal : 10 ms
[2023-03-15 01:07:02] [INFO ] Time to serialize properties into /tmp/LTL10751009008853526772.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1709713042126193400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10751009008853526772.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(((G(F(("((((CanInjectEvent_0<1)||(DataOnSrc_0<1))||((PlaceSources_0<1)||(cSources_0<1)))&&(((CanInjectEvent_0<1)||(DataOnSrc_1<...503
Formula 0 simplified : XX(!"(((CanInjectEvent_0>=1)&&(DataOnSrc_0>=1))&&((PlaceSources_0>=1)&&(cSources_0>=1)))" & !"(((CanInjectEvent_0>=1)&&(DataOnSrc_1>...490
Detected timeout of ITS tools.
[2023-03-15 01:07:17] [INFO ] Flatten gal took : 45 ms
[2023-03-15 01:07:17] [INFO ] Applying decomposition
[2023-03-15 01:07:17] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph695211583666793145.txt' '-o' '/tmp/graph695211583666793145.bin' '-w' '/tmp/graph695211583666793145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph695211583666793145.bin' '-l' '-1' '-v' '-w' '/tmp/graph695211583666793145.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:07:18] [INFO ] Decomposing Gal with order
[2023-03-15 01:07:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:07:18] [INFO ] Removed a total of 1207 redundant transitions.
[2023-03-15 01:07:18] [INFO ] Flatten gal took : 197 ms
[2023-03-15 01:07:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 39 ms.
[2023-03-15 01:07:18] [INFO ] Time to serialize gal into /tmp/LTL168672584531774962.gal : 14 ms
[2023-03-15 01:07:18] [INFO ] Time to serialize properties into /tmp/LTL4452427959448317981.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL168672584531774962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4452427959448317981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(((G(F(("((((i8.u96.CanInjectEvent_0<1)||(i2.i0.u23.DataOnSrc_0<1))||((i2.i0.u23.PlaceSources_0<1)||(i8.u96.cSources_0<1)))&&(((...718
Formula 0 simplified : XX(!"(((i8.u96.CanInjectEvent_0>=1)&&(i2.i0.u23.DataOnSrc_0>=1))&&((i2.i0.u23.PlaceSources_0>=1)&&(i8.u96.cSources_0>=1)))" & !"(((i...705
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6587548325736874448
[2023-03-15 01:07:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6587548325736874448
Running compilation step : cd /tmp/ltsmin6587548325736874448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2022 ms.
Running link step : cd /tmp/ltsmin6587548325736874448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6587548325736874448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 113885 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)||G(p1))))'
Support contains 19 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 662 transition count 1130
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 614 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 384 place count 470 transition count 986
Applied a total of 384 rules in 67 ms. Remains 470 /664 variables (removed 194) and now considering 986/1178 (removed 192) transitions.
[2023-03-15 01:07:48] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
// Phase 1: matrix 970 rows 470 cols
[2023-03-15 01:07:48] [INFO ] Computed 52 place invariants in 12 ms
[2023-03-15 01:07:49] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2023-03-15 01:07:49] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
[2023-03-15 01:07:49] [INFO ] Invariant cache hit.
[2023-03-15 01:07:49] [INFO ] Implicit Places using invariants in 366 ms returned [416, 417, 418, 419, 420, 421, 422, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 368 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/664 places, 986/1178 transitions.
Applied a total of 0 rules in 27 ms. Remains 462 /462 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 909 ms. Remains : 462/664 places, 986/1178 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s285 1) (LT s433 1)) (OR (LT s286 1) (LT s433 1)) (OR (LT s281 1) (LT s433 1)) (OR (LT s284 1) (LT s433 1)) (OR (LT s283 1) (LT s433 1)) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 47 reset in 556 ms.
Stack based approach found an accepted trace after 275 steps with 0 reset with depth 276 and stack size 276 in 2 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 1522 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 16 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 416 place count 454 transition count 970
Applied a total of 416 rules in 51 ms. Remains 454 /664 variables (removed 210) and now considering 970/1178 (removed 208) transitions.
[2023-03-15 01:07:50] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 454 cols
[2023-03-15 01:07:50] [INFO ] Computed 52 place invariants in 17 ms
[2023-03-15 01:07:50] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
[2023-03-15 01:07:50] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:07:50] [INFO ] Invariant cache hit.
[2023-03-15 01:07:51] [INFO ] Implicit Places using invariants in 326 ms returned [408, 409, 410, 411, 412, 413, 414, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 328 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/664 places, 970/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 438 transition count 962
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 438 transition count 962
Applied a total of 16 rules in 24 ms. Remains 438 /446 variables (removed 8) and now considering 962/970 (removed 8) transitions.
[2023-03-15 01:07:51] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
// Phase 1: matrix 946 rows 438 cols
[2023-03-15 01:07:51] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 01:07:51] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-15 01:07:51] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:07:51] [INFO ] Invariant cache hit.
[2023-03-15 01:07:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:07:56] [INFO ] Implicit Places using invariants and state equation in 5114 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 438/664 places, 962/1178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6292 ms. Remains : 438/664 places, 962/1178 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02 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 (OR (LT s185 1) (LT s248 1) (LT s251 1)) (OR (LT s185 1) (LT s248 1) (LT s253 1)) (OR (LT s190 1) (LT s248 1) (LT s252 1)) (OR (LT s190 1) (LT s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 32 reset in 746 ms.
Stack based approach found an accepted trace after 1195 steps with 1 reset with depth 801 and stack size 801 in 10 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 7110 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 27 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 606 transition count 1058
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 542 transition count 1058
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 478 transition count 994
Applied a total of 368 rules in 42 ms. Remains 478 /664 variables (removed 186) and now considering 994/1178 (removed 184) transitions.
[2023-03-15 01:07:57] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 478 cols
[2023-03-15 01:07:57] [INFO ] Computed 52 place invariants in 14 ms
[2023-03-15 01:07:57] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
[2023-03-15 01:07:57] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
[2023-03-15 01:07:57] [INFO ] Invariant cache hit.
[2023-03-15 01:07:58] [INFO ] Implicit Places using invariants in 346 ms returned [424, 425, 426, 427, 428, 429, 430, 431]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 348 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/664 places, 994/1178 transitions.
Applied a total of 0 rules in 16 ms. Remains 470 /470 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 834 ms. Remains : 470/664 places, 994/1178 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-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:(OR (AND (GEQ s172 1) (GEQ s173 1) (GEQ s174 1)) (AND (GEQ s172 1) (GEQ s173 1) (GEQ s182 1)) (AND (GEQ s172 1) (GEQ s173 1) (GEQ s181 1)) (AND (GEQ s1...], 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 803 steps with 0 reset in 7 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 909 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((X((X(G(p1)) U (p2&&X(G(p1)))))||p0)))'
Support contains 17 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 25 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:07:58] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:07:58] [INFO ] Computed 52 place invariants in 16 ms
[2023-03-15 01:07:58] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
[2023-03-15 01:07:58] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:07:58] [INFO ] Invariant cache hit.
[2023-03-15 01:07:59] [INFO ] Implicit Places using invariants in 433 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 444 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 13 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 985 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s351 1) (GEQ s357 1)) (AND (GEQ s346 1) (GEQ s357 1)) (AND (GEQ s347 1) (GEQ s357 1)) (AND (GEQ s349 1) (GEQ s357 1)) (AND (GEQ s348 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-04 finished in 1196 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)||F((p0&&F(p1)))))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 21 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:07:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:07:59] [INFO ] Invariant cache hit.
[2023-03-15 01:07:59] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
[2023-03-15 01:07:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:07:59] [INFO ] Invariant cache hit.
[2023-03-15 01:08:00] [INFO ] Implicit Places using invariants in 421 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 422 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 7 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 901 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GEQ s199 1) (GEQ s198 1) (GEQ s203 1) (GEQ s202 1) (GEQ s201 1) (GEQ s200 1) (GEQ s207 1) (GEQ s206 1) (GEQ s205 1) (GEQ s204 1) (GEQ s211 1) (GEQ...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1680 reset in 331 ms.
Product exploration explored 100000 steps with 1688 reset in 341 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 65 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 01:08:02] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-15 01:08:02] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 01:08:02] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2023-03-15 01:08:02] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 84 ms returned sat
[2023-03-15 01:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:03] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2023-03-15 01:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:08:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:08:04] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 40 ms returned sat
[2023-03-15 01:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:05] [INFO ] [Nat]Absence check using state equation in 1576 ms returned sat
[2023-03-15 01:08:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:08:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 198 ms returned sat
[2023-03-15 01:08:06] [INFO ] Deduced a trap composed of 121 places in 236 ms of which 1 ms to minimize.
[2023-03-15 01:08:06] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2023-03-15 01:08:06] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 1 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 8 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 1 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2023-03-15 01:08:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1577 ms
[2023-03-15 01:08:07] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 84 ms.
[2023-03-15 01:08:19] [INFO ] Deduced a trap composed of 347 places in 285 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 01:08:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-15 01:08:19] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:19] [INFO ] Invariant cache hit.
[2023-03-15 01:08:19] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:08:19] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 101 ms returned sat
[2023-03-15 01:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:20] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2023-03-15 01:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:08:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:21] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 69 ms returned sat
[2023-03-15 01:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:23] [INFO ] [Nat]Absence check using state equation in 1565 ms returned sat
[2023-03-15 01:08:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:08:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 277 ms returned sat
[2023-03-15 01:08:23] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2023-03-15 01:08:23] [INFO ] Deduced a trap composed of 316 places in 232 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 0 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 0 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1918 ms
[2023-03-15 01:08:25] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 68 ms.
[2023-03-15 01:08:34] [INFO ] Added : 508 causal constraints over 102 iterations in 9272 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 10 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:08:34] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:34] [INFO ] Invariant cache hit.
[2023-03-15 01:08:35] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
[2023-03-15 01:08:35] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:35] [INFO ] Invariant cache hit.
[2023-03-15 01:08:35] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-15 01:08:35] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:35] [INFO ] Invariant cache hit.
[2023-03-15 01:08:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:08:41] [INFO ] Implicit Places using invariants and state equation in 6038 ms returned []
Implicit Place search using SMT with State Equation took 6438 ms to find 0 implicit places.
[2023-03-15 01:08:41] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:41] [INFO ] Invariant cache hit.
[2023-03-15 01:08:41] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7384 ms. Remains : 646/646 places, 1170/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 65 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 01:08:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:42] [INFO ] Invariant cache hit.
[2023-03-15 01:08:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:43] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 81 ms returned sat
[2023-03-15 01:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:44] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2023-03-15 01:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:08:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:44] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 58 ms returned sat
[2023-03-15 01:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:08:46] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2023-03-15 01:08:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:08:46] [INFO ] [Nat]Added 96 Read/Feed constraints in 184 ms returned sat
[2023-03-15 01:08:46] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 0 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 147 places in 208 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 1 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1618 ms
[2023-03-15 01:08:48] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 69 ms.
[2023-03-15 01:08:59] [INFO ] Added : 650 causal constraints over 130 iterations in 11222 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-15 01:08:59] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:08:59] [INFO ] Invariant cache hit.
[2023-03-15 01:08:59] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:59] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 94 ms returned sat
[2023-03-15 01:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:01] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2023-03-15 01:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:09:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:09:01] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 61 ms returned sat
[2023-03-15 01:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:03] [INFO ] [Nat]Absence check using state equation in 1615 ms returned sat
[2023-03-15 01:09:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:09:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 290 ms returned sat
[2023-03-15 01:09:03] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2023-03-15 01:09:04] [INFO ] Deduced a trap composed of 316 places in 236 ms of which 1 ms to minimize.
[2023-03-15 01:09:04] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2023-03-15 01:09:04] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2023-03-15 01:09:05] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2023-03-15 01:09:05] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2023-03-15 01:09:05] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2023-03-15 01:09:05] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2023-03-15 01:09:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1975 ms
[2023-03-15 01:09:05] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 81 ms.
[2023-03-15 01:09:14] [INFO ] Added : 508 causal constraints over 102 iterations in 9264 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1685 reset in 333 ms.
Product exploration explored 100000 steps with 1680 reset in 386 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 646 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 40 place count 646 transition count 1258
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 128 place count 646 transition count 1258
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 168 place count 646 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 192 place count 622 transition count 1234
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 216 place count 622 transition count 1234
Deduced a syphon composed of 152 places in 1 ms
Applied a total of 216 rules in 69 ms. Remains 622 /646 variables (removed 24) and now considering 1234/1170 (removed -64) transitions.
[2023-03-15 01:09:15] [INFO ] Flow matrix only has 1218 transitions (discarded 16 similar events)
// Phase 1: matrix 1218 rows 622 cols
[2023-03-15 01:09:15] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 01:09:16] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
[2023-03-15 01:09:16] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 01:09:16] [INFO ] Flow matrix only has 1218 transitions (discarded 16 similar events)
[2023-03-15 01:09:16] [INFO ] Invariant cache hit.
[2023-03-15 01:09:17] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/646 places, 1234/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 622/646 places, 1234/1170 transitions.
Built C files in :
/tmp/ltsmin4779495036168194707
[2023-03-15 01:09:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4779495036168194707
Running compilation step : cd /tmp/ltsmin4779495036168194707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin4779495036168194707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4779495036168194707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13424182380623029345.hoa' '--buchi-type=spotba'
LTSmin run took 4709 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 84465 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(F(p0)))'
Support contains 9 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 16 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:09:23] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:09:23] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-15 01:09:24] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2023-03-15 01:09:24] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:09:24] [INFO ] Invariant cache hit.
[2023-03-15 01:09:24] [INFO ] Implicit Places using invariants in 405 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 406 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 907 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s562 2)) (AND (GEQ s166 1) (GEQ s562 2)) (AND (GEQ s164 1) (GEQ s562 2)) (AND (GEQ s162 1) (GEQ s562 2)) (AND (GEQ s163 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][false, false]]
Product exploration explored 100000 steps with 3850 reset in 287 ms.
Product exploration explored 100000 steps with 3841 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-15 01:09:25] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-15 01:09:25] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 01:09:26] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:09:26] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 204 ms returned sat
[2023-03-15 01:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:31] [INFO ] [Real]Absence check using state equation in 5124 ms returned sat
[2023-03-15 01:09:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:09:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:09:32] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 55 ms returned sat
[2023-03-15 01:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:33] [INFO ] [Nat]Absence check using state equation in 1625 ms returned sat
[2023-03-15 01:09:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:09:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 724 ms returned sat
[2023-03-15 01:09:34] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 73 ms.
[2023-03-15 01:09:40] [INFO ] Added : 304 causal constraints over 61 iterations in 5401 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 646 transition count 1114
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 590 transition count 1114
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 590 transition count 1034
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 510 transition count 1034
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 384 place count 454 transition count 978
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 446 transition count 970
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 446 transition count 970
Applied a total of 400 rules in 41 ms. Remains 446 /646 variables (removed 200) and now considering 970/1170 (removed 200) transitions.
[2023-03-15 01:09:40] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 446 cols
[2023-03-15 01:09:40] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-15 01:09:40] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
[2023-03-15 01:09:40] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:09:40] [INFO ] Invariant cache hit.
[2023-03-15 01:09:40] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-15 01:09:40] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:09:40] [INFO ] Invariant cache hit.
[2023-03-15 01:09:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:09:45] [INFO ] Implicit Places using invariants and state equation in 4975 ms returned []
Implicit Place search using SMT with State Equation took 5350 ms to find 0 implicit places.
[2023-03-15 01:09:45] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 01:09:45] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:09:45] [INFO ] Invariant cache hit.
[2023-03-15 01:09:46] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/646 places, 970/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6185 ms. Remains : 446/646 places, 970/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-15 01:09:46] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:09:46] [INFO ] Invariant cache hit.
[2023-03-15 01:09:47] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:09:47] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 86 ms returned sat
[2023-03-15 01:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:48] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2023-03-15 01:09:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:09:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-15 01:09:48] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 64 ms returned sat
[2023-03-15 01:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:09:49] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2023-03-15 01:09:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:09:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 330 ms returned sat
[2023-03-15 01:09:49] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 58 ms.
[2023-03-15 01:09:51] [INFO ] Added : 125 causal constraints over 25 iterations in 1400 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4505 reset in 285 ms.
Product exploration explored 100000 steps with 4504 reset in 299 ms.
Built C files in :
/tmp/ltsmin16035332554776869584
[2023-03-15 01:09:51] [INFO ] Computing symmetric may disable matrix : 970 transitions.
[2023-03-15 01:09:51] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:09:51] [INFO ] Computing symmetric may enable matrix : 970 transitions.
[2023-03-15 01:09:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:09:52] [INFO ] Computing Do-Not-Accords matrix : 970 transitions.
[2023-03-15 01:09:52] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:09:52] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16035332554776869584
Running compilation step : cd /tmp/ltsmin16035332554776869584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2840 ms.
Running link step : cd /tmp/ltsmin16035332554776869584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin16035332554776869584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11590716527327886455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 18 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-15 01:10:06] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:10:06] [INFO ] Invariant cache hit.
[2023-03-15 01:10:07] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
[2023-03-15 01:10:07] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:10:07] [INFO ] Invariant cache hit.
[2023-03-15 01:10:07] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-15 01:10:07] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:10:07] [INFO ] Invariant cache hit.
[2023-03-15 01:10:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:10:13] [INFO ] Implicit Places using invariants and state equation in 5290 ms returned []
Implicit Place search using SMT with State Equation took 5655 ms to find 0 implicit places.
[2023-03-15 01:10:13] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 01:10:13] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:10:13] [INFO ] Invariant cache hit.
[2023-03-15 01:10:13] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6566 ms. Remains : 446/446 places, 970/970 transitions.
Built C files in :
/tmp/ltsmin738644081635199194
[2023-03-15 01:10:13] [INFO ] Computing symmetric may disable matrix : 970 transitions.
[2023-03-15 01:10:13] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:10:13] [INFO ] Computing symmetric may enable matrix : 970 transitions.
[2023-03-15 01:10:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:10:13] [INFO ] Computing Do-Not-Accords matrix : 970 transitions.
[2023-03-15 01:10:13] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:10:13] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin738644081635199194
Running compilation step : cd /tmp/ltsmin738644081635199194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2847 ms.
Running link step : cd /tmp/ltsmin738644081635199194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin738644081635199194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9030565316263388251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 01:10:28] [INFO ] Flatten gal took : 42 ms
[2023-03-15 01:10:28] [INFO ] Flatten gal took : 38 ms
[2023-03-15 01:10:28] [INFO ] Time to serialize gal into /tmp/LTL1617499031858131578.gal : 6 ms
[2023-03-15 01:10:28] [INFO ] Time to serialize properties into /tmp/LTL15629500482841950655.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1617499031858131578.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8100965617764301531.hoa' '-atoms' '/tmp/LTL15629500482841950655.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15629500482841950655.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8100965617764301531.hoa
Detected timeout of ITS tools.
[2023-03-15 01:10:43] [INFO ] Flatten gal took : 39 ms
[2023-03-15 01:10:43] [INFO ] Flatten gal took : 38 ms
[2023-03-15 01:10:43] [INFO ] Time to serialize gal into /tmp/LTL14728933065570240956.gal : 5 ms
[2023-03-15 01:10:43] [INFO ] Time to serialize properties into /tmp/LTL9601759723035437756.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14728933065570240956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9601759723035437756.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((TryAllocateOneTaskB_3>=1)&&(cIdleTasks_0>=2))||((TryAllocateOneTaskB_4>=1)&&(cIdleTasks_0>=2)))||(((TryAllocateOneTaskB_2...438
Formula 0 simplified : XG!"(((((TryAllocateOneTaskB_3>=1)&&(cIdleTasks_0>=2))||((TryAllocateOneTaskB_4>=1)&&(cIdleTasks_0>=2)))||(((TryAllocateOneTaskB_2>=...432
Detected timeout of ITS tools.
[2023-03-15 01:10:58] [INFO ] Flatten gal took : 37 ms
[2023-03-15 01:10:58] [INFO ] Applying decomposition
[2023-03-15 01:10:58] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9870692656851985999.txt' '-o' '/tmp/graph9870692656851985999.bin' '-w' '/tmp/graph9870692656851985999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9870692656851985999.bin' '-l' '-1' '-v' '-w' '/tmp/graph9870692656851985999.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:10:59] [INFO ] Decomposing Gal with order
[2023-03-15 01:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:10:59] [INFO ] Removed a total of 783 redundant transitions.
[2023-03-15 01:10:59] [INFO ] Flatten gal took : 95 ms
[2023-03-15 01:10:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 14 ms.
[2023-03-15 01:10:59] [INFO ] Time to serialize gal into /tmp/LTL610386560266741533.gal : 7 ms
[2023-03-15 01:10:59] [INFO ] Time to serialize properties into /tmp/LTL17324294666152723761.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL610386560266741533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17324294666152723761.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((u29.TryAllocateOneTaskB_3>=1)&&(u29.cIdleTasks_0>=2))||((u29.TryAllocateOneTaskB_4>=1)&&(u29.cIdleTasks_0>=2)))||(((u29.T...502
Formula 0 simplified : XG!"(((((u29.TryAllocateOneTaskB_3>=1)&&(u29.cIdleTasks_0>=2))||((u29.TryAllocateOneTaskB_4>=1)&&(u29.cIdleTasks_0>=2)))||(((u29.Try...496
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10355963474657652939
[2023-03-15 01:11:14] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10355963474657652939
Running compilation step : cd /tmp/ltsmin10355963474657652939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1633 ms.
Running link step : cd /tmp/ltsmin10355963474657652939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10355963474657652939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-08 finished in 125453 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)||G(F(p1)))))'
Support contains 73 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 662 transition count 1130
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 614 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 416 place count 454 transition count 970
Applied a total of 416 rules in 36 ms. Remains 454 /664 variables (removed 210) and now considering 970/1178 (removed 208) transitions.
[2023-03-15 01:11:29] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 454 cols
[2023-03-15 01:11:29] [INFO ] Computed 52 place invariants in 17 ms
[2023-03-15 01:11:29] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
[2023-03-15 01:11:29] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:11:29] [INFO ] Invariant cache hit.
[2023-03-15 01:11:30] [INFO ] Implicit Places using invariants in 323 ms returned [408, 409, 410, 411, 412, 413, 414, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 325 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/664 places, 970/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 438 transition count 962
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 438 transition count 962
Applied a total of 16 rules in 18 ms. Remains 438 /446 variables (removed 8) and now considering 962/970 (removed 8) transitions.
[2023-03-15 01:11:30] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
// Phase 1: matrix 946 rows 438 cols
[2023-03-15 01:11:30] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 01:11:30] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-15 01:11:30] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:30] [INFO ] Invariant cache hit.
[2023-03-15 01:11:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:11:34] [INFO ] Implicit Places using invariants and state equation in 3481 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 438/664 places, 962/1178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4683 ms. Remains : 438/664 places, 962/1178 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s122 1) (LT s174 1)) (OR (LT s83 1) (LT s174 1)) (OR (LT s112 1) (LT s174 1)) (OR (LT s102 1) (LT s174 1)) (OR (LT s93 1) (LT s174 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1198 reset in 587 ms.
Product exploration explored 100000 steps with 1186 reset in 589 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 73 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 962/962 transitions.
Applied a total of 0 rules in 12 ms. Remains 438 /438 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-15 01:11:36] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:36] [INFO ] Invariant cache hit.
[2023-03-15 01:11:36] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
[2023-03-15 01:11:36] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:36] [INFO ] Invariant cache hit.
[2023-03-15 01:11:36] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-15 01:11:36] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:36] [INFO ] Invariant cache hit.
[2023-03-15 01:11:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:11:40] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned []
Implicit Place search using SMT with State Equation took 4080 ms to find 0 implicit places.
[2023-03-15 01:11:40] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 01:11:40] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:40] [INFO ] Invariant cache hit.
[2023-03-15 01:11:40] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4942 ms. Remains : 438/438 places, 962/962 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1178 reset in 599 ms.
Product exploration explored 100000 steps with 1158 reset in 605 ms.
Built C files in :
/tmp/ltsmin13984657313852250053
[2023-03-15 01:11:42] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2023-03-15 01:11:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:11:42] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2023-03-15 01:11:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:11:43] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2023-03-15 01:11:43] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:11:43] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13984657313852250053
Running compilation step : cd /tmp/ltsmin13984657313852250053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2834 ms.
Running link step : cd /tmp/ltsmin13984657313852250053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13984657313852250053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4809701755300759910.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 73 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 962/962 transitions.
Applied a total of 0 rules in 12 ms. Remains 438 /438 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-15 01:11:57] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:57] [INFO ] Invariant cache hit.
[2023-03-15 01:11:58] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
[2023-03-15 01:11:58] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:58] [INFO ] Invariant cache hit.
[2023-03-15 01:11:58] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-15 01:11:58] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:11:58] [INFO ] Invariant cache hit.
[2023-03-15 01:11:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:12:01] [INFO ] Implicit Places using invariants and state equation in 3244 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2023-03-15 01:12:01] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 01:12:01] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-15 01:12:01] [INFO ] Invariant cache hit.
[2023-03-15 01:12:02] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4437 ms. Remains : 438/438 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin6489416848596350244
[2023-03-15 01:12:02] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2023-03-15 01:12:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:12:02] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2023-03-15 01:12:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:12:02] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2023-03-15 01:12:02] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:12:02] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6489416848596350244
Running compilation step : cd /tmp/ltsmin6489416848596350244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2781 ms.
Running link step : cd /tmp/ltsmin6489416848596350244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6489416848596350244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18395415726596378325.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 01:12:17] [INFO ] Flatten gal took : 32 ms
[2023-03-15 01:12:17] [INFO ] Flatten gal took : 32 ms
[2023-03-15 01:12:17] [INFO ] Time to serialize gal into /tmp/LTL2968620892671058960.gal : 6 ms
[2023-03-15 01:12:17] [INFO ] Time to serialize properties into /tmp/LTL8284837406451891942.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2968620892671058960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut520992368724236214.hoa' '-atoms' '/tmp/LTL8284837406451891942.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8284837406451891942.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut520992368724236214.hoa
Detected timeout of ITS tools.
[2023-03-15 01:12:32] [INFO ] Flatten gal took : 35 ms
[2023-03-15 01:12:32] [INFO ] Flatten gal took : 41 ms
[2023-03-15 01:12:32] [INFO ] Time to serialize gal into /tmp/LTL16740897975203554657.gal : 6 ms
[2023-03-15 01:12:32] [INFO ] Time to serialize properties into /tmp/LTL17104572972729701440.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16740897975203554657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17104572972729701440.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((((QueueJobB_48<1)||(MarkerWrite_0<1))&&((QueueJobB_9<1)||(MarkerWrite_0<1)))&&(((QueueJobB_38<1)||(MarkerWrite_0<1))&&(...2702
Formula 0 simplified : G(F!"((((((((QueueJobB_48<1)||(MarkerWrite_0<1))&&((QueueJobB_9<1)||(MarkerWrite_0<1)))&&(((QueueJobB_38<1)||(MarkerWrite_0<1))&&((Q...2692
Detected timeout of ITS tools.
[2023-03-15 01:12:47] [INFO ] Flatten gal took : 33 ms
[2023-03-15 01:12:47] [INFO ] Applying decomposition
[2023-03-15 01:12:47] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14495942796996276971.txt' '-o' '/tmp/graph14495942796996276971.bin' '-w' '/tmp/graph14495942796996276971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14495942796996276971.bin' '-l' '-1' '-v' '-w' '/tmp/graph14495942796996276971.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:12:47] [INFO ] Decomposing Gal with order
[2023-03-15 01:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:12:47] [INFO ] Removed a total of 906 redundant transitions.
[2023-03-15 01:12:47] [INFO ] Flatten gal took : 85 ms
[2023-03-15 01:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 506 labels/synchronizations in 21 ms.
[2023-03-15 01:12:48] [INFO ] Time to serialize gal into /tmp/LTL15957525557129803546.gal : 8 ms
[2023-03-15 01:12:48] [INFO ] Time to serialize properties into /tmp/LTL13441767110283885835.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15957525557129803546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13441767110283885835.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((((i6.u6.QueueJobB_48<1)||(i6.u6.MarkerWrite_0<1))&&((i6.u6.QueueJobB_9<1)||(i6.u6.MarkerWrite_0<1)))&&(((i6.u6.QueueJob...3484
Formula 0 simplified : G(F!"((((((((i6.u6.QueueJobB_48<1)||(i6.u6.MarkerWrite_0<1))&&((i6.u6.QueueJobB_9<1)||(i6.u6.MarkerWrite_0<1)))&&(((i6.u6.QueueJobB_...3474
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9808353023963881335
[2023-03-15 01:13:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9808353023963881335
Running compilation step : cd /tmp/ltsmin9808353023963881335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin9808353023963881335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9808353023963881335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-09 finished in 108840 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)||X(X(G(p1)))))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 16 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:13:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:13:18] [INFO ] Computed 52 place invariants in 17 ms
[2023-03-15 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
[2023-03-15 01:13:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:18] [INFO ] Invariant cache hit.
[2023-03-15 01:13:19] [INFO ] Implicit Places using invariants in 368 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 369 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 5 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 890 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s461 1) (GEQ s460 1) (GEQ s459 1) (GEQ s458 1) (GEQ s457 1) (GEQ s456 1) (GEQ s455 1) (GEQ s454 1)), p1:(AND (OR (LT s238 1) (LT s303 1) (LT s...], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 5403 reset in 686 ms.
Product exploration explored 100000 steps with 5441 reset in 716 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 464 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 11 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:13:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-15 01:13:21] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-15 01:13:22] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
[2023-03-15 01:13:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:22] [INFO ] Invariant cache hit.
[2023-03-15 01:13:22] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-15 01:13:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:22] [INFO ] Invariant cache hit.
[2023-03-15 01:13:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:13:28] [INFO ] Implicit Places using invariants and state equation in 5534 ms returned []
Implicit Place search using SMT with State Equation took 5908 ms to find 0 implicit places.
[2023-03-15 01:13:28] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:28] [INFO ] Invariant cache hit.
[2023-03-15 01:13:28] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6867 ms. Remains : 646/646 places, 1170/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5403 reset in 712 ms.
Product exploration explored 100000 steps with 5414 reset in 713 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 646 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 40 place count 646 transition count 1258
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 128 place count 646 transition count 1258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 144 place count 630 transition count 1242
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 160 place count 630 transition count 1242
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 216 place count 630 transition count 1242
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 248 place count 598 transition count 1210
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 280 place count 598 transition count 1210
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 280 rules in 74 ms. Remains 598 /646 variables (removed 48) and now considering 1210/1170 (removed -40) transitions.
[2023-03-15 01:13:31] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
// Phase 1: matrix 1194 rows 598 cols
[2023-03-15 01:13:31] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 01:13:32] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
[2023-03-15 01:13:32] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 01:13:32] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
[2023-03-15 01:13:32] [INFO ] Invariant cache hit.
[2023-03-15 01:13:32] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/646 places, 1210/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1167 ms. Remains : 598/646 places, 1210/1170 transitions.
Built C files in :
/tmp/ltsmin16601008967246340504
[2023-03-15 01:13:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16601008967246340504
Running compilation step : cd /tmp/ltsmin16601008967246340504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2130 ms.
Running link step : cd /tmp/ltsmin16601008967246340504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16601008967246340504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8858131556736310235.hoa' '--buchi-type=spotba'
LTSmin run took 1842 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-10 finished in 18615 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((p1&&F(p2)))&&p0)))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Applied a total of 2 rules in 13 ms. Remains 662 /664 variables (removed 2) and now considering 1178/1178 (removed 0) transitions.
[2023-03-15 01:13:36] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 662 cols
[2023-03-15 01:13:36] [INFO ] Computed 52 place invariants in 18 ms
[2023-03-15 01:13:37] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
[2023-03-15 01:13:37] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-15 01:13:37] [INFO ] Invariant cache hit.
[2023-03-15 01:13:37] [INFO ] Implicit Places using invariants in 413 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 415 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1178/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 654 /654 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 654/664 places, 1178/1178 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s512 1) (LT s513 1) (LT s514 1) (LT s515 1) (LT s516 1) (LT s517 1) (LT s518 1) (LT s519 1)), p1:(OR (AND (GEQ s11 1) (GEQ s167 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-11 finished in 1117 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(F((G(F(p1))||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||p0))))'
Support contains 89 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 16 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:13:37] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:13:37] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-15 01:13:38] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
[2023-03-15 01:13:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:38] [INFO ] Invariant cache hit.
[2023-03-15 01:13:38] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-15 01:13:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:38] [INFO ] Invariant cache hit.
[2023-03-15 01:13:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:13:40] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2023-03-15 01:13:40] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:40] [INFO ] Invariant cache hit.
[2023-03-15 01:13:41] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1170/1178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3447 ms. Remains : 654/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s512 1) (GEQ s571 1)) (AND (GEQ s9 1) (GEQ s519 1) (GEQ s571 1)) (AND (GEQ s4 1) (GEQ s514 1) (GEQ s571 1)) (AND (GEQ s7 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3854 reset in 593 ms.
Product exploration explored 100000 steps with 3852 reset in 603 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 619 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:13:44] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:44] [INFO ] Invariant cache hit.
[2023-03-15 01:13:44] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 01:13:44] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-15 01:13:44] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 01:13:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 01:13:44] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-15 01:13:44] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 15 factoid took 877 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-15 01:13:46] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:13:46] [INFO ] Invariant cache hit.
[2023-03-15 01:13:47] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 01:13:47] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 122 ms returned sat
[2023-03-15 01:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:13:48] [INFO ] [Real]Absence check using state equation in 1670 ms returned sat
[2023-03-15 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:13:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 01:13:49] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 117 ms returned sat
[2023-03-15 01:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:13:51] [INFO ] [Nat]Absence check using state equation in 1891 ms returned sat
[2023-03-15 01:13:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:13:52] [INFO ] [Nat]Added 96 Read/Feed constraints in 452 ms returned sat
[2023-03-15 01:13:52] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 0 ms to minimize.
[2023-03-15 01:13:52] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 1 ms to minimize.
[2023-03-15 01:13:53] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 0 ms to minimize.
[2023-03-15 01:13:53] [INFO ] Deduced a trap composed of 320 places in 250 ms of which 1 ms to minimize.
[2023-03-15 01:13:53] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2023-03-15 01:13:53] [INFO ] Deduced a trap composed of 182 places in 179 ms of which 0 ms to minimize.
[2023-03-15 01:13:53] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2023-03-15 01:13:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1941 ms
[2023-03-15 01:13:54] [INFO ] Computed and/alt/rep : 824/3182/816 causal constraints (skipped 336 transitions) in 82 ms.
[2023-03-15 01:14:02] [INFO ] Added : 452 causal constraints over 91 iterations in 8285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Applied a total of 0 rules in 5 ms. Remains 654 /654 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:14:02] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:02] [INFO ] Invariant cache hit.
[2023-03-15 01:14:02] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
[2023-03-15 01:14:02] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:02] [INFO ] Invariant cache hit.
[2023-03-15 01:14:03] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-15 01:14:03] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:03] [INFO ] Invariant cache hit.
[2023-03-15 01:14:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:14:05] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
[2023-03-15 01:14:05] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:05] [INFO ] Invariant cache hit.
[2023-03-15 01:14:05] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3455 ms. Remains : 654/654 places, 1170/1170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 599 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Finished random walk after 219 steps, including 0 resets, run visited all 9 properties in 11 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0))))]
Knowledge based reduction with 11 factoid took 692 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-15 01:14:08] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:08] [INFO ] Invariant cache hit.
[2023-03-15 01:14:08] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 01:14:08] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 111 ms returned sat
[2023-03-15 01:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:14:10] [INFO ] [Real]Absence check using state equation in 1662 ms returned sat
[2023-03-15 01:14:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:14:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 01:14:11] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 117 ms returned sat
[2023-03-15 01:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:14:13] [INFO ] [Nat]Absence check using state equation in 1867 ms returned sat
[2023-03-15 01:14:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:14:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 447 ms returned sat
[2023-03-15 01:14:14] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 0 ms to minimize.
[2023-03-15 01:14:14] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 1 ms to minimize.
[2023-03-15 01:14:14] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 4 ms to minimize.
[2023-03-15 01:14:15] [INFO ] Deduced a trap composed of 320 places in 244 ms of which 1 ms to minimize.
[2023-03-15 01:14:15] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2023-03-15 01:14:15] [INFO ] Deduced a trap composed of 182 places in 175 ms of which 0 ms to minimize.
[2023-03-15 01:14:15] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2023-03-15 01:14:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1956 ms
[2023-03-15 01:14:15] [INFO ] Computed and/alt/rep : 824/3182/816 causal constraints (skipped 336 transitions) in 73 ms.
[2023-03-15 01:14:24] [INFO ] Added : 452 causal constraints over 91 iterations in 8292 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 3848 reset in 437 ms.
Product exploration explored 100000 steps with 3842 reset in 451 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 654 transition count 1170
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 40 place count 654 transition count 1202
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 72 place count 654 transition count 1202
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 638 transition count 1186
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 638 transition count 1186
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 144 place count 638 transition count 1186
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 160 place count 622 transition count 1170
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 176 place count 622 transition count 1170
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 176 rules in 54 ms. Remains 622 /654 variables (removed 32) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:14:25] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 622 cols
[2023-03-15 01:14:25] [INFO ] Computed 52 place invariants in 13 ms
[2023-03-15 01:14:26] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
[2023-03-15 01:14:26] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 01:14:26] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:26] [INFO ] Invariant cache hit.
[2023-03-15 01:14:26] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/654 places, 1170/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1139 ms. Remains : 622/654 places, 1170/1170 transitions.
Built C files in :
/tmp/ltsmin2530940869812100085
[2023-03-15 01:14:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2530940869812100085
Running compilation step : cd /tmp/ltsmin2530940869812100085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2081 ms.
Running link step : cd /tmp/ltsmin2530940869812100085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2530940869812100085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6983521389833087880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Applied a total of 0 rules in 5 ms. Remains 654 /654 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-15 01:14:41] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:14:41] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-15 01:14:42] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2023-03-15 01:14:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:42] [INFO ] Invariant cache hit.
[2023-03-15 01:14:42] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-15 01:14:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:42] [INFO ] Invariant cache hit.
[2023-03-15 01:14:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:14:45] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
[2023-03-15 01:14:45] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:14:45] [INFO ] Invariant cache hit.
[2023-03-15 01:14:45] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3798 ms. Remains : 654/654 places, 1170/1170 transitions.
Built C files in :
/tmp/ltsmin14088169748475356981
[2023-03-15 01:14:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14088169748475356981
Running compilation step : cd /tmp/ltsmin14088169748475356981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2056 ms.
Running link step : cd /tmp/ltsmin14088169748475356981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14088169748475356981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11500392295076019900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 01:15:00] [INFO ] Flatten gal took : 37 ms
[2023-03-15 01:15:00] [INFO ] Flatten gal took : 34 ms
[2023-03-15 01:15:00] [INFO ] Time to serialize gal into /tmp/LTL2261840356913477738.gal : 6 ms
[2023-03-15 01:15:00] [INFO ] Time to serialize properties into /tmp/LTL15107697719544656118.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2261840356913477738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18079085003220174785.hoa' '-atoms' '/tmp/LTL15107697719544656118.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15107697719544656118.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18079085003220174785.hoa
Detected timeout of ITS tools.
[2023-03-15 01:15:16] [INFO ] Flatten gal took : 35 ms
[2023-03-15 01:15:16] [INFO ] Flatten gal took : 35 ms
[2023-03-15 01:15:16] [INFO ] Time to serialize gal into /tmp/LTL1072872110793903444.gal : 6 ms
[2023-03-15 01:15:16] [INFO ] Time to serialize properties into /tmp/LTL11485053335985123331.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1072872110793903444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11485053335985123331.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((((G(F("(((((((FetchJobE_14>=1)||(FetchJobE_16>=1))||((FetchJobE_10>=1)||(FetchJobE_12>=1)))||(((FetchJobE_22>=1)||(FetchJobE_...3816
Formula 0 simplified : XG(!"(((((AwakeTasks_5>=1)&&(Idle_5>=1))&&(ORB_Lock_0>=1))||(((AwakeTasks_4>=1)&&(Idle_4>=1))&&(ORB_Lock_0>=1)))||((((AwakeTasks_3>=...3226
Detected timeout of ITS tools.
[2023-03-15 01:15:31] [INFO ] Flatten gal took : 44 ms
[2023-03-15 01:15:31] [INFO ] Applying decomposition
[2023-03-15 01:15:31] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15734070400030910094.txt' '-o' '/tmp/graph15734070400030910094.bin' '-w' '/tmp/graph15734070400030910094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15734070400030910094.bin' '-l' '-1' '-v' '-w' '/tmp/graph15734070400030910094.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:15:31] [INFO ] Decomposing Gal with order
[2023-03-15 01:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:15:31] [INFO ] Removed a total of 940 redundant transitions.
[2023-03-15 01:15:31] [INFO ] Flatten gal took : 83 ms
[2023-03-15 01:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 20 ms.
[2023-03-15 01:15:31] [INFO ] Time to serialize gal into /tmp/LTL5374163661611539394.gal : 9 ms
[2023-03-15 01:15:31] [INFO ] Time to serialize properties into /tmp/LTL3012000654618751667.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5374163661611539394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3012000654618751667.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(((((G(F("(((((((i5.u101.FetchJobE_14>=1)||(i4.u42.FetchJobE_16>=1))||((i4.u98.FetchJobE_10>=1)||(i4.u99.FetchJobE_12>=1)))||(((...5404
Formula 0 simplified : XG(!"(((((u6.AwakeTasks_5>=1)&&(i11.i1.u95.Idle_5>=1))&&(i2.i0.u7.ORB_Lock_0>=1))||(((u6.AwakeTasks_4>=1)&&(i2.i2.u45.Idle_4>=1))&&(...4512
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8134612659967567596
[2023-03-15 01:15:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8134612659967567596
Running compilation step : cd /tmp/ltsmin8134612659967567596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2003 ms.
Running link step : cd /tmp/ltsmin8134612659967567596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8134612659967567596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ([](!(LTLAPp2==true))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 143734 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&&X(p1))))'
Support contains 64 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Applied a total of 2 rules in 13 ms. Remains 662 /664 variables (removed 2) and now considering 1178/1178 (removed 0) transitions.
[2023-03-15 01:16:01] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 662 cols
[2023-03-15 01:16:01] [INFO ] Computed 52 place invariants in 20 ms
[2023-03-15 01:16:02] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
[2023-03-15 01:16:02] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-15 01:16:02] [INFO ] Invariant cache hit.
[2023-03-15 01:16:02] [INFO ] Implicit Places using invariants in 429 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 430 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1178/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 654 /654 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 969 ms. Remains : 654/664 places, 1178/1178 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s493 1) (GEQ s492 1) (GEQ s491 1) (GEQ s490 1) (GEQ s489 1) (GEQ s488 1) (GEQ s487 1) (GEQ s486 1)), p1:(OR (GEQ s261 1) (GEQ s263 1) (GEQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1142 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-13 finished in 1080 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(X((!p0&&X(G((X((F(p2)||G(p3)))&&p1)))))))'
Support contains 95 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 15 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-15 01:16:02] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-15 01:16:02] [INFO ] Computed 52 place invariants in 21 ms
[2023-03-15 01:16:03] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
[2023-03-15 01:16:03] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-15 01:16:03] [INFO ] Invariant cache hit.
[2023-03-15 01:16:03] [INFO ] Implicit Places using invariants in 340 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 341 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 8 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), (OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), (OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s238 1) (LT s303 1) (LT s309 1)) (OR (LT s238 1) (LT s303 1) (LT s307 1)) (OR (LT s233 1) (LT s303 1) (LT s312 1)) (OR (LT s238 1) (LT s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-14 finished in 1200 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(X((G(F((p1||G(p2))))||p0))))'
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(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-08
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 462 transition count 978
Applied a total of 400 rules in 43 ms. Remains 462 /664 variables (removed 202) and now considering 978/1178 (removed 200) transitions.
[2023-03-15 01:16:04] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 462 cols
[2023-03-15 01:16:04] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-15 01:16:04] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
[2023-03-15 01:16:04] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-15 01:16:04] [INFO ] Invariant cache hit.
[2023-03-15 01:16:05] [INFO ] Implicit Places using invariants in 380 ms returned [416, 417, 418, 419, 420, 421, 422, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 382 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 454/664 places, 978/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 446 transition count 970
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 446 transition count 970
Applied a total of 16 rules in 13 ms. Remains 446 /454 variables (removed 8) and now considering 970/978 (removed 8) transitions.
[2023-03-15 01:16:05] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 446 cols
[2023-03-15 01:16:05] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-15 01:16:05] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-15 01:16:05] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:05] [INFO ] Invariant cache hit.
[2023-03-15 01:16:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:16:11] [INFO ] Implicit Places using invariants and state equation in 6420 ms returned []
Implicit Place search using SMT with State Equation took 6800 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 446/664 places, 970/1178 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7657 ms. Remains : 446/664 places, 970/1178 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s157 1) (GEQ s426 2)) (AND (GEQ s158 1) (GEQ s426 2)) (AND (GEQ s156 1) (GEQ s426 2)) (AND (GEQ s154 1) (GEQ s426 2)) (AND (GEQ s155 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4471 reset in 264 ms.
Product exploration explored 100000 steps with 4490 reset in 282 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-15 01:16:12] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:12] [INFO ] Invariant cache hit.
[2023-03-15 01:16:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:16:13] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 275 ms returned sat
[2023-03-15 01:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:16:14] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2023-03-15 01:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:16:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:16:14] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 88 ms returned sat
[2023-03-15 01:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:16:16] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2023-03-15 01:16:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:16:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2023-03-15 01:16:16] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 56 ms.
[2023-03-15 01:16:18] [INFO ] Added : 136 causal constraints over 28 iterations in 1680 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 18 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-15 01:16:18] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:18] [INFO ] Invariant cache hit.
[2023-03-15 01:16:18] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2023-03-15 01:16:18] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:18] [INFO ] Invariant cache hit.
[2023-03-15 01:16:18] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-15 01:16:18] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:18] [INFO ] Invariant cache hit.
[2023-03-15 01:16:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:16:23] [INFO ] Implicit Places using invariants and state equation in 4821 ms returned []
Implicit Place search using SMT with State Equation took 5160 ms to find 0 implicit places.
[2023-03-15 01:16:23] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 01:16:23] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:23] [INFO ] Invariant cache hit.
[2023-03-15 01:16:24] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6015 ms. Remains : 446/446 places, 970/970 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-15 01:16:24] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:24] [INFO ] Invariant cache hit.
[2023-03-15 01:16:24] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:16:25] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 275 ms returned sat
[2023-03-15 01:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:16:26] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2023-03-15 01:16:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:16:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:16:26] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 80 ms returned sat
[2023-03-15 01:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:16:27] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-15 01:16:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:16:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2023-03-15 01:16:28] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 49 ms.
[2023-03-15 01:16:29] [INFO ] Added : 136 causal constraints over 28 iterations in 1705 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4495 reset in 293 ms.
Product exploration explored 100000 steps with 4508 reset in 299 ms.
Built C files in :
/tmp/ltsmin1960760510597624099
[2023-03-15 01:16:30] [INFO ] Computing symmetric may disable matrix : 970 transitions.
[2023-03-15 01:16:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:30] [INFO ] Computing symmetric may enable matrix : 970 transitions.
[2023-03-15 01:16:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:30] [INFO ] Computing Do-Not-Accords matrix : 970 transitions.
[2023-03-15 01:16:30] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:30] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1960760510597624099
Running compilation step : cd /tmp/ltsmin1960760510597624099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2908 ms.
Running link step : cd /tmp/ltsmin1960760510597624099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1960760510597624099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16805448061758500586.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 15 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-15 01:16:45] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:45] [INFO ] Invariant cache hit.
[2023-03-15 01:16:45] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
[2023-03-15 01:16:45] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:45] [INFO ] Invariant cache hit.
[2023-03-15 01:16:46] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-15 01:16:46] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:46] [INFO ] Invariant cache hit.
[2023-03-15 01:16:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:16:49] [INFO ] Implicit Places using invariants and state equation in 3582 ms returned []
Implicit Place search using SMT with State Equation took 3910 ms to find 0 implicit places.
[2023-03-15 01:16:49] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 01:16:49] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-15 01:16:49] [INFO ] Invariant cache hit.
[2023-03-15 01:16:50] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4753 ms. Remains : 446/446 places, 970/970 transitions.
Built C files in :
/tmp/ltsmin12570795479861753189
[2023-03-15 01:16:50] [INFO ] Computing symmetric may disable matrix : 970 transitions.
[2023-03-15 01:16:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:50] [INFO ] Computing symmetric may enable matrix : 970 transitions.
[2023-03-15 01:16:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:50] [INFO ] Computing Do-Not-Accords matrix : 970 transitions.
[2023-03-15 01:16:50] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:16:50] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12570795479861753189
Running compilation step : cd /tmp/ltsmin12570795479861753189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2818 ms.
Running link step : cd /tmp/ltsmin12570795479861753189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12570795479861753189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5507687458768406275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 01:17:05] [INFO ] Flatten gal took : 33 ms
[2023-03-15 01:17:05] [INFO ] Flatten gal took : 32 ms
[2023-03-15 01:17:05] [INFO ] Time to serialize gal into /tmp/LTL4793337264140811774.gal : 6 ms
[2023-03-15 01:17:05] [INFO ] Time to serialize properties into /tmp/LTL17713839647189884124.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4793337264140811774.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4163594195327190445.hoa' '-atoms' '/tmp/LTL17713839647189884124.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17713839647189884124.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4163594195327190445.hoa
Detected timeout of ITS tools.
[2023-03-15 01:17:20] [INFO ] Flatten gal took : 33 ms
[2023-03-15 01:17:20] [INFO ] Flatten gal took : 33 ms
[2023-03-15 01:17:20] [INFO ] Time to serialize gal into /tmp/LTL7948968883546919780.gal : 5 ms
[2023-03-15 01:17:20] [INFO ] Time to serialize properties into /tmp/LTL8265992796642710276.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7948968883546919780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8265992796642710276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((TryAllocateOneTaskB_3>=1)&&(cIdleTasks_0>=2))||((TryAllocateOneTaskB_4>=1)&&(cIdleTasks_0>=2)))||(((TryAllocateOneTaskB_2...438
Formula 0 simplified : XG!"(((((TryAllocateOneTaskB_3>=1)&&(cIdleTasks_0>=2))||((TryAllocateOneTaskB_4>=1)&&(cIdleTasks_0>=2)))||(((TryAllocateOneTaskB_2>=...432
Detected timeout of ITS tools.
[2023-03-15 01:17:35] [INFO ] Flatten gal took : 32 ms
[2023-03-15 01:17:35] [INFO ] Applying decomposition
[2023-03-15 01:17:35] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1884096666099905672.txt' '-o' '/tmp/graph1884096666099905672.bin' '-w' '/tmp/graph1884096666099905672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1884096666099905672.bin' '-l' '-1' '-v' '-w' '/tmp/graph1884096666099905672.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:17:35] [INFO ] Decomposing Gal with order
[2023-03-15 01:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:17:35] [INFO ] Removed a total of 852 redundant transitions.
[2023-03-15 01:17:35] [INFO ] Flatten gal took : 76 ms
[2023-03-15 01:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 21 ms.
[2023-03-15 01:17:35] [INFO ] Time to serialize gal into /tmp/LTL12690977523757070663.gal : 8 ms
[2023-03-15 01:17:35] [INFO ] Time to serialize properties into /tmp/LTL4386751646632389282.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12690977523757070663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4386751646632389282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((u28.TryAllocateOneTaskB_3>=1)&&(u28.cIdleTasks_0>=2))||((u28.TryAllocateOneTaskB_4>=1)&&(u28.cIdleTasks_0>=2)))||(((u28.T...502
Formula 0 simplified : XG!"(((((u28.TryAllocateOneTaskB_3>=1)&&(u28.cIdleTasks_0>=2))||((u28.TryAllocateOneTaskB_4>=1)&&(u28.cIdleTasks_0>=2)))||(((u28.Try...496
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16452837764970801608
[2023-03-15 01:17:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16452837764970801608
Running compilation step : cd /tmp/ltsmin16452837764970801608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1701 ms.
Running link step : cd /tmp/ltsmin16452837764970801608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16452837764970801608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 7442 ms.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-08 finished in 116143 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)||G(F(p1)))))'
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(F((G(F(p1))||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||p0))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 662 transition count 1138
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 622 transition count 1130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 614 transition count 1130
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 96 place count 614 transition count 1106
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 144 place count 590 transition count 1106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 542 transition count 1058
Applied a total of 240 rules in 36 ms. Remains 542 /664 variables (removed 122) and now considering 1058/1178 (removed 120) transitions.
[2023-03-15 01:18:00] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
// Phase 1: matrix 1042 rows 542 cols
[2023-03-15 01:18:00] [INFO ] Computed 52 place invariants in 20 ms
[2023-03-15 01:18:01] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
[2023-03-15 01:18:01] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:01] [INFO ] Invariant cache hit.
[2023-03-15 01:18:01] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-15 01:18:01] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:01] [INFO ] Invariant cache hit.
[2023-03-15 01:18:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:18:05] [INFO ] Implicit Places using invariants and state equation in 4389 ms returned []
Implicit Place search using SMT with State Equation took 4750 ms to find 0 implicit places.
[2023-03-15 01:18:05] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:05] [INFO ] Invariant cache hit.
[2023-03-15 01:18:06] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 542/664 places, 1058/1178 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5688 ms. Remains : 542/664 places, 1058/1178 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s416 1) (GEQ s459 1)) (AND (GEQ s9 1) (GEQ s423 1) (GEQ s459 1)) (AND (GEQ s4 1) (GEQ s418 1) (GEQ s459 1)) (AND (GEQ s7 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5129 reset in 604 ms.
Product exploration explored 100000 steps with 5147 reset in 617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 666 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:18:08] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:08] [INFO ] Invariant cache hit.
[2023-03-15 01:18:09] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-15 01:18:09] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2023-03-15 01:18:09] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 01:18:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-15 01:18:09] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-15 01:18:09] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 15 factoid took 790 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-15 01:18:10] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:10] [INFO ] Invariant cache hit.
[2023-03-15 01:18:11] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-15 01:18:11] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 167 ms returned sat
[2023-03-15 01:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:18:14] [INFO ] [Real]Absence check using state equation in 2658 ms returned sat
[2023-03-15 01:18:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:18:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:18:14] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 126 ms returned sat
[2023-03-15 01:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:18:16] [INFO ] [Nat]Absence check using state equation in 1977 ms returned sat
[2023-03-15 01:18:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:18:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 331 ms returned sat
[2023-03-15 01:18:17] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 1 ms to minimize.
[2023-03-15 01:18:17] [INFO ] Deduced a trap composed of 288 places in 216 ms of which 1 ms to minimize.
[2023-03-15 01:18:18] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2023-03-15 01:18:18] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 1 ms to minimize.
[2023-03-15 01:18:18] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 0 ms to minimize.
[2023-03-15 01:18:18] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 1 ms to minimize.
[2023-03-15 01:18:19] [INFO ] Deduced a trap composed of 295 places in 195 ms of which 0 ms to minimize.
[2023-03-15 01:18:19] [INFO ] Deduced a trap composed of 298 places in 195 ms of which 0 ms to minimize.
[2023-03-15 01:18:19] [INFO ] Deduced a trap composed of 226 places in 193 ms of which 1 ms to minimize.
[2023-03-15 01:18:19] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 1 ms to minimize.
[2023-03-15 01:18:20] [INFO ] Deduced a trap composed of 310 places in 195 ms of which 0 ms to minimize.
[2023-03-15 01:18:20] [INFO ] Deduced a trap composed of 228 places in 205 ms of which 0 ms to minimize.
[2023-03-15 01:18:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3442 ms
[2023-03-15 01:18:20] [INFO ] Computed and/alt/rep : 640/2790/632 causal constraints (skipped 408 transitions) in 55 ms.
[2023-03-15 01:18:24] [INFO ] Added : 272 causal constraints over 55 iterations in 3760 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 89 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1058/1058 transitions.
Applied a total of 0 rules in 3 ms. Remains 542 /542 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-15 01:18:24] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:24] [INFO ] Invariant cache hit.
[2023-03-15 01:18:24] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
[2023-03-15 01:18:24] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:24] [INFO ] Invariant cache hit.
[2023-03-15 01:18:25] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-15 01:18:25] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:25] [INFO ] Invariant cache hit.
[2023-03-15 01:18:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:18:28] [INFO ] Implicit Places using invariants and state equation in 3739 ms returned []
Implicit Place search using SMT with State Equation took 4091 ms to find 0 implicit places.
[2023-03-15 01:18:28] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:28] [INFO ] Invariant cache hit.
[2023-03-15 01:18:29] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4952 ms. Remains : 542/542 places, 1058/1058 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Finished random walk after 246 steps, including 0 resets, run visited all 9 properties in 7 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0))))]
Knowledge based reduction with 11 factoid took 898 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-15 01:18:31] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:31] [INFO ] Invariant cache hit.
[2023-03-15 01:18:32] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:18:32] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 165 ms returned sat
[2023-03-15 01:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:18:35] [INFO ] [Real]Absence check using state equation in 2682 ms returned sat
[2023-03-15 01:18:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:18:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 01:18:36] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 124 ms returned sat
[2023-03-15 01:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:18:38] [INFO ] [Nat]Absence check using state equation in 1928 ms returned sat
[2023-03-15 01:18:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 01:18:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 312 ms returned sat
[2023-03-15 01:18:38] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 1 ms to minimize.
[2023-03-15 01:18:38] [INFO ] Deduced a trap composed of 288 places in 210 ms of which 0 ms to minimize.
[2023-03-15 01:18:39] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2023-03-15 01:18:39] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 0 ms to minimize.
[2023-03-15 01:18:39] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2023-03-15 01:18:40] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 0 ms to minimize.
[2023-03-15 01:18:40] [INFO ] Deduced a trap composed of 295 places in 191 ms of which 0 ms to minimize.
[2023-03-15 01:18:40] [INFO ] Deduced a trap composed of 298 places in 187 ms of which 1 ms to minimize.
[2023-03-15 01:18:40] [INFO ] Deduced a trap composed of 226 places in 196 ms of which 1 ms to minimize.
[2023-03-15 01:18:41] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 1 ms to minimize.
[2023-03-15 01:18:41] [INFO ] Deduced a trap composed of 310 places in 221 ms of which 1 ms to minimize.
[2023-03-15 01:18:41] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 1 ms to minimize.
[2023-03-15 01:18:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3386 ms
[2023-03-15 01:18:41] [INFO ] Computed and/alt/rep : 640/2790/632 causal constraints (skipped 408 transitions) in 63 ms.
[2023-03-15 01:18:45] [INFO ] Added : 272 causal constraints over 55 iterations in 3806 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 5117 reset in 456 ms.
Product exploration explored 100000 steps with 5119 reset in 463 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1058/1058 transitions.
Applied a total of 0 rules in 20 ms. Remains 542 /542 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-15 01:18:47] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:47] [INFO ] Invariant cache hit.
[2023-03-15 01:18:47] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
[2023-03-15 01:18:47] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 01:18:47] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-15 01:18:47] [INFO ] Invariant cache hit.
[2023-03-15 01:18:48] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 875 ms. Remains : 542/542 places, 1058/1058 transitions.
Built C files in :
/tmp/ltsmin14100817156264352857
[2023-03-15 01:18:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14100817156264352857
Running compilation step : cd /tmp/ltsmin14100817156264352857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1881 ms.
Running link step : cd /tmp/ltsmin14100817156264352857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14100817156264352857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5206736910966260419.hoa' '--buchi-type=spotba'
LTSmin run took 8382 ms.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 58239 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-12 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-15 01:18:58] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13716044685973126437
[2023-03-15 01:18:58] [INFO ] Computing symmetric may disable matrix : 1178 transitions.
[2023-03-15 01:18:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:18:58] [INFO ] Applying decomposition
[2023-03-15 01:18:58] [INFO ] Computing symmetric may enable matrix : 1178 transitions.
[2023-03-15 01:18:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:18:58] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3289613284567922843.txt' '-o' '/tmp/graph3289613284567922843.bin' '-w' '/tmp/graph3289613284567922843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3289613284567922843.bin' '-l' '-1' '-v' '-w' '/tmp/graph3289613284567922843.weights' '-q' '0' '-e' '0.001'
[2023-03-15 01:18:58] [INFO ] Decomposing Gal with order
[2023-03-15 01:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:18:58] [INFO ] Removed a total of 1024 redundant transitions.
[2023-03-15 01:18:58] [INFO ] Computing Do-Not-Accords matrix : 1178 transitions.
[2023-03-15 01:18:58] [INFO ] Flatten gal took : 78 ms
[2023-03-15 01:18:58] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 01:18:58] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13716044685973126437
Running compilation step : cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-15 01:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 14 ms.
[2023-03-15 01:18:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6614537265470183579.gal : 9 ms
[2023-03-15 01:18:58] [INFO ] Time to serialize properties into /tmp/LTLFireability8958435329524923760.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6614537265470183579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8958435329524923760.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(X(("((((i9.u72.CanInjectEvent_0>=1)&&(i5.i0.u7.DataOnSrc_0>=1))&&((i5.i0.u7.PlaceSources_0>=1)&&(i9.u72.cSources_0>=1)))||(((i9.u...705
Formula 0 simplified : XX(!"((((i9.u72.CanInjectEvent_0>=1)&&(i5.i0.u7.DataOnSrc_0>=1))&&((i5.i0.u7.PlaceSources_0>=1)&&(i9.u72.cSources_0>=1)))||(((i9.u72...694
Compilation finished in 3755 ms.
Running link step : cd /tmp/ltsmin13716044685973126437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 18932 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp4==true))||[](<>((LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-15 01:43:24] [INFO ] Applying decomposition
[2023-03-15 01:43:24] [INFO ] Flatten gal took : 116 ms
[2023-03-15 01:43:24] [INFO ] Decomposing Gal with order
[2023-03-15 01:43:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 01:43:25] [INFO ] Removed a total of 3183 redundant transitions.
[2023-03-15 01:43:25] [INFO ] Flatten gal took : 178 ms
[2023-03-15 01:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 25 ms.
[2023-03-15 01:43:25] [INFO ] Time to serialize gal into /tmp/LTLFireability4490514968095848357.gal : 17 ms
[2023-03-15 01:43:25] [INFO ] Time to serialize properties into /tmp/LTLFireability4928553954330874833.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4490514968095848357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4928553954330874833.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(("((((CanInjectEvent.CanInjectEvent_0>=1)&&(Sources0.DataOnSrc_0>=1))&&((Sources0.PlaceSources_0>=1)&&(cSources.cSources_0>=1))...739
Formula 0 simplified : XX(!"((((CanInjectEvent.CanInjectEvent_0>=1)&&(Sources0.DataOnSrc_0>=1))&&((Sources0.PlaceSources_0>=1)&&(cSources.cSources_0>=1)))|...728
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp4==true))||[](<>((LTLAPp5==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13716044685973126437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4727892 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16027620 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T08, 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 r293-tall-167873945300380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;