About the Execution of ITS-Tools for ClientsAndServers-PT-N0200P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12991.596 | 3600000.00 | 3938147.00 | 8463.70 | FFFTFFF?FFFFFFFF | 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.r069-smll-167814396200324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ClientsAndServers-PT-N0200P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396200324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 13:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678400282163
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0200P0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 22:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 22:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:18:05] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 22:18:05] [INFO ] Transformed 25 places.
[2023-03-09 22:18:05] [INFO ] Transformed 18 transitions.
[2023-03-09 22:18:05] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 15 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-09 22:18:05] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-09 22:18:05] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-09 22:18:05] [INFO ] Invariant cache hit.
[2023-03-09 22:18:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-09 22:18:06] [INFO ] Invariant cache hit.
[2023-03-09 22:18:06] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-03-09 22:18:06] [INFO ] Flatten gal took : 33 ms
[2023-03-09 22:18:06] [INFO ] Flatten gal took : 11 ms
[2023-03-09 22:18:06] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 21) seen :7
Finished Best-First random walk after 533 steps, including 0 resets, run visited all 14 properties in 29 ms. (steps per millisecond=18 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 11
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 19 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 22:18:07] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 22:18:07] [INFO ] Implicit Places using invariants in 67 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 22:18:07] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 22:18:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 22:18:07] [INFO ] Invariant cache hit.
[2023-03-09 22:18:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 394 ms.
Product exploration explored 100000 steps with 0 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 1601 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=533 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 22:18:09] [INFO ] Invariant cache hit.
[2023-03-09 22:18:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 22:18:09] [INFO ] Invariant cache hit.
[2023-03-09 22:18:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-09 22:18:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:18:09] [INFO ] Invariant cache hit.
[2023-03-09 22:18:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 1601 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=800 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 500 ms.
Built C files in :
/tmp/ltsmin18444838615193540960
[2023-03-09 22:18:10] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-09 22:18:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:18:10] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-09 22:18:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:18:10] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-09 22:18:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:18:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18444838615193540960
Running compilation step : cd /tmp/ltsmin18444838615193540960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 359 ms.
Running link step : cd /tmp/ltsmin18444838615193540960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin18444838615193540960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16043748649261847043.hoa' '--buchi-type=spotba'
LTSmin run took 805 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-00 finished in 4743 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((X(p1)&&p0))||(G(p2) U X(p3))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 22:18:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 22:18:11] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 509 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 7}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p2:(GEQ s12 1), p3:(GEQ s17 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 735 reset in 375 ms.
Product exploration explored 100000 steps with 716 reset in 380 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 1846 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Finished Best-First random walk after 2583 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 32 factoid took 1900 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 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:18:17] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 22:18:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Proved EG (NOT p1)
[2023-03-09 22:18:17] [INFO ] Invariant cache hit.
[2023-03-09 22:18:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 22:18:17] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-09 22:18:17] [INFO ] Added : 15 causal constraints over 3 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 32 factoid took 612 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-01 finished in 6765 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((p0||(X(p2)&&p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 22:18:18] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-09 22:18:18] [INFO ] Implicit Places using invariants in 53 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 165 ms :[(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))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s6 1), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2212 reset in 188 ms.
Product exploration explored 100000 steps with 2231 reset in 618 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 400 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(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))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:18:20] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 22:18:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:20] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:20] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:20] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:18:20] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 666 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(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))]
Stuttering acceptance computed with spot in 159 ms :[(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))]
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 22:18:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 22:18:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 22:18:21] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 22:18:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 22:18:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-09 22:18:21] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-09 22:18:22] [INFO ] Invariant cache hit.
[2023-03-09 22:18:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 552 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(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))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:18:22] [INFO ] Invariant cache hit.
[2023-03-09 22:18:22] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:22] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:22] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:22] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 22:18:22] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 632 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(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))]
Stuttering acceptance computed with spot in 153 ms :[(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))]
[2023-03-09 22:18:23] [INFO ] Invariant cache hit.
[2023-03-09 22:18:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:18:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 22:18:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 22:18:24] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-09 22:18:24] [INFO ] Invariant cache hit.
[2023-03-09 22:18:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-09 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:18:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:18:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-09 22:18:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 22:18:24] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 131 ms :[(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))]
Product exploration explored 100000 steps with 2242 reset in 179 ms.
Product exploration explored 100000 steps with 2245 reset in 207 ms.
Built C files in :
/tmp/ltsmin13669275394741798701
[2023-03-09 22:18:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13669275394741798701
Running compilation step : cd /tmp/ltsmin13669275394741798701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin13669275394741798701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13669275394741798701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6531187866067942709.hoa' '--buchi-type=spotba'
LTSmin run took 2997 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-02 finished in 9629 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)&&F((G(F(!p1))||(F(!p1)&&X(p2)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:18:28] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 22:18:28] [INFO ] Implicit Places using invariants in 50 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (AND (NOT p2) p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(AND (GEQ s5 1) (GEQ s14 1)), p2:(OR (AND (GEQ s7 1) (GEQ s19 1)) (AND (GEQ s5 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3706 reset in 161 ms.
Product exploration explored 100000 steps with 3699 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 437 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), p1]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:18:29] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 22:18:29] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p2), (F p1)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-03 finished in 1847 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||(!p1&&X(G(p1))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:18:30] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 22:18:30] [INFO ] Implicit Places using invariants in 42 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, p0, p0, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(LT s16 1)], 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 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-04 finished in 256 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&&X(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:18:30] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 22:18:30] [INFO ] Implicit Places using invariants in 44 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s11 1) (LT s16 1)), p0:(GEQ s19 1)], 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 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-05 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U !p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 22:18:30] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 22:18:30] [INFO ] Implicit Places using invariants in 34 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, false, false, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s14 1)), p1:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-06 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p0))||F(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-09 22:18:30] [INFO ] Invariant cache hit.
[2023-03-09 22:18:30] [INFO ] Implicit Places using invariants in 35 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), 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}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (GEQ s9 1) (AND (GEQ s0 1) (GEQ s13 1)) (GEQ s9 1)), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10191 reset in 96 ms.
Product exploration explored 100000 steps with 10215 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 3205 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1602 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 22:18:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 22:18:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 22:18:32] [INFO ] Invariant cache hit.
[2023-03-09 22:18:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-09 22:18:32] [INFO ] Invariant cache hit.
[2023-03-09 22:18:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 3205 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1602 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 10305 reset in 160 ms.
Product exploration explored 100000 steps with 10227 reset in 182 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 19 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 19 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 19 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 13 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-09 22:18:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2023-03-09 22:18:34] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 22:18:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 17/20 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin17301629527103097324
[2023-03-09 22:18:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17301629527103097324
Running compilation step : cd /tmp/ltsmin17301629527103097324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin17301629527103097324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17301629527103097324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1617437666483998259.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 22:18:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 22:18:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 22:18:49] [INFO ] Invariant cache hit.
[2023-03-09 22:18:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 22:18:49] [INFO ] Invariant cache hit.
[2023-03-09 22:18:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin67198617079296744
[2023-03-09 22:18:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin67198617079296744
Running compilation step : cd /tmp/ltsmin67198617079296744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin67198617079296744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin67198617079296744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3829082369857025613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 22:19:05] [INFO ] Flatten gal took : 4 ms
[2023-03-09 22:19:05] [INFO ] Flatten gal took : 3 ms
[2023-03-09 22:19:05] [INFO ] Time to serialize gal into /tmp/LTL11917996334200660890.gal : 2 ms
[2023-03-09 22:19:05] [INFO ] Time to serialize properties into /tmp/LTL16948360022444888517.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11917996334200660890.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18317661587801870903.hoa' '-atoms' '/tmp/LTL16948360022444888517.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16948360022444888517.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18317661587801870903.hoa
Detected timeout of ITS tools.
[2023-03-09 22:19:20] [INFO ] Flatten gal took : 6 ms
[2023-03-09 22:19:20] [INFO ] Flatten gal took : 3 ms
[2023-03-09 22:19:20] [INFO ] Time to serialize gal into /tmp/LTL17524432250022418320.gal : 1 ms
[2023-03-09 22:19:20] [INFO ] Time to serialize properties into /tmp/LTL5320338679866911299.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17524432250022418320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5320338679866911299.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(MpG<1)")))||(F("(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))"))))))
Formula 0 simplified : XX(XF!"(MpG<1)" & G!"(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))")
Detected timeout of ITS tools.
[2023-03-09 22:19:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 22:19:35] [INFO ] Applying decomposition
[2023-03-09 22:19:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8385878387396447524.txt' '-o' '/tmp/graph8385878387396447524.bin' '-w' '/tmp/graph8385878387396447524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8385878387396447524.bin' '-l' '-1' '-v' '-w' '/tmp/graph8385878387396447524.weights' '-q' '0' '-e' '0.001'
[2023-03-09 22:19:35] [INFO ] Decomposing Gal with order
[2023-03-09 22:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 22:19:35] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 22:19:35] [INFO ] Flatten gal took : 35 ms
[2023-03-09 22:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 22:19:35] [INFO ] Time to serialize gal into /tmp/LTL14662875326079782952.gal : 2 ms
[2023-03-09 22:19:35] [INFO ] Time to serialize properties into /tmp/LTL13723905967478377687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14662875326079782952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13723905967478377687.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(u3.MpG<1)")))||(F("(((u2.MpA>=1)||((u0.Uf>=1)&&(u4.MwU>=1)))||(u2.MpA>=1))"))))))
Formula 0 simplified : XX(XF!"(u3.MpG<1)" & G!"(((u2.MpA>=1)||((u0.Uf>=1)&&(u4.MwU>=1)))||(u2.MpA>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12487880150995377424
[2023-03-09 22:19:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12487880150995377424
Running compilation step : cd /tmp/ltsmin12487880150995377424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin12487880150995377424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12487880150995377424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X([]((LTLAPp0==true)))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-07 finished in 94633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||F(p1)))) U G(!p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:20:05] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 22:20:05] [INFO ] Implicit Places using invariants in 38 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) p2 p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s7 1) (LT s19 1)), p0:(GEQ s18 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33398 reset in 96 ms.
Product exploration explored 100000 steps with 33288 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 691 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:20:07] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 22:20:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:07] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 22:20:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:07] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 22:20:07] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:20:07] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 157 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 915 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 204 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
[2023-03-09 22:20:08] [INFO ] Invariant cache hit.
[2023-03-09 22:20:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 22:20:08] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 22:20:08] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG p2
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 11 transition count 8
Applied a total of 20 rules in 8 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-09 22:20:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 22:20:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 22:20:08] [INFO ] Invariant cache hit.
[2023-03-09 22:20:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 22:20:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:20:08] [INFO ] Invariant cache hit.
[2023-03-09 22:20:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 11/21 places, 8/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X p2), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 782 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Finished Best-First random walk after 525 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=175 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X p2), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 953 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 213 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
[2023-03-09 22:20:11] [INFO ] Invariant cache hit.
[2023-03-09 22:20:11] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-09 22:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 22:20:11] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 22:20:11] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 201 ms :[p2, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 28465 reset in 170 ms.
Stack based approach found an accepted trace after 49815 steps with 14018 reset with depth 13 and stack size 13 in 107 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-09 finished in 6469 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((!p0&&X(!p0)))) U G((p1 U p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:20:11] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 22:20:12] [INFO ] Implicit Places using invariants in 45 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), p0, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s16 1) (GEQ s0 1) (GEQ s13 1)), p1:(GEQ s19 1), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39688 reset in 501 ms.
Product exploration explored 100000 steps with 39810 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1228 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), p0, (NOT p2)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 8) seen :3
Finished Best-First random walk after 451 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (AND p0 p2) (AND p0 p1))), (F p0), (F (OR p2 p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Knowledge based reduction with 17 factoid took 1135 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), p0, (NOT p2)]
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), p0, (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:20:16] [INFO ] Computed 4 place invariants in 1 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (AND p0 p2) (AND p0 p1))), (F p0), (F (OR p2 p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 17 factoid took 668 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-10 finished in 5005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0) U X(!p1))) U (p0 U p2)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:20:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 22:20:17] [INFO ] Implicit Places using invariants in 39 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s18 1), p0:(GEQ s6 1), p1:(OR (LT s7 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2448 reset in 152 ms.
Product exploration explored 100000 steps with 2472 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2504 ) properties (out of 6) seen :0
Finished Best-First random walk after 123 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F p2), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 381 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:20:19] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-09 22:20:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 22:20:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:20:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:19] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 22:20:19] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 22:20:19] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 22:20:19] [INFO ] Invariant cache hit.
[2023-03-09 22:20:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 22:20:19] [INFO ] Invariant cache hit.
[2023-03-09 22:20:19] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-09 22:20:19] [INFO ] Invariant cache hit.
[2023-03-09 22:20:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 6) seen :0
Finished Best-First random walk after 531 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F p2), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 386 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
[2023-03-09 22:20:21] [INFO ] Invariant cache hit.
[2023-03-09 22:20:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-09 22:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 22:20:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 22:20:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 22:20:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-09 22:20:21] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 2465 reset in 117 ms.
Product exploration explored 100000 steps with 2455 reset in 132 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 17 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 17 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 17 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 23 rules in 9 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-09 22:20:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2023-03-09 22:20:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 22:20:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 15/21 places, 12/18 transitions.
Built C files in :
/tmp/ltsmin566619064613819487
[2023-03-09 22:20:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin566619064613819487
Running compilation step : cd /tmp/ltsmin566619064613819487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 163 ms.
Running link step : cd /tmp/ltsmin566619064613819487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin566619064613819487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11099015592555603989.hoa' '--buchi-type=spotba'
LTSmin run took 3665 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-11 finished in 9475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 6 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-09 22:20:26] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 22:20:26] [INFO ] Implicit Places using invariants in 28 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 22:20:26] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 22:20:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-09 22:20:26] [INFO ] Invariant cache hit.
[2023-03-09 22:20:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-12 finished in 205 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(p1))||p0)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-09 22:20:26] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 22:20:26] [INFO ] Implicit Places using invariants in 35 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (GEQ s16 1) (GEQ s12 1) (GEQ s9 1)), p1:(AND (GEQ s12 1) (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3339 ) properties (out of 1) seen :0
Finished Best-First random walk after 220 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 22:20:27] [INFO ] Computed 4 place invariants in 5 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-13 finished in 1305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(!p1)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 22:20:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 22:20:27] [INFO ] Implicit Places using invariants in 43 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(GEQ s19 1), p0:(AND (GEQ s12 1) (GEQ s6 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-14 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0&&F(p1)&&X(p2))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-09 22:20:28] [INFO ] Invariant cache hit.
[2023-03-09 22:20:28] [INFO ] Implicit Places using invariants in 46 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0200P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(GEQ s17 1), p1:(GEQ s18 1), p2:(GEQ s12 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0200P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0200P0-LTLFireability-15 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p0))||F(p1)))))'
[2023-03-09 22:20:28] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8592541899460968537
[2023-03-09 22:20:28] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-09 22:20:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:20:28] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-09 22:20:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:20:28] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-09 22:20:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 22:20:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8592541899460968537
Running compilation step : cd /tmp/ltsmin8592541899460968537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 22:20:28] [INFO ] Applying decomposition
[2023-03-09 22:20:28] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13546778367555619485.txt' '-o' '/tmp/graph13546778367555619485.bin' '-w' '/tmp/graph13546778367555619485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13546778367555619485.bin' '-l' '-1' '-v' '-w' '/tmp/graph13546778367555619485.weights' '-q' '0' '-e' '0.001'
[2023-03-09 22:20:28] [INFO ] Decomposing Gal with order
[2023-03-09 22:20:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 22:20:28] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 22:20:28] [INFO ] Flatten gal took : 5 ms
[2023-03-09 22:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-09 22:20:28] [INFO ] Time to serialize gal into /tmp/LTLFireability18031518630829028323.gal : 2 ms
[2023-03-09 22:20:28] [INFO ] Time to serialize properties into /tmp/LTLFireability3083250523853409089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18031518630829028323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3083250523853409089.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(i1.u4.MpG<1)")))||(F("(((i1.u3.MpA>=1)||((i1.u4.Uf>=1)&&(i1.u1.MwU>=1)))||(i1.u3.MpA>=1))"))))))
Formula 0 simplified : XX(XF!"(i1.u4.MpG<1)" & G!"(((i1.u3.MpA>=1)||((i1.u4.Uf>=1)&&(i1.u1.MwU>=1)))||(i1.u3.MpA>=1))")
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin8592541899460968537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8592541899460968537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X([](!(LTLAPp0==true)))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: X(X((X([](!(LTLAPp0==true)))||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.002: "X(X((X([](!(LTLAPp0==true)))||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.091: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.091: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.091: State length is 25, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.091: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.091: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.091: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.091: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.120: ~1 levels ~960 states ~2048 transitions
pins2lts-mc-linux64( 1/ 8), 0.146: ~1 levels ~1920 states ~4160 transitions
pins2lts-mc-linux64( 1/ 8), 0.204: ~1 levels ~3840 states ~8016 transitions
pins2lts-mc-linux64( 3/ 8), 0.264: ~1 levels ~7680 states ~15040 transitions
pins2lts-mc-linux64( 1/ 8), 0.403: ~1 levels ~15360 states ~32432 transitions
pins2lts-mc-linux64( 1/ 8), 0.621: ~1 levels ~30720 states ~64104 transitions
pins2lts-mc-linux64( 2/ 8), 1.018: ~1 levels ~61440 states ~124680 transitions
pins2lts-mc-linux64( 2/ 8), 1.552: ~1 levels ~122880 states ~249208 transitions
pins2lts-mc-linux64( 3/ 8), 2.381: ~1 levels ~245760 states ~483128 transitions
pins2lts-mc-linux64( 3/ 8), 3.345: ~1 levels ~491520 states ~968952 transitions
pins2lts-mc-linux64( 3/ 8), 4.302: ~1 levels ~983040 states ~1955312 transitions
pins2lts-mc-linux64( 7/ 8), 5.445: ~1 levels ~1966080 states ~3946128 transitions
pins2lts-mc-linux64( 7/ 8), 7.073: ~1 levels ~3932160 states ~7892240 transitions
pins2lts-mc-linux64( 7/ 8), 11.191: ~1 levels ~7864320 states ~15749792 transitions
pins2lts-mc-linux64( 5/ 8), 19.900: ~1 levels ~15728640 states ~31355512 transitions
pins2lts-mc-linux64( 5/ 8), 38.522: ~1 levels ~31457280 states ~62791856 transitions
pins2lts-mc-linux64( 6/ 8), 46.465: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 46.552:
pins2lts-mc-linux64( 0/ 8), 46.552: mean standard work distribution: 2.8% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 46.552:
pins2lts-mc-linux64( 0/ 8), 46.552: Explored 33014411 states 66144498 transitions, fanout: 2.004
pins2lts-mc-linux64( 0/ 8), 46.552: Total exploration time 46.460 sec (46.330 sec minimum, 46.387 sec on average)
pins2lts-mc-linux64( 0/ 8), 46.552: States per second: 710599, Transitions per second: 1423687
pins2lts-mc-linux64( 0/ 8), 46.552:
pins2lts-mc-linux64( 0/ 8), 46.552: Progress states detected: 33134477
pins2lts-mc-linux64( 0/ 8), 46.552: Redundant explorations: -0.3625
pins2lts-mc-linux64( 0/ 8), 46.552:
pins2lts-mc-linux64( 0/ 8), 46.552: Queue width: 8B, total height: 272142, memory: 2.08MB
pins2lts-mc-linux64( 0/ 8), 46.552: Tree memory: 508.8MB, 16.1 B/state, compr.: 15.8%
pins2lts-mc-linux64( 0/ 8), 46.552: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 46.552: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 46.552: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 46.552: Est. total memory use: 510.9MB (~1026.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8592541899460968537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X([](!(LTLAPp0==true)))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8592541899460968537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X([](!(LTLAPp0==true)))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-09 22:41:16] [INFO ] Flatten gal took : 3 ms
[2023-03-09 22:41:16] [INFO ] Time to serialize gal into /tmp/LTLFireability7135051997228228690.gal : 1 ms
[2023-03-09 22:41:16] [INFO ] Time to serialize properties into /tmp/LTLFireability6902313258278247074.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7135051997228228690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6902313258278247074.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(MpG<1)")))||(F("(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))"))))))
Formula 0 simplified : XX(XF!"(MpG<1)" & G!"(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))")
Detected timeout of ITS tools.
[2023-03-09 23:02:03] [INFO ] Flatten gal took : 2 ms
[2023-03-09 23:02:03] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 23:02:03] [INFO ] Transformed 24 places.
[2023-03-09 23:02:03] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 23:02:03] [INFO ] Time to serialize gal into /tmp/LTLFireability1674687985733532295.gal : 1 ms
[2023-03-09 23:02:03] [INFO ] Time to serialize properties into /tmp/LTLFireability1838434917803042598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1674687985733532295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1838434917803042598.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((X(G("(MpG<1)")))||(F("(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))"))))))
Formula 0 simplified : XX(XF!"(MpG<1)" & G!"(((MpA>=1)||((Uf>=1)&&(MwU>=1)))||(MpA>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3076432 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033336 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0200P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0200P0, 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 r069-smll-167814396200324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0200P0.tgz
mv ClientsAndServers-PT-N0200P0 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 ;