About the Execution of LTSMin+red for StigmergyElection-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12234.976 | 2908253.00 | 3417388.00 | 8938.20 | ?T?FFFFFFFF?FF?F | 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.r457-smll-167912649600676.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 ltsminxred
Input is StigmergyElection-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649600676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 37M 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 StigmergyElection-PT-09b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679579880477
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 13:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:58:05] [INFO ] Load time of PNML (sax parser for PT used): 2163 ms
[2023-03-23 13:58:05] [INFO ] Transformed 1243 places.
[2023-03-23 13:58:05] [INFO ] Transformed 41210 transitions.
[2023-03-23 13:58:05] [INFO ] Found NUPN structural information;
[2023-03-23 13:58:05] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2569 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-09b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 1087 transition count 41054
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 1087 transition count 41054
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 395 place count 1004 transition count 40971
Iterating global reduction 0 with 83 rules applied. Total rules applied 478 place count 1004 transition count 40971
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 496 place count 986 transition count 40953
Iterating global reduction 0 with 18 rules applied. Total rules applied 514 place count 986 transition count 40953
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 523 place count 977 transition count 40944
Iterating global reduction 0 with 9 rules applied. Total rules applied 532 place count 977 transition count 40944
Applied a total of 532 rules in 1996 ms. Remains 977 /1243 variables (removed 266) and now considering 40944/41210 (removed 266) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 13:58:09] [INFO ] Computed 10 place invariants in 1025 ms
[2023-03-23 13:58:10] [INFO ] Implicit Places using invariants in 1771 ms returned []
Implicit Place search using SMT only with invariants took 1819 ms to find 0 implicit places.
[2023-03-23 13:58:10] [INFO ] Invariant cache hit.
[2023-03-23 13:58:40] [INFO ] Performed 32884/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 13:58:49] [INFO ] Dead Transitions using invariants and state equation in 38545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 977/1243 places, 40944/41210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42375 ms. Remains : 977/1243 places, 40944/41210 transitions.
Support contains 63 out of 977 places after structural reductions.
[2023-03-23 13:58:54] [INFO ] Flatten gal took : 4579 ms
[2023-03-23 13:58:59] [INFO ] Flatten gal took : 4326 ms
[2023-03-23 13:59:08] [INFO ] Input system was already deterministic with 40944 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 926 ms. (steps per millisecond=10 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) seen :0
Interrupted probabilistic random walk after 24281 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24281 steps, saw 8972 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 38 properties.
[2023-03-23 13:59:13] [INFO ] Invariant cache hit.
[2023-03-23 13:59:14] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-23 13:59:38] [INFO ] After 23977ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:37
[2023-03-23 13:59:38] [INFO ] After 24079ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-23 13:59:38] [INFO ] After 25136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-23 13:59:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-23 14:00:03] [INFO ] After 23551ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :35
[2023-03-23 14:00:03] [INFO ] After 23552ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :35
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-23 14:00:03] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :35
Fused 38 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 63 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 905 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 18 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.328 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 528 rules applied. Total rules applied 530 place count 842 transition count 40245
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 537 rules applied. Total rules applied 1067 place count 323 transition count 40227
Reduce places removed 9 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 39 rules applied. Total rules applied 1106 place count 314 transition count 40197
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1136 place count 284 transition count 40197
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1136 place count 284 transition count 40156
Deduced a syphon composed of 41 places in 33 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1218 place count 243 transition count 40156
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 23 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1310 place count 197 transition count 40110
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1328 place count 197 transition count 40092
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1347 place count 178 transition count 40056
Iterating global reduction 5 with 19 rules applied. Total rules applied 1366 place count 178 transition count 40056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1367 place count 178 transition count 40055
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1376 place count 169 transition count 40046
Iterating global reduction 6 with 9 rules applied. Total rules applied 1385 place count 169 transition count 40046
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 24 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1403 place count 160 transition count 40037
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1409 place count 157 transition count 40045
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 1434 place count 157 transition count 40020
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1459 place count 132 transition count 40020
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1468 place count 123 transition count 40011
Iterating global reduction 7 with 9 rules applied. Total rules applied 1477 place count 123 transition count 40011
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1485 place count 123 transition count 40011
Applied a total of 1485 rules in 13760 ms. Remains 123 /977 variables (removed 854) and now considering 40011/40944 (removed 933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13766 ms. Remains : 123/977 places, 40011/40944 transitions.
Incomplete random walk after 10000 steps, including 390 resets, run finished after 1431 ms. (steps per millisecond=6 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 35) seen :0
Interrupted probabilistic random walk after 35654 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 35654 steps, saw 11240 distinct states, run finished after 6001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 35 properties.
[2023-03-23 14:00:25] [INFO ] Flow matrix only has 40009 transitions (discarded 2 similar events)
// Phase 1: matrix 40009 rows 123 cols
[2023-03-23 14:00:25] [INFO ] Computed 10 place invariants in 425 ms
[2023-03-23 14:00:26] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-23 14:00:45] [INFO ] After 19200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:34
[2023-03-23 14:00:48] [INFO ] State equation strengthened by 492 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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-23 14:00:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:00:50] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 35 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 63 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 40011/40011 transitions.
Applied a total of 0 rules in 746 ms. Remains 123 /123 variables (removed 0) and now considering 40011/40011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 123/123 places, 40011/40011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 40011/40011 transitions.
Applied a total of 0 rules in 746 ms. Remains 123 /123 variables (removed 0) and now considering 40011/40011 (removed 0) transitions.
[2023-03-23 14:00:52] [INFO ] Flow matrix only has 40009 transitions (discarded 2 similar events)
[2023-03-23 14:00:52] [INFO ] Invariant cache hit.
[2023-03-23 14:00:52] [INFO ] Implicit Places using invariants in 174 ms returned [122]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/123 places, 40009/40011 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 40007
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 40007
Performed 9 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 9 places in 24 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 22 place count 111 transition count 39983
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 111 transition count 39983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 111 transition count 39980
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 108 transition count 39977
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 108 transition count 39977
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 39976
Applied a total of 35 rules in 13441 ms. Remains 107 /122 variables (removed 15) and now considering 39976/40009 (removed 33) transitions.
// Phase 1: matrix 39976 rows 107 cols
[2023-03-23 14:01:06] [INFO ] Computed 9 place invariants in 405 ms
[2023-03-23 14:01:06] [INFO ] Implicit Places using invariants in 556 ms returned []
Implicit Place search using SMT only with invariants took 558 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/123 places, 39976/40011 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14982 ms. Remains : 107/123 places, 39976/40011 transitions.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Computed a total of 135 stabilizing places and 144 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' '!(G(((!p0 U (p1||G(!p0)))||(X(p0)&&G(p2)))))'
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 288 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:01:08] [INFO ] Computed 10 place invariants in 887 ms
[2023-03-23 14:01:14] [INFO ] Implicit Places using invariants in 6770 ms returned []
Implicit Place search using SMT only with invariants took 6772 ms to find 0 implicit places.
[2023-03-23 14:01:14] [INFO ] Invariant cache hit.
[2023-03-23 14:01:44] [INFO ] Performed 38142/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:01:46] [INFO ] Dead Transitions using invariants and state equation in 32289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39356 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p2) (NOT p1) p0), true, (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p2 (NOT p1) p0), false]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(OR (EQ s84 0) (EQ s190 0) (EQ s285 0) (EQ s391 0) (EQ s486 0) (EQ s614 0) (EQ s709 0) (EQ s826 0) (EQ s932 0) (AND (EQ s26 1) (EQ s132 1) (EQ s238 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 649 reset in 3525 ms.
Product exploration explored 100000 steps with 647 reset in 2729 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1545 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 20683 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20683 steps, saw 8329 distinct states, run finished after 3004 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-23 14:02:00] [INFO ] Invariant cache hit.
[2023-03-23 14:02:01] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 14:02:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-23 14:02:26] [INFO ] After 24584ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-23 14:02:26] [INFO ] After 24619ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 14:02:26] [INFO ] After 25142ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 4 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.129 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 583 rules applied. Total rules applied 585 place count 842 transition count 40190
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 592 rules applied. Total rules applied 1177 place count 268 transition count 40172
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1186 place count 259 transition count 40172
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1186 place count 259 transition count 40126
Deduced a syphon composed of 46 places in 31 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1278 place count 213 transition count 40126
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1279 place count 213 transition count 40125
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1371 place count 167 transition count 40079
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1389 place count 167 transition count 40061
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1413 place count 143 transition count 22934
Iterating global reduction 5 with 24 rules applied. Total rules applied 1437 place count 143 transition count 22934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1443 place count 143 transition count 22928
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1452 place count 134 transition count 22919
Iterating global reduction 6 with 9 rules applied. Total rules applied 1461 place count 134 transition count 22919
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1479 place count 125 transition count 22910
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1485 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1544 place count 122 transition count 22859
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 1604 place count 63 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1613 place count 54 transition count 22849
Iterating global reduction 7 with 9 rules applied. Total rules applied 1622 place count 54 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1637 place count 54 transition count 22834
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1642 place count 54 transition count 22834
Applied a total of 1642 rules in 15072 ms. Remains 54 /977 variables (removed 923) and now considering 22834/40944 (removed 18110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15076 ms. Remains : 54/977 places, 22834/40944 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 2577 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Finished Best-First random walk after 122 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) p1 p2)), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 21 factoid took 1653 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Stuttering acceptance computed with spot in 354 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 452 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:02:47] [INFO ] Invariant cache hit.
[2023-03-23 14:02:56] [INFO ] Implicit Places using invariants in 8363 ms returned []
Implicit Place search using SMT only with invariants took 8365 ms to find 0 implicit places.
[2023-03-23 14:02:56] [INFO ] Invariant cache hit.
[2023-03-23 14:03:26] [INFO ] Performed 34686/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:03:31] [INFO ] Dead Transitions using invariants and state equation in 35168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43994 ms. Remains : 977/977 places, 40944/40944 transitions.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (AND (NOT p0) p2)), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 705 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 20543 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20543 steps, saw 8304 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 14:03:37] [INFO ] Invariant cache hit.
[2023-03-23 14:03:37] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 14:03:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-23 14:04:02] [INFO ] After 24496ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 14:04:02] [INFO ] After 24620ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 14:04:02] [INFO ] After 25166ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.112 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 583 rules applied. Total rules applied 585 place count 842 transition count 40190
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 592 rules applied. Total rules applied 1177 place count 268 transition count 40172
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1186 place count 259 transition count 40172
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1186 place count 259 transition count 40126
Deduced a syphon composed of 46 places in 40 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1278 place count 213 transition count 40126
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1279 place count 213 transition count 40125
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1371 place count 167 transition count 40079
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1389 place count 167 transition count 40061
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1413 place count 143 transition count 22934
Iterating global reduction 5 with 24 rules applied. Total rules applied 1437 place count 143 transition count 22934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1443 place count 143 transition count 22928
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1452 place count 134 transition count 22919
Iterating global reduction 6 with 9 rules applied. Total rules applied 1461 place count 134 transition count 22919
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1479 place count 125 transition count 22910
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1485 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1544 place count 122 transition count 22859
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 1604 place count 63 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1613 place count 54 transition count 22849
Iterating global reduction 7 with 9 rules applied. Total rules applied 1622 place count 54 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1637 place count 54 transition count 22834
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1642 place count 54 transition count 22834
Applied a total of 1642 rules in 15617 ms. Remains 54 /977 variables (removed 923) and now considering 22834/40944 (removed 18110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15620 ms. Remains : 54/977 places, 22834/40944 transitions.
Incomplete random walk after 10000 steps, including 547 resets, run finished after 2544 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 2) seen :1
Finished Best-First random walk after 128 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=21 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (AND (NOT p0) p2)), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (G (OR p1 p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 1178 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 302 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 287 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 649 reset in 2246 ms.
Product exploration explored 100000 steps with 652 reset in 2113 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 557 place count 851 transition count 40800
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 566 place count 851 transition count 40791
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 566 place count 851 transition count 40800
Deduced a syphon composed of 574 places in 36 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 584 place count 851 transition count 40800
Discarding 472 places :
Symmetric choice reduction at 2 with 472 rule applications. Total rules 1056 place count 379 transition count 40328
Deduced a syphon composed of 110 places in 36 ms
Iterating global reduction 2 with 472 rules applied. Total rules applied 1528 place count 379 transition count 40328
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 183 places in 16 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 1601 place count 379 transition count 40328
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 1689 place count 291 transition count 23128
Deduced a syphon composed of 119 places in 9 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1777 place count 291 transition count 23128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1783 place count 291 transition count 23122
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1807 place count 267 transition count 23089
Deduced a syphon composed of 104 places in 10 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1831 place count 267 transition count 23089
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1840 place count 258 transition count 23080
Deduced a syphon composed of 104 places in 10 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1849 place count 258 transition count 23080
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 116 places in 10 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1861 place count 258 transition count 23136
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1882 place count 237 transition count 23094
Deduced a syphon composed of 95 places in 10 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1903 place count 237 transition count 23094
Deduced a syphon composed of 95 places in 10 ms
Applied a total of 1903 rules in 22319 ms. Remains 237 /977 variables (removed 740) and now considering 23094/40944 (removed 17850) transitions.
[2023-03-23 14:04:50] [INFO ] Flow matrix only has 23084 transitions (discarded 10 similar events)
// Phase 1: matrix 23084 rows 237 cols
[2023-03-23 14:04:51] [INFO ] Computed 2 place invariants in 434 ms
[2023-03-23 14:05:11] [INFO ] Dead Transitions using invariants and state equation in 21087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/977 places, 23094/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43410 ms. Remains : 237/977 places, 23094/40944 transitions.
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 282 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:05:13] [INFO ] Computed 10 place invariants in 801 ms
[2023-03-23 14:05:20] [INFO ] Implicit Places using invariants in 8440 ms returned []
Implicit Place search using SMT only with invariants took 8442 ms to find 0 implicit places.
[2023-03-23 14:05:20] [INFO ] Invariant cache hit.
[2023-03-23 14:05:51] [INFO ] Performed 35920/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:05:54] [INFO ] Dead Transitions using invariants and state equation in 34040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42768 ms. Remains : 977/977 places, 40944/40944 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-00 finished in 295762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 14 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 425 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:06:03] [INFO ] Invariant cache hit.
[2023-03-23 14:06:16] [INFO ] Implicit Places using invariants in 12882 ms returned []
Implicit Place search using SMT only with invariants took 12883 ms to find 0 implicit places.
[2023-03-23 14:06:16] [INFO ] Invariant cache hit.
[2023-03-23 14:06:46] [INFO ] Performed 35513/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:06:50] [INFO ] Dead Transitions using invariants and state equation in 34455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47768 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (EQ s84 1) (EQ s179 1) (EQ s296 1) (EQ s402 1) (EQ s497 1) (EQ s614 1) (EQ s709 1) (EQ s804 1) (EQ s932 1))) (NOT (AND (EQ s73 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4038 ms.
Product exploration explored 100000 steps with 50000 reset in 3427 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-09b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-09b-LTLFireability-01 finished in 56457 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((X(G(p1))||p0))))'
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 386 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:07:00] [INFO ] Invariant cache hit.
[2023-03-23 14:07:10] [INFO ] Implicit Places using invariants in 10674 ms returned []
Implicit Place search using SMT only with invariants took 10675 ms to find 0 implicit places.
[2023-03-23 14:07:10] [INFO ] Invariant cache hit.
[2023-03-23 14:07:40] [INFO ] Performed 36637/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:07:44] [INFO ] Dead Transitions using invariants and state equation in 33889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44956 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (NEQ s84 1) (NEQ s168 1) (NEQ s285 1) (NEQ s391 1) (NEQ s497 1) (NEQ s603 1) (NEQ s709 1) (NEQ s826 1) (NEQ s910 1)) (EQ s37 1) (EQ s154 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 652 reset in 2287 ms.
Product exploration explored 100000 steps with 649 reset in 2053 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 18437 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18437 steps, saw 7915 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 14:07:53] [INFO ] Invariant cache hit.
[2023-03-23 14:07:54] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-23 14:08:19] [INFO ] After 24815ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 14:08:19] [INFO ] After 24859ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-23 14:08:19] [INFO ] After 25089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 985 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.167 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 594 rules applied. Total rules applied 596 place count 842 transition count 40179
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 603 rules applied. Total rules applied 1199 place count 257 transition count 40161
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1208 place count 248 transition count 40161
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1208 place count 248 transition count 40115
Deduced a syphon composed of 46 places in 30 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1300 place count 202 transition count 40115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1301 place count 202 transition count 40114
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 15 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1393 place count 156 transition count 40068
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1411 place count 156 transition count 40050
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1432 place count 135 transition count 29079
Iterating global reduction 5 with 21 rules applied. Total rules applied 1453 place count 135 transition count 29079
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1456 place count 135 transition count 29076
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1465 place count 126 transition count 29067
Iterating global reduction 6 with 9 rules applied. Total rules applied 1474 place count 126 transition count 29067
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1492 place count 117 transition count 29058
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1498 place count 114 transition count 29066
Free-agglomeration rule applied 62 times.
Iterating global reduction 6 with 62 rules applied. Total rules applied 1560 place count 114 transition count 29004
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 6 with 191 rules applied. Total rules applied 1751 place count 52 transition count 28875
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1760 place count 43 transition count 28866
Iterating global reduction 7 with 9 rules applied. Total rules applied 1769 place count 43 transition count 28866
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 2280 place count 43 transition count 28355
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 2285 place count 43 transition count 28355
Applied a total of 2285 rules in 25520 ms. Remains 43 /977 variables (removed 934) and now considering 28355/40944 (removed 12589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25522 ms. Remains : 43/977 places, 28355/40944 transitions.
Incomplete random walk after 10000 steps, including 549 resets, run finished after 4681 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Finished Best-First random walk after 111 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 575 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:08:50] [INFO ] Invariant cache hit.
[2023-03-23 14:09:02] [INFO ] Implicit Places using invariants in 11878 ms returned []
Implicit Place search using SMT only with invariants took 11880 ms to find 0 implicit places.
[2023-03-23 14:09:02] [INFO ] Invariant cache hit.
[2023-03-23 14:09:32] [INFO ] Performed 33866/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:09:38] [INFO ] Dead Transitions using invariants and state equation in 35822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48285 ms. Remains : 977/977 places, 40944/40944 transitions.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19279 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19279 steps, saw 8080 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 14:09:43] [INFO ] Invariant cache hit.
[2023-03-23 14:09:43] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-23 14:10:07] [INFO ] After 23933ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 14:12:08] [INFO ] Deduced a trap composed of 0 places in 120076 ms of which 60 ms to minimize.
[2023-03-23 14:12:08] [INFO ] After 145000ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 14:12:08] [INFO ] After 145333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 985 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.188 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 594 rules applied. Total rules applied 596 place count 842 transition count 40179
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 603 rules applied. Total rules applied 1199 place count 257 transition count 40161
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1208 place count 248 transition count 40161
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1208 place count 248 transition count 40115
Deduced a syphon composed of 46 places in 28 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1300 place count 202 transition count 40115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1301 place count 202 transition count 40114
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1393 place count 156 transition count 40068
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1411 place count 156 transition count 40050
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1432 place count 135 transition count 29079
Iterating global reduction 5 with 21 rules applied. Total rules applied 1453 place count 135 transition count 29079
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1456 place count 135 transition count 29076
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1465 place count 126 transition count 29067
Iterating global reduction 6 with 9 rules applied. Total rules applied 1474 place count 126 transition count 29067
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1492 place count 117 transition count 29058
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1498 place count 114 transition count 29066
Free-agglomeration rule applied 62 times.
Iterating global reduction 6 with 62 rules applied. Total rules applied 1560 place count 114 transition count 29004
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 6 with 191 rules applied. Total rules applied 1751 place count 52 transition count 28875
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1760 place count 43 transition count 28866
Iterating global reduction 7 with 9 rules applied. Total rules applied 1769 place count 43 transition count 28866
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 2280 place count 43 transition count 28355
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 2285 place count 43 transition count 28355
Applied a total of 2285 rules in 25401 ms. Remains 43 /977 variables (removed 934) and now considering 28355/40944 (removed 12589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25404 ms. Remains : 43/977 places, 28355/40944 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 651 reset in 2208 ms.
Product exploration explored 100000 steps with 649 reset in 2116 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 985 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 567 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 567 rules applied. Total rules applied 568 place count 851 transition count 40800
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 577 place count 851 transition count 40791
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 577 place count 851 transition count 40800
Deduced a syphon composed of 585 places in 31 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 595 place count 851 transition count 40800
Discarding 483 places :
Symmetric choice reduction at 2 with 483 rule applications. Total rules 1078 place count 368 transition count 40317
Deduced a syphon composed of 110 places in 31 ms
Iterating global reduction 2 with 483 rules applied. Total rules applied 1561 place count 368 transition count 40317
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 183 places in 21 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 1634 place count 368 transition count 40317
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 1719 place count 283 transition count 29273
Deduced a syphon composed of 119 places in 12 ms
Iterating global reduction 2 with 85 rules applied. Total rules applied 1804 place count 283 transition count 29273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1807 place count 283 transition count 29270
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1828 place count 262 transition count 29240
Deduced a syphon composed of 107 places in 12 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1849 place count 262 transition count 29240
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1858 place count 253 transition count 29231
Deduced a syphon composed of 107 places in 12 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1867 place count 253 transition count 29231
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 119 places in 16 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1879 place count 253 transition count 29287
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1900 place count 232 transition count 29245
Deduced a syphon composed of 98 places in 12 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1921 place count 232 transition count 29245
Deduced a syphon composed of 98 places in 12 ms
Applied a total of 1921 rules in 22497 ms. Remains 232 /977 variables (removed 745) and now considering 29245/40944 (removed 11699) transitions.
[2023-03-23 14:13:01] [INFO ] Flow matrix only has 29235 transitions (discarded 10 similar events)
// Phase 1: matrix 29235 rows 232 cols
[2023-03-23 14:13:02] [INFO ] Computed 2 place invariants in 488 ms
[2023-03-23 14:13:24] [INFO ] Dead Transitions using invariants and state equation in 23012 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/977 places, 29245/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45518 ms. Remains : 232/977 places, 29245/40944 transitions.
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 372 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:13:26] [INFO ] Computed 10 place invariants in 780 ms
[2023-03-23 14:13:34] [INFO ] Implicit Places using invariants in 9686 ms returned []
Implicit Place search using SMT only with invariants took 9687 ms to find 0 implicit places.
[2023-03-23 14:13:35] [INFO ] Invariant cache hit.
[2023-03-23 14:14:05] [INFO ] Performed 34436/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:14:11] [INFO ] Dead Transitions using invariants and state equation in 36716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46778 ms. Remains : 977/977 places, 40944/40944 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-02 finished in 440414 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 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 483 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:14:20] [INFO ] Invariant cache hit.
[2023-03-23 14:14:34] [INFO ] Implicit Places using invariants in 13566 ms returned []
Implicit Place search using SMT only with invariants took 13567 ms to find 0 implicit places.
[2023-03-23 14:14:34] [INFO ] Invariant cache hit.
[2023-03-23 14:15:04] [INFO ] Performed 34235/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:15:09] [INFO ] Dead Transitions using invariants and state equation in 35195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49250 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s154 1) (EQ s260 1) (EQ s355 1) (EQ s450 1) (EQ s556 1) (EQ s662 1) (EQ s768 1) (EQ s885 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]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 6 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-03 finished in 49573 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||G(F(p0))))))'
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 698 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:15:10] [INFO ] Invariant cache hit.
[2023-03-23 14:15:24] [INFO ] Implicit Places using invariants in 13793 ms returned []
Implicit Place search using SMT only with invariants took 13794 ms to find 0 implicit places.
[2023-03-23 14:15:24] [INFO ] Invariant cache hit.
[2023-03-23 14:15:54] [INFO ] Performed 36300/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:15:57] [INFO ] Dead Transitions using invariants and state equation in 33666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48165 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s84 1) (EQ s168 1) (EQ s296 1) (EQ s391 1) (EQ s497 1) (EQ s592 1) (EQ s698 1) (EQ s804 1) (EQ s932 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]]
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 6 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-04 finished in 48516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 994 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 850 transition count 40223
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 594 rules applied. Total rules applied 1171 place count 274 transition count 40205
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1180 place count 265 transition count 40205
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1180 place count 265 transition count 40168
Deduced a syphon composed of 37 places in 24 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1254 place count 228 transition count 40168
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1262 place count 220 transition count 40160
Iterating global reduction 3 with 8 rules applied. Total rules applied 1270 place count 220 transition count 40160
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 16 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1358 place count 176 transition count 40116
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1389 place count 145 transition count 5123
Iterating global reduction 3 with 31 rules applied. Total rules applied 1420 place count 145 transition count 5123
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1433 place count 145 transition count 5110
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1442 place count 136 transition count 5092
Iterating global reduction 4 with 9 rules applied. Total rules applied 1451 place count 136 transition count 5092
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1460 place count 127 transition count 5074
Iterating global reduction 4 with 9 rules applied. Total rules applied 1469 place count 127 transition count 5074
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1495 place count 114 transition count 5081
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1496 place count 113 transition count 5063
Iterating global reduction 4 with 1 rules applied. Total rules applied 1497 place count 113 transition count 5063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1498 place count 113 transition count 5062
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1507 place count 113 transition count 5053
Applied a total of 1507 rules in 15049 ms. Remains 113 /977 variables (removed 864) and now considering 5053/40944 (removed 35891) transitions.
[2023-03-23 14:16:13] [INFO ] Flow matrix only has 5043 transitions (discarded 10 similar events)
// Phase 1: matrix 5043 rows 113 cols
[2023-03-23 14:16:13] [INFO ] Computed 2 place invariants in 56 ms
[2023-03-23 14:16:14] [INFO ] Implicit Places using invariants in 1564 ms returned []
[2023-03-23 14:16:14] [INFO ] Flow matrix only has 5043 transitions (discarded 10 similar events)
[2023-03-23 14:16:14] [INFO ] Invariant cache hit.
[2023-03-23 14:16:15] [INFO ] State equation strengthened by 511 read => feed constraints.
[2023-03-23 14:16:24] [INFO ] Implicit Places using invariants and state equation in 10141 ms returned []
Implicit Place search using SMT with State Equation took 11708 ms to find 0 implicit places.
[2023-03-23 14:16:25] [INFO ] Redundant transitions in 771 ms returned []
[2023-03-23 14:16:25] [INFO ] Flow matrix only has 5043 transitions (discarded 10 similar events)
[2023-03-23 14:16:25] [INFO ] Invariant cache hit.
[2023-03-23 14:16:28] [INFO ] Dead Transitions using invariants and state equation in 2954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/977 places, 5053/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30496 ms. Remains : 113/977 places, 5053/40944 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s19 1) (EQ s29 1) (EQ s42 1) (EQ s53 1) (EQ s66 1) (EQ s80 1) (EQ s91 1) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-05 finished in 30575 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)&&X(G(p1)))))'
Support contains 16 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 987 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 569 transitions
Trivial Post-agglo rules discarded 569 transitions
Performed 569 trivial Post agglomeration. Transition count delta: 569
Iterating post reduction 0 with 569 rules applied. Total rules applied 570 place count 850 transition count 40230
Reduce places removed 569 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 587 rules applied. Total rules applied 1157 place count 281 transition count 40212
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1166 place count 272 transition count 40212
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1166 place count 272 transition count 40175
Deduced a syphon composed of 37 places in 27 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1240 place count 235 transition count 40175
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1248 place count 227 transition count 40167
Iterating global reduction 3 with 8 rules applied. Total rules applied 1256 place count 227 transition count 40167
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 18 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1344 place count 183 transition count 40123
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1372 place count 155 transition count 14364
Iterating global reduction 3 with 28 rules applied. Total rules applied 1400 place count 155 transition count 14364
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1410 place count 155 transition count 14354
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1419 place count 146 transition count 14336
Iterating global reduction 4 with 9 rules applied. Total rules applied 1428 place count 146 transition count 14336
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1437 place count 137 transition count 14318
Iterating global reduction 4 with 9 rules applied. Total rules applied 1446 place count 137 transition count 14318
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1472 place count 124 transition count 14325
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1473 place count 123 transition count 14307
Iterating global reduction 4 with 1 rules applied. Total rules applied 1474 place count 123 transition count 14307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1475 place count 123 transition count 14306
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1484 place count 123 transition count 14297
Applied a total of 1484 rules in 17240 ms. Remains 123 /977 variables (removed 854) and now considering 14297/40944 (removed 26647) transitions.
[2023-03-23 14:16:45] [INFO ] Flow matrix only has 14287 transitions (discarded 10 similar events)
// Phase 1: matrix 14287 rows 123 cols
[2023-03-23 14:16:46] [INFO ] Computed 2 place invariants in 195 ms
[2023-03-23 14:16:48] [INFO ] Implicit Places using invariants in 3051 ms returned []
Implicit Place search using SMT only with invariants took 3052 ms to find 0 implicit places.
[2023-03-23 14:16:48] [INFO ] Flow matrix only has 14287 transitions (discarded 10 similar events)
[2023-03-23 14:16:48] [INFO ] Invariant cache hit.
[2023-03-23 14:16:58] [INFO ] Dead Transitions using invariants and state equation in 9347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/977 places, 14297/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29648 ms. Remains : 123/977 places, 14297/40944 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s18 1) (EQ s31 1) (EQ s47 1) (EQ s61 1) (EQ s72 1) (EQ s86 1) (EQ s100 1) (EQ s114 1)), p1:(AND (EQ s4 1) (EQ s20 1) (EQ s33 1) (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-07 finished in 29880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((!p1 U (F(!p3)&&p2)))))'
Support contains 32 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 936 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 532 transitions
Trivial Post-agglo rules discarded 532 transitions
Performed 532 trivial Post agglomeration. Transition count delta: 532
Iterating post reduction 0 with 532 rules applied. Total rules applied 533 place count 850 transition count 40267
Reduce places removed 532 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 550 rules applied. Total rules applied 1083 place count 318 transition count 40249
Reduce places removed 9 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 39 rules applied. Total rules applied 1122 place count 309 transition count 40219
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1152 place count 279 transition count 40219
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 1152 place count 279 transition count 40187
Deduced a syphon composed of 32 places in 27 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1216 place count 247 transition count 40187
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1224 place count 239 transition count 40179
Iterating global reduction 4 with 8 rules applied. Total rules applied 1232 place count 239 transition count 40179
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 23 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1320 place count 195 transition count 40135
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1341 place count 174 transition count 26257
Iterating global reduction 4 with 21 rules applied. Total rules applied 1362 place count 174 transition count 26257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1365 place count 174 transition count 26254
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1374 place count 165 transition count 26236
Iterating global reduction 5 with 9 rules applied. Total rules applied 1383 place count 165 transition count 26236
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1392 place count 156 transition count 26218
Iterating global reduction 5 with 9 rules applied. Total rules applied 1401 place count 156 transition count 26218
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 13 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1427 place count 143 transition count 26225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1428 place count 142 transition count 26207
Iterating global reduction 5 with 1 rules applied. Total rules applied 1429 place count 142 transition count 26207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1430 place count 142 transition count 26206
Applied a total of 1430 rules in 12744 ms. Remains 142 /977 variables (removed 835) and now considering 26206/40944 (removed 14738) transitions.
[2023-03-23 14:17:11] [INFO ] Flow matrix only has 26197 transitions (discarded 9 similar events)
// Phase 1: matrix 26197 rows 142 cols
[2023-03-23 14:17:11] [INFO ] Computed 2 place invariants in 314 ms
[2023-03-23 14:17:17] [INFO ] Implicit Places using invariants in 6579 ms returned []
Implicit Place search using SMT only with invariants took 6586 ms to find 0 implicit places.
[2023-03-23 14:17:17] [INFO ] Flow matrix only has 26197 transitions (discarded 9 similar events)
[2023-03-23 14:17:17] [INFO ] Invariant cache hit.
[2023-03-23 14:17:37] [INFO ] Dead Transitions using invariants and state equation in 19816 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/977 places, 26206/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39151 ms. Remains : 142/977 places, 26206/40944 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p2) p3), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p3, (OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s15 1) (EQ s30 1) (EQ s45 1) (EQ s61 1) (EQ s75 1) (EQ s90 1) (EQ s106 1) (EQ s123 1) (EQ s139 1)), p0:(AND (EQ s9 1) (EQ s23 1) (EQ s40 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-08 finished in 39542 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(p0))||(G(p2)&&p1)))))'
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 514 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:17:39] [INFO ] Computed 10 place invariants in 996 ms
[2023-03-23 14:17:51] [INFO ] Implicit Places using invariants in 13152 ms returned []
Implicit Place search using SMT only with invariants took 13164 ms to find 0 implicit places.
[2023-03-23 14:17:51] [INFO ] Invariant cache hit.
[2023-03-23 14:18:22] [INFO ] Performed 28969/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:18:32] [INFO ] Dead Transitions using invariants and state equation in 40687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54372 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s143 1) (EQ s249 1) (EQ s355 1) (EQ s472 1) (EQ s556 1) (EQ s673 1) (EQ s779 1) (EQ s885 1)), p2:(OR (EQ s84 0) (EQ s190 0) (EQ s28...], 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]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 5 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-09 finished in 54738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 583 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:18:33] [INFO ] Invariant cache hit.
[2023-03-23 14:18:45] [INFO ] Implicit Places using invariants in 12000 ms returned []
Implicit Place search using SMT only with invariants took 12007 ms to find 0 implicit places.
[2023-03-23 14:18:45] [INFO ] Invariant cache hit.
[2023-03-23 14:19:15] [INFO ] Performed 36616/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:19:18] [INFO ] Dead Transitions using invariants and state equation in 33446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46043 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s48 1) (EQ s143 1) (EQ s249 1) (EQ s366 1) (EQ s450 1) (EQ s556 1) (EQ s662 1) (EQ s790 1) (EQ s896 1)), p1:(AND (EQ s84 1) (EQ s190 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 5 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-10 finished in 46322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||(F(G(p2))&&G(p3))||p0)))'
Support contains 21 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 982 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 564 transitions
Trivial Post-agglo rules discarded 564 transitions
Performed 564 trivial Post agglomeration. Transition count delta: 564
Iterating post reduction 0 with 564 rules applied. Total rules applied 565 place count 850 transition count 40235
Reduce places removed 564 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 582 rules applied. Total rules applied 1147 place count 286 transition count 40217
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1156 place count 277 transition count 40217
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1156 place count 277 transition count 40180
Deduced a syphon composed of 37 places in 24 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1230 place count 240 transition count 40180
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1238 place count 232 transition count 40172
Iterating global reduction 3 with 8 rules applied. Total rules applied 1246 place count 232 transition count 40172
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 17 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1334 place count 188 transition count 40128
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1361 place count 161 transition count 20930
Iterating global reduction 3 with 27 rules applied. Total rules applied 1388 place count 161 transition count 20930
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1397 place count 161 transition count 20921
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1406 place count 152 transition count 20903
Iterating global reduction 4 with 9 rules applied. Total rules applied 1415 place count 152 transition count 20903
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1424 place count 143 transition count 20885
Iterating global reduction 4 with 9 rules applied. Total rules applied 1433 place count 143 transition count 20885
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1459 place count 130 transition count 20892
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1460 place count 129 transition count 20874
Iterating global reduction 4 with 1 rules applied. Total rules applied 1461 place count 129 transition count 20874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1462 place count 129 transition count 20873
Applied a total of 1462 rules in 13076 ms. Remains 129 /977 variables (removed 848) and now considering 20873/40944 (removed 20071) transitions.
[2023-03-23 14:19:32] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
// Phase 1: matrix 20863 rows 129 cols
[2023-03-23 14:19:32] [INFO ] Computed 2 place invariants in 315 ms
[2023-03-23 14:19:34] [INFO ] Implicit Places using invariants in 2697 ms returned []
Implicit Place search using SMT only with invariants took 2698 ms to find 0 implicit places.
[2023-03-23 14:19:34] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:19:34] [INFO ] Invariant cache hit.
[2023-03-23 14:19:51] [INFO ] Dead Transitions using invariants and state equation in 16876 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/977 places, 20873/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32653 ms. Remains : 129/977 places, 20873/40944 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s22 0) (EQ s33 0) (EQ s45 0) (EQ s59 0) (EQ s73 0) (EQ s89 0) (EQ s102 0) (EQ s117 0)), p1:(OR (EQ s4 0) (EQ s18 0) (EQ s35 0) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 5443 reset in 3946 ms.
Product exploration explored 100000 steps with 5454 reset in 3571 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X p1), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X p3), (X (AND p1 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 2019 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 1097 ms. (steps per millisecond=9 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 41454 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41454 steps, saw 13193 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 14:20:06] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:20:06] [INFO ] Invariant cache hit.
[2023-03-23 14:20:06] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 14:20:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 14:20:21] [INFO ] After 14778ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-03-23 14:20:25] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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-23 14:20:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:20:31] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 21 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 20873/20873 transitions.
Graph (complete) has 1108 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.88 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 128 transition count 20853
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 110 transition count 20835
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 110 transition count 20826
Free-agglomeration rule applied 55 times.
Iterating global reduction 2 with 55 rules applied. Total rules applied 120 place count 110 transition count 20771
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 177 place count 54 transition count 20770
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 186 place count 45 transition count 20761
Iterating global reduction 3 with 9 rules applied. Total rules applied 195 place count 45 transition count 20761
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 3 with 511 rules applied. Total rules applied 706 place count 45 transition count 20250
Performed 9 Post agglomeration using F-continuation condition with reduction of 513 identical transitions.
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 724 place count 36 transition count 19728
Drop transitions removed 9 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 742 place count 36 transition count 19710
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 752 place count 31 transition count 19705
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 30 transition count 19704
Applied a total of 753 rules in 85674 ms. Remains 30 /129 variables (removed 99) and now considering 19704/20873 (removed 1169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85675 ms. Remains : 30/129 places, 19704/20873 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X p1), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X p3), (X (AND p1 p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X p0)), (G (NOT (AND (NOT p1) p3 (NOT p0)))), (G (NOT (AND (NOT p1) p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) p3 (NOT p2)))), (G (NOT (AND p1 (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 1856 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Support contains 21 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 20873/20873 transitions.
Applied a total of 0 rules in 67 ms. Remains 129 /129 variables (removed 0) and now considering 20873/20873 (removed 0) transitions.
[2023-03-23 14:21:59] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:21:59] [INFO ] Invariant cache hit.
[2023-03-23 14:22:01] [INFO ] Implicit Places using invariants in 1655 ms returned []
Implicit Place search using SMT only with invariants took 1656 ms to find 0 implicit places.
[2023-03-23 14:22:01] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:22:01] [INFO ] Invariant cache hit.
[2023-03-23 14:22:19] [INFO ] Dead Transitions using invariants and state equation in 17845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19571 ms. Remains : 129/129 places, 20873/20873 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p3 p1 p2), (X p1), (X (NOT (AND (NOT p0) p3))), (X p3), (X (AND p1 p3)), (X (OR p0 (NOT p3))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p3)), (X (X (AND p1 p3))), (X (X (OR p0 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 550 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 543 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 47581 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47581 steps, saw 14329 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 14:22:24] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:22:24] [INFO ] Invariant cache hit.
[2023-03-23 14:22:24] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 14:22:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 14:22:36] [INFO ] After 11860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 14:22:37] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
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-23 14:22:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:22:49] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 21 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 20873/20873 transitions.
Graph (complete) has 1108 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.54 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 128 transition count 20853
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 110 transition count 20835
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 110 transition count 20826
Free-agglomeration rule applied 55 times.
Iterating global reduction 2 with 55 rules applied. Total rules applied 120 place count 110 transition count 20771
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 177 place count 54 transition count 20770
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 186 place count 45 transition count 20761
Iterating global reduction 3 with 9 rules applied. Total rules applied 195 place count 45 transition count 20761
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 3 with 511 rules applied. Total rules applied 706 place count 45 transition count 20250
Performed 9 Post agglomeration using F-continuation condition with reduction of 513 identical transitions.
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 724 place count 36 transition count 19728
Drop transitions removed 9 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 742 place count 36 transition count 19710
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 752 place count 31 transition count 19705
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 30 transition count 19704
Applied a total of 753 rules in 83019 ms. Remains 30 /129 variables (removed 99) and now considering 19704/20873 (removed 1169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83020 ms. Remains : 30/129 places, 19704/20873 transitions.
Knowledge obtained : [(AND p0 p3 p1 p2), (X p1), (X (NOT (AND (NOT p0) p3))), (X p3), (X (AND p1 p3)), (X (OR p0 (NOT p3))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X p3)), (X (X (AND p1 p3))), (X (X (OR p0 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 540 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 5436 reset in 3771 ms.
Product exploration explored 100000 steps with 5429 reset in 3764 ms.
Applying partial POR strategy [false, true, true, true, true, false]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p3 (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Support contains 21 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 20873/20873 transitions.
Applied a total of 0 rules in 336 ms. Remains 129 /129 variables (removed 0) and now considering 20873/20873 (removed 0) transitions.
[2023-03-23 14:24:21] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:24:21] [INFO ] Invariant cache hit.
[2023-03-23 14:24:36] [INFO ] Dead Transitions using invariants and state equation in 14518 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14856 ms. Remains : 129/129 places, 20873/20873 transitions.
Support contains 21 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 20873/20873 transitions.
Applied a total of 0 rules in 62 ms. Remains 129 /129 variables (removed 0) and now considering 20873/20873 (removed 0) transitions.
[2023-03-23 14:24:36] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:24:36] [INFO ] Invariant cache hit.
[2023-03-23 14:24:38] [INFO ] Implicit Places using invariants in 1624 ms returned []
Implicit Place search using SMT only with invariants took 1624 ms to find 0 implicit places.
[2023-03-23 14:24:38] [INFO ] Flow matrix only has 20863 transitions (discarded 10 similar events)
[2023-03-23 14:24:38] [INFO ] Invariant cache hit.
[2023-03-23 14:24:49] [INFO ] Dead Transitions using invariants and state equation in 11530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13218 ms. Remains : 129/129 places, 20873/20873 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-11 finished in 337255 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 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 568 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:24:58] [INFO ] Computed 10 place invariants in 807 ms
[2023-03-23 14:25:08] [INFO ] Implicit Places using invariants in 10939 ms returned []
Implicit Place search using SMT only with invariants took 10944 ms to find 0 implicit places.
[2023-03-23 14:25:08] [INFO ] Invariant cache hit.
[2023-03-23 14:25:38] [INFO ] Performed 31402/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 37665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49180 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s154 1) (EQ s249 1) (EQ s344 1) (EQ s450 1) (EQ s567 1) (EQ s684 1) (EQ s779 1) (EQ s896 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]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-12 finished in 49773 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(((p1 U (p2||G(p1)))&&p0)))'
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 443 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:25:46] [INFO ] Invariant cache hit.
[2023-03-23 14:25:54] [INFO ] Implicit Places using invariants in 8110 ms returned []
Implicit Place search using SMT only with invariants took 8112 ms to find 0 implicit places.
[2023-03-23 14:25:54] [INFO ] Invariant cache hit.
[2023-03-23 14:26:24] [INFO ] Performed 25933/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:26:38] [INFO ] Dead Transitions using invariants and state equation in 43576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52140 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (EQ s37 1) (EQ s132 1) (EQ s260 1) (EQ s366 1) (EQ s461 1) (EQ s578 1) (EQ s662 1) (EQ s790 1) (EQ s885 1)), p1:(AND (EQ s73 1) (EQ s190 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-13 finished in 52466 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((p0&&F(G(p0)))))&&F(p1))))'
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 390 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:26:39] [INFO ] Invariant cache hit.
[2023-03-23 14:26:47] [INFO ] Implicit Places using invariants in 8086 ms returned []
Implicit Place search using SMT only with invariants took 8087 ms to find 0 implicit places.
[2023-03-23 14:26:47] [INFO ] Invariant cache hit.
[2023-03-23 14:27:17] [INFO ] Performed 34229/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:27:22] [INFO ] Dead Transitions using invariants and state equation in 35662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44141 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s84 0) (EQ s179 0) (EQ s296 0) (EQ s380 0) (EQ s497 0) (EQ s614 0) (EQ s709 0) (EQ s815 0) (EQ s921 0)), p0:(OR (EQ s48 0) (EQ s143 0) (EQ s260...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 649 reset in 2153 ms.
Product exploration explored 100000 steps with 650 reset in 2257 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21059 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21059 steps, saw 8402 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 14:27:32] [INFO ] Invariant cache hit.
[2023-03-23 14:27:32] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 14:27:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-23 14:27:57] [INFO ] After 24642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 14:29:57] [INFO ] Deduced a trap composed of 0 places in 120057 ms of which 53 ms to minimize.
[2023-03-23 14:29:57] [INFO ] After 144909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 14:29:57] [INFO ] After 145099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 994 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.109 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 603 rules applied. Total rules applied 605 place count 842 transition count 40170
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 612 rules applied. Total rules applied 1217 place count 248 transition count 40152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1226 place count 239 transition count 40152
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1226 place count 239 transition count 40106
Deduced a syphon composed of 46 places in 28 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1318 place count 193 transition count 40106
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1319 place count 193 transition count 40105
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1411 place count 147 transition count 40059
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1429 place count 147 transition count 40041
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1459 place count 117 transition count 9899
Iterating global reduction 5 with 30 rules applied. Total rules applied 1489 place count 117 transition count 9899
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1501 place count 117 transition count 9887
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1510 place count 108 transition count 9878
Iterating global reduction 6 with 9 rules applied. Total rules applied 1519 place count 108 transition count 9878
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1537 place count 99 transition count 9869
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1543 place count 96 transition count 9877
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1551 place count 96 transition count 9869
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1553 place count 95 transition count 9875
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1561 place count 95 transition count 9867
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1563 place count 94 transition count 9873
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1571 place count 94 transition count 9865
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1573 place count 93 transition count 9871
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1581 place count 93 transition count 9863
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1583 place count 92 transition count 9869
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1591 place count 92 transition count 9861
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1593 place count 91 transition count 9867
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1601 place count 91 transition count 9859
Free-agglomeration rule applied 53 times.
Iterating global reduction 6 with 53 rules applied. Total rules applied 1654 place count 91 transition count 9806
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 6 with 182 rules applied. Total rules applied 1836 place count 38 transition count 9677
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1845 place count 29 transition count 9668
Iterating global reduction 7 with 9 rules applied. Total rules applied 1854 place count 29 transition count 9668
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 2365 place count 29 transition count 9157
Drop transitions removed 1932 transitions
Redundant transition composition rules discarded 1932 transitions
Iterating global reduction 8 with 1932 rules applied. Total rules applied 4297 place count 29 transition count 7225
Applied a total of 4297 rules in 40164 ms. Remains 29 /977 variables (removed 948) and now considering 7225/40944 (removed 33719) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40164 ms. Remains : 29/977 places, 7225/40944 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 977 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 387 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:30:38] [INFO ] Invariant cache hit.
[2023-03-23 14:30:46] [INFO ] Implicit Places using invariants in 8055 ms returned []
Implicit Place search using SMT only with invariants took 8062 ms to find 0 implicit places.
[2023-03-23 14:30:46] [INFO ] Invariant cache hit.
[2023-03-23 14:31:16] [INFO ] Performed 37465/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:31:19] [INFO ] Dead Transitions using invariants and state equation in 32966 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41418 ms. Remains : 977/977 places, 40944/40944 transitions.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20950 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20950 steps, saw 8371 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 14:31:24] [INFO ] Invariant cache hit.
[2023-03-23 14:31:24] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 14:31:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-23 14:31:49] [INFO ] After 24700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 14:33:49] [INFO ] Deduced a trap composed of 0 places in 120061 ms of which 74 ms to minimize.
[2023-03-23 14:33:49] [INFO ] After 144905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 14:33:49] [INFO ] After 145095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 994 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Drop transitions removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.109 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 603 rules applied. Total rules applied 605 place count 842 transition count 40170
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 612 rules applied. Total rules applied 1217 place count 248 transition count 40152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1226 place count 239 transition count 40152
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1226 place count 239 transition count 40106
Deduced a syphon composed of 46 places in 29 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1318 place count 193 transition count 40106
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1319 place count 193 transition count 40105
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1411 place count 147 transition count 40059
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1429 place count 147 transition count 40041
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1459 place count 117 transition count 9899
Iterating global reduction 5 with 30 rules applied. Total rules applied 1489 place count 117 transition count 9899
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1501 place count 117 transition count 9887
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1510 place count 108 transition count 9878
Iterating global reduction 6 with 9 rules applied. Total rules applied 1519 place count 108 transition count 9878
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1537 place count 99 transition count 9869
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1543 place count 96 transition count 9877
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1551 place count 96 transition count 9869
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1553 place count 95 transition count 9875
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1561 place count 95 transition count 9867
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1563 place count 94 transition count 9873
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1571 place count 94 transition count 9865
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1573 place count 93 transition count 9871
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1581 place count 93 transition count 9863
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1583 place count 92 transition count 9869
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1591 place count 92 transition count 9861
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1593 place count 91 transition count 9867
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1601 place count 91 transition count 9859
Free-agglomeration rule applied 53 times.
Iterating global reduction 6 with 53 rules applied. Total rules applied 1654 place count 91 transition count 9806
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 6 with 182 rules applied. Total rules applied 1836 place count 38 transition count 9677
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1845 place count 29 transition count 9668
Iterating global reduction 7 with 9 rules applied. Total rules applied 1854 place count 29 transition count 9668
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 2365 place count 29 transition count 9157
Drop transitions removed 1932 transitions
Redundant transition composition rules discarded 1932 transitions
Iterating global reduction 8 with 1932 rules applied. Total rules applied 4297 place count 29 transition count 7225
Applied a total of 4297 rules in 40259 ms. Remains 29 /977 variables (removed 948) and now considering 7225/40944 (removed 33719) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40260 ms. Remains : 29/977 places, 7225/40944 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 650 reset in 2100 ms.
Product exploration explored 100000 steps with 650 reset in 2112 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 994 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 576 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 576 rules applied. Total rules applied 577 place count 851 transition count 40800
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 586 place count 851 transition count 40791
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 586 place count 851 transition count 40800
Deduced a syphon composed of 594 places in 32 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 604 place count 851 transition count 40800
Discarding 492 places :
Symmetric choice reduction at 2 with 492 rule applications. Total rules 1096 place count 359 transition count 40308
Deduced a syphon composed of 110 places in 31 ms
Iterating global reduction 2 with 492 rules applied. Total rules applied 1588 place count 359 transition count 40308
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 183 places in 16 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 1661 place count 359 transition count 40308
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 1755 place count 265 transition count 10093
Deduced a syphon composed of 119 places in 3 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 1849 place count 265 transition count 10093
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1861 place count 265 transition count 10081
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1891 place count 235 transition count 10042
Deduced a syphon composed of 98 places in 3 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 1921 place count 235 transition count 10042
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1930 place count 226 transition count 10033
Deduced a syphon composed of 98 places in 3 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1939 place count 226 transition count 10033
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 110 places in 3 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1951 place count 226 transition count 10089
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1972 place count 205 transition count 10047
Deduced a syphon composed of 89 places in 3 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1993 place count 205 transition count 10047
Deduced a syphon composed of 89 places in 3 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 2015 place count 205 transition count 10025
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 90 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2016 place count 205 transition count 10038
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2017 place count 204 transition count 10036
Deduced a syphon composed of 89 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2018 place count 204 transition count 10036
Deduced a syphon composed of 89 places in 3 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 2022 place count 204 transition count 10032
Deduced a syphon composed of 89 places in 3 ms
Applied a total of 2022 rules in 28750 ms. Remains 204 /977 variables (removed 773) and now considering 10032/40944 (removed 30912) transitions.
[2023-03-23 14:35:03] [INFO ] Flow matrix only has 10022 transitions (discarded 10 similar events)
// Phase 1: matrix 10022 rows 204 cols
[2023-03-23 14:35:03] [INFO ] Computed 2 place invariants in 100 ms
[2023-03-23 14:35:09] [INFO ] Dead Transitions using invariants and state equation in 6396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/977 places, 10032/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35151 ms. Remains : 204/977 places, 10032/40944 transitions.
Support contains 9 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 485 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2023-03-23 14:35:11] [INFO ] Computed 10 place invariants in 942 ms
[2023-03-23 14:35:20] [INFO ] Implicit Places using invariants in 10641 ms returned []
Implicit Place search using SMT only with invariants took 10642 ms to find 0 implicit places.
[2023-03-23 14:35:20] [INFO ] Invariant cache hit.
[2023-03-23 14:35:51] [INFO ] Performed 31795/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:35:58] [INFO ] Dead Transitions using invariants and state equation in 37286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48415 ms. Remains : 977/977 places, 40944/40944 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-14 finished in 567022 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' '!(((p0||F(p1)) U G((p2 U (p3||X(X(p3)))))))'
Support contains 26 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 336 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2023-03-23 14:36:06] [INFO ] Invariant cache hit.
[2023-03-23 14:36:12] [INFO ] Implicit Places using invariants in 6425 ms returned []
Implicit Place search using SMT only with invariants took 6431 ms to find 0 implicit places.
[2023-03-23 14:36:12] [INFO ] Invariant cache hit.
[2023-03-23 14:36:42] [INFO ] Performed 30106/40944 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 14:36:55] [INFO ] Dead Transitions using invariants and state equation in 42576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49346 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 646 ms :[(NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 9}, { cond=true, acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(NOT p3), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=9 dest: 4}], [{ cond=(NOT p3), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p3:(AND (EQ s73 1) (EQ s190 1) (EQ s296 1) (EQ s402 1) (EQ s497 1) (EQ s592 1) (EQ s698 1) (EQ s804 1) (EQ s910 1)), p2:(AND (EQ s37 1) (EQ s143 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 5 ms.
FORMULA StigmergyElection-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-09b-LTLFireability-15 finished in 50221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U (p1||G(!p0)))||(X(p0)&&G(p2)))))'
Found a Lengthening insensitive property : StigmergyElection-PT-09b-LTLFireability-00
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p2) (NOT p1) p0), true, (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p2 (NOT p1) p0), false]
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 557 place count 850 transition count 40243
Reduce places removed 556 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 574 rules applied. Total rules applied 1131 place count 294 transition count 40225
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1140 place count 285 transition count 40225
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1140 place count 285 transition count 40188
Deduced a syphon composed of 37 places in 30 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1214 place count 248 transition count 40188
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1222 place count 240 transition count 40180
Iterating global reduction 3 with 8 rules applied. Total rules applied 1230 place count 240 transition count 40180
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 18 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1318 place count 196 transition count 40136
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1341 place count 173 transition count 23018
Iterating global reduction 3 with 23 rules applied. Total rules applied 1364 place count 173 transition count 23018
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1369 place count 173 transition count 23013
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1378 place count 164 transition count 22995
Iterating global reduction 4 with 9 rules applied. Total rules applied 1387 place count 164 transition count 22995
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1396 place count 155 transition count 22977
Iterating global reduction 4 with 9 rules applied. Total rules applied 1405 place count 155 transition count 22977
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1431 place count 142 transition count 22984
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1432 place count 141 transition count 22966
Iterating global reduction 4 with 1 rules applied. Total rules applied 1433 place count 141 transition count 22966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1434 place count 141 transition count 22965
Applied a total of 1434 rules in 12020 ms. Remains 141 /977 variables (removed 836) and now considering 22965/40944 (removed 17979) transitions.
[2023-03-23 14:37:08] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
// Phase 1: matrix 22955 rows 141 cols
[2023-03-23 14:37:08] [INFO ] Computed 2 place invariants in 308 ms
[2023-03-23 14:37:10] [INFO ] Implicit Places using invariants in 2596 ms returned []
Implicit Place search using SMT only with invariants took 2597 ms to find 0 implicit places.
[2023-03-23 14:37:10] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:37:10] [INFO ] Invariant cache hit.
[2023-03-23 14:37:25] [INFO ] Dead Transitions using invariants and state equation in 14456 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 141/977 places, 22965/40944 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 29077 ms. Remains : 141/977 places, 22965/40944 transitions.
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(OR (EQ s11 0) (EQ s26 0) (EQ s38 0) (EQ s54 0) (EQ s68 0) (EQ s87 0) (EQ s100 0) (EQ s118 0) (EQ s134 0) (AND (EQ s4 1) (EQ s20 1) (EQ s34 1) (EQ s49 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5232 reset in 4012 ms.
Product exploration explored 100000 steps with 5260 reset in 3995 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 864 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 521 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 39632 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39632 steps, saw 14725 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-23 14:37:39] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:37:39] [INFO ] Invariant cache hit.
[2023-03-23 14:37:39] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 14:37:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 14:37:51] [INFO ] After 12127ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-23 14:37:55] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-23 14:38:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:38:04] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 29 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 22965/22965 transitions.
Graph (complete) has 1188 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.60 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 140 transition count 22945
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 122 transition count 22927
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 2 with 59 rules applied. Total rules applied 124 place count 122 transition count 22859
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 185 place count 62 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 194 place count 53 transition count 22849
Iterating global reduction 3 with 9 rules applied. Total rules applied 203 place count 53 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 218 place count 53 transition count 22834
Performed 9 Post agglomeration using F-continuation condition with reduction of 2262 identical transitions.
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 236 place count 44 transition count 20563
Drop transitions removed 9 transitions
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 334 transitions.
Iterating post reduction 4 with 334 rules applied. Total rules applied 570 place count 44 transition count 20229
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 580 place count 39 transition count 20224
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 581 place count 38 transition count 20223
Applied a total of 581 rules in 8600 ms. Remains 38 /141 variables (removed 103) and now considering 20223/22965 (removed 2742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8601 ms. Remains : 38/141 places, 20223/22965 transitions.
Incomplete random walk after 10000 steps, including 948 resets, run finished after 2068 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
Finished Best-First random walk after 157 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) p1 p2)), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 21 factoid took 1249 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Stuttering acceptance computed with spot in 230 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Support contains 29 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 22965/22965 transitions.
Applied a total of 0 rules in 68 ms. Remains 141 /141 variables (removed 0) and now considering 22965/22965 (removed 0) transitions.
[2023-03-23 14:38:17] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:38:17] [INFO ] Invariant cache hit.
[2023-03-23 14:38:19] [INFO ] Implicit Places using invariants in 2389 ms returned []
Implicit Place search using SMT only with invariants took 2401 ms to find 0 implicit places.
[2023-03-23 14:38:19] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:38:19] [INFO ] Invariant cache hit.
[2023-03-23 14:38:35] [INFO ] Dead Transitions using invariants and state equation in 15515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17991 ms. Remains : 141/141 places, 22965/22965 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (AND (NOT p0) p2)), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 736 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[false, (OR p2 p1), (AND (NOT p0) p2), (AND p1 (NOT p2)), (AND (NOT p1) p2 p0), false]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 37435 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37435 steps, saw 14461 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 14:38:40] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:38:40] [INFO ] Invariant cache hit.
[2023-03-23 14:38:40] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 14:38:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 14:38:53] [INFO ] After 12313ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 14:38:57] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-23 14:39:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:39:05] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 29 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 22965/22965 transitions.
Graph (complete) has 1188 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.59 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 140 transition count 22945
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 122 transition count 22927
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 2 with 59 rules applied. Total rules applied 124 place count 122 transition count 22859
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 185 place count 62 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 194 place count 53 transition count 22849
Iterating global reduction 3 with 9 rules applied. Total rules applied 203 place count 53 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 218 place count 53 transition count 22834
Performed 9 Post agglomeration using F-continuation condition with reduction of 2262 identical transitions.
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 236 place count 44 transition count 20563
Drop transitions removed 9 transitions
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 334 transitions.
Iterating post reduction 4 with 334 rules applied. Total rules applied 570 place count 44 transition count 20229
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 580 place count 39 transition count 20224
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 581 place count 38 transition count 20223
Applied a total of 581 rules in 8769 ms. Remains 38 /141 variables (removed 103) and now considering 20223/22965 (removed 2742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8770 ms. Remains : 38/141 places, 20223/22965 transitions.
Incomplete random walk after 10000 steps, including 947 resets, run finished after 2038 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 2) seen :1
Finished Best-First random walk after 161 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (AND (NOT p0) p2)), (X (X (OR p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (G (OR p1 p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 884 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 206 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 5223 reset in 4195 ms.
Product exploration explored 100000 steps with 5219 reset in 4511 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 298 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Support contains 29 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 22965/22965 transitions.
Applied a total of 0 rules in 357 ms. Remains 141 /141 variables (removed 0) and now considering 22965/22965 (removed 0) transitions.
[2023-03-23 14:39:28] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:39:28] [INFO ] Invariant cache hit.
[2023-03-23 14:39:42] [INFO ] Dead Transitions using invariants and state equation in 14707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15068 ms. Remains : 141/141 places, 22965/22965 transitions.
Support contains 29 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 22965/22965 transitions.
Applied a total of 0 rules in 69 ms. Remains 141 /141 variables (removed 0) and now considering 22965/22965 (removed 0) transitions.
[2023-03-23 14:39:42] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:39:42] [INFO ] Invariant cache hit.
[2023-03-23 14:39:45] [INFO ] Implicit Places using invariants in 2331 ms returned []
Implicit Place search using SMT only with invariants took 2332 ms to find 0 implicit places.
[2023-03-23 14:39:45] [INFO ] Flow matrix only has 22955 transitions (discarded 10 similar events)
[2023-03-23 14:39:45] [INFO ] Invariant cache hit.
[2023-03-23 14:40:08] [INFO ] Dead Transitions using invariants and state equation in 23097 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25501 ms. Remains : 141/141 places, 22965/22965 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-00 finished in 200751 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((X(G(p1))||p0))))'
Found a Lengthening insensitive property : StigmergyElection-PT-09b-LTLFireability-02
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 977 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 985 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 567 transitions
Trivial Post-agglo rules discarded 567 transitions
Performed 567 trivial Post agglomeration. Transition count delta: 567
Iterating post reduction 0 with 567 rules applied. Total rules applied 568 place count 850 transition count 40232
Reduce places removed 567 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 585 rules applied. Total rules applied 1153 place count 283 transition count 40214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1162 place count 274 transition count 40214
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1162 place count 274 transition count 40177
Deduced a syphon composed of 37 places in 29 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1236 place count 237 transition count 40177
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1244 place count 229 transition count 40169
Iterating global reduction 3 with 8 rules applied. Total rules applied 1252 place count 229 transition count 40169
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 17 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1340 place count 185 transition count 40125
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1360 place count 165 transition count 29163
Iterating global reduction 3 with 20 rules applied. Total rules applied 1380 place count 165 transition count 29163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1382 place count 165 transition count 29161
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1391 place count 156 transition count 29143
Iterating global reduction 4 with 9 rules applied. Total rules applied 1400 place count 156 transition count 29143
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 147 transition count 29125
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 147 transition count 29125
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1444 place count 134 transition count 29132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1445 place count 133 transition count 29114
Iterating global reduction 4 with 1 rules applied. Total rules applied 1446 place count 133 transition count 29114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1447 place count 133 transition count 29113
Applied a total of 1447 rules in 12922 ms. Remains 133 /977 variables (removed 844) and now considering 29113/40944 (removed 11831) transitions.
[2023-03-23 14:40:29] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
// Phase 1: matrix 29103 rows 133 cols
[2023-03-23 14:40:30] [INFO ] Computed 2 place invariants in 421 ms
[2023-03-23 14:40:36] [INFO ] Implicit Places using invariants in 6524 ms returned []
Implicit Place search using SMT only with invariants took 6526 ms to find 0 implicit places.
[2023-03-23 14:40:36] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:40:36] [INFO ] Invariant cache hit.
[2023-03-23 14:40:53] [INFO ] Dead Transitions using invariants and state equation in 17047 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/977 places, 29113/40944 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 36497 ms. Remains : 133/977 places, 29113/40944 transitions.
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (NEQ s10 1) (NEQ s23 1) (NEQ s37 1) (NEQ s51 1) (NEQ s66 1) (NEQ s81 1) (NEQ s96 1) (NEQ s112 1) (NEQ s125 1)) (EQ s5 1) (EQ s21 1) (EQ s33 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5598 reset in 5784 ms.
Product exploration explored 100000 steps with 5595 reset in 5230 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 29990 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29990 steps, saw 14615 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 14:41:09] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:41:09] [INFO ] Invariant cache hit.
[2023-03-23 14:41:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 14:41:23] [INFO ] After 14385ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 14:41:29] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-23 14:41:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:41:34] [INFO ] After 25065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 29113/29113 transitions.
Graph (complete) has 1231 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.78 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 132 transition count 29093
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 114 transition count 29075
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 114 transition count 29066
Free-agglomeration rule applied 62 times.
Iterating global reduction 2 with 62 rules applied. Total rules applied 127 place count 114 transition count 29004
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 319 place count 51 transition count 28875
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 328 place count 42 transition count 28866
Iterating global reduction 3 with 9 rules applied. Total rules applied 337 place count 42 transition count 28866
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 3 with 511 rules applied. Total rules applied 848 place count 42 transition count 28355
Performed 9 Post agglomeration using F-continuation condition with reduction of 24162 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 866 place count 33 transition count 4184
Drop transitions removed 9 transitions
Ensure Unique test removed 3129 transitions
Reduce isomorphic transitions removed 3138 transitions.
Iterating post reduction 4 with 3138 rules applied. Total rules applied 4004 place count 33 transition count 1046
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4014 place count 28 transition count 1041
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4015 place count 27 transition count 1040
Applied a total of 4015 rules in 18326 ms. Remains 27 /133 variables (removed 106) and now considering 1040/29113 (removed 28073) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18326 ms. Remains : 27/133 places, 1040/29113 transitions.
Finished random walk after 387 steps, including 37 resets, run visited all 2 properties in 9 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 29113/29113 transitions.
Applied a total of 0 rules in 133 ms. Remains 133 /133 variables (removed 0) and now considering 29113/29113 (removed 0) transitions.
[2023-03-23 14:41:53] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:41:53] [INFO ] Invariant cache hit.
[2023-03-23 14:41:59] [INFO ] Implicit Places using invariants in 6358 ms returned []
Implicit Place search using SMT only with invariants took 6376 ms to find 0 implicit places.
[2023-03-23 14:41:59] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:41:59] [INFO ] Invariant cache hit.
[2023-03-23 14:42:17] [INFO ] Dead Transitions using invariants and state equation in 17692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24206 ms. Remains : 133/133 places, 29113/29113 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 563 resets, run finished after 939 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 30061 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30061 steps, saw 14643 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 14:42:22] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:42:22] [INFO ] Invariant cache hit.
[2023-03-23 14:42:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 14:42:36] [INFO ] After 14782ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-23 14:42:41] [INFO ] State equation strengthened by 511 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-23 14:42:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 14:42:47] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 29113/29113 transitions.
Graph (complete) has 1231 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.77 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 132 transition count 29093
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 8 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 56 place count 114 transition count 29075
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 114 transition count 29066
Free-agglomeration rule applied 62 times.
Iterating global reduction 2 with 62 rules applied. Total rules applied 127 place count 114 transition count 29004
Reduce places removed 63 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 319 place count 51 transition count 28875
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 328 place count 42 transition count 28866
Iterating global reduction 3 with 9 rules applied. Total rules applied 337 place count 42 transition count 28866
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 3 with 511 rules applied. Total rules applied 848 place count 42 transition count 28355
Performed 9 Post agglomeration using F-continuation condition with reduction of 24162 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 866 place count 33 transition count 4184
Drop transitions removed 9 transitions
Ensure Unique test removed 3129 transitions
Reduce isomorphic transitions removed 3138 transitions.
Iterating post reduction 4 with 3138 rules applied. Total rules applied 4004 place count 33 transition count 1046
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4014 place count 28 transition count 1041
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4015 place count 27 transition count 1040
Applied a total of 4015 rules in 18512 ms. Remains 27 /133 variables (removed 106) and now considering 1040/29113 (removed 28073) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18512 ms. Remains : 27/133 places, 1040/29113 transitions.
Finished random walk after 877 steps, including 84 resets, run visited all 2 properties in 25 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5620 reset in 5323 ms.
Product exploration explored 100000 steps with 5602 reset in 5244 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 29113/29113 transitions.
Applied a total of 0 rules in 500 ms. Remains 133 /133 variables (removed 0) and now considering 29113/29113 (removed 0) transitions.
[2023-03-23 14:43:17] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:43:17] [INFO ] Invariant cache hit.
[2023-03-23 14:43:35] [INFO ] Dead Transitions using invariants and state equation in 17657 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18162 ms. Remains : 133/133 places, 29113/29113 transitions.
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 29113/29113 transitions.
Applied a total of 0 rules in 127 ms. Remains 133 /133 variables (removed 0) and now considering 29113/29113 (removed 0) transitions.
[2023-03-23 14:43:35] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:43:35] [INFO ] Invariant cache hit.
[2023-03-23 14:43:41] [INFO ] Implicit Places using invariants in 6021 ms returned []
Implicit Place search using SMT only with invariants took 6023 ms to find 0 implicit places.
[2023-03-23 14:43:41] [INFO ] Flow matrix only has 29103 transitions (discarded 10 similar events)
[2023-03-23 14:43:41] [INFO ] Invariant cache hit.
[2023-03-23 14:43:57] [INFO ] Dead Transitions using invariants and state equation in 15568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21720 ms. Remains : 133/133 places, 29113/29113 transitions.
Treatment of property StigmergyElection-PT-09b-LTLFireability-02 finished in 227956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||(F(G(p2))&&G(p3))||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((X(G((p0&&F(G(p0)))))&&F(p1))))'
[2023-03-23 14:44:10] [INFO ] Flatten gal took : 4752 ms
[2023-03-23 14:44:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-23 14:44:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 977 places, 40944 transitions and 720053 arcs took 354 ms.
Total runtime 2767378 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3031/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3031/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3031/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3031/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyElection-PT-09b-LTLFireability-00
Could not compute solution for formula : StigmergyElection-PT-09b-LTLFireability-02
Could not compute solution for formula : StigmergyElection-PT-09b-LTLFireability-11
Could not compute solution for formula : StigmergyElection-PT-09b-LTLFireability-14
BK_STOP 1679582788730
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name StigmergyElection-PT-09b-LTLFireability-00
ltl formula formula --ltl=/tmp/3031/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 977 places, 40944 transitions and 720053 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 12.660 real 3.380 user 2.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3031/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3031/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3031/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3031/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name StigmergyElection-PT-09b-LTLFireability-02
ltl formula formula --ltl=/tmp/3031/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 977 places, 40944 transitions and 720053 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.390 real 3.080 user 1.500 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3031/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3031/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3031/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3031/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name StigmergyElection-PT-09b-LTLFireability-11
ltl formula formula --ltl=/tmp/3031/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 977 places, 40944 transitions and 720053 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.350 real 3.000 user 1.600 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3031/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3031/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3031/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3031/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name StigmergyElection-PT-09b-LTLFireability-14
ltl formula formula --ltl=/tmp/3031/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 977 places, 40944 transitions and 720053 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.220 real 3.200 user 1.430 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3031/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3031/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3031/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3031/ltl_3_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-09b, 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 r457-smll-167912649600676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09b.tgz
mv StigmergyElection-PT-09b 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 '
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 ;