About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2175645.00 | 0.00 | 0.00 | FTFFFFFFFF?FTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856414000956.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 MultiCrashLeafsetExtension-PT-S32C10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856414000956
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 11K Feb 26 03:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 32M 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 MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679637787063
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=MultiCrashLeafsetExtension-PT-S32C10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-24 06:03:08] [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-24 06:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:03:09] [INFO ] Load time of PNML (sax parser for PT used): 992 ms
[2023-03-24 06:03:09] [INFO ] Transformed 32088 places.
[2023-03-24 06:03:09] [INFO ] Transformed 48223 transitions.
[2023-03-24 06:03:09] [INFO ] Parsed PT model containing 32088 places and 48223 transitions and 181342 arcs in 1215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 32088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 32032 transition count 48223
Applied a total of 56 rules in 2250 ms. Remains 32032 /32088 variables (removed 56) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:03:12] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:03:19] [INFO ] Computed 1837 place invariants in 6740 ms
[2023-03-24 06:03:21] [INFO ] Implicit Places using invariants in 9369 ms returned []
Implicit Place search using SMT only with invariants took 9394 ms to find 0 implicit places.
[2023-03-24 06:03:21] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:03:21] [INFO ] Invariant cache hit.
[2023-03-24 06:03:24] [INFO ] Dead Transitions using invariants and state equation in 2498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32032/32088 places, 48223/48223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14156 ms. Remains : 32032/32088 places, 48223/48223 transitions.
Support contains 67 out of 32032 places after structural reductions.
[2023-03-24 06:03:26] [INFO ] Flatten gal took : 1532 ms
[2023-03-24 06:03:27] [INFO ] Flatten gal took : 1367 ms
[2023-03-24 06:03:30] [INFO ] Input system was already deterministic with 48223 transitions.
Support contains 61 out of 32032 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 711 ms. (steps per millisecond=14 ) properties (out of 32) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-24 06:03:31] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:03:31] [INFO ] Invariant cache hit.
[2023-03-24 06:03:44] [INFO ] [Real]Absence check using 63 positive place invariants in 411 ms returned sat
[2023-03-24 06:03:45] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1715 ms returned sat
[2023-03-24 06:03:56] [INFO ] After 3691ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:16
[2023-03-24 06:03:56] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:03:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:03:56] [INFO ] After 25231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 32032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10476 transitions
Trivial Post-agglo rules discarded 10476 transitions
Performed 10476 trivial Post agglomeration. Transition count delta: 10476
Iterating post reduction 0 with 10476 rules applied. Total rules applied 10476 place count 32032 transition count 37747
Reduce places removed 10476 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 10556 rules applied. Total rules applied 21032 place count 21556 transition count 37667
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 21112 place count 21476 transition count 37667
Performed 655 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 655 Pre rules applied. Total rules applied 21112 place count 21476 transition count 37012
Deduced a syphon composed of 655 places in 68 ms
Reduce places removed 655 places and 0 transitions.
Iterating global reduction 3 with 1310 rules applied. Total rules applied 22422 place count 20821 transition count 37012
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 103 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 22486 place count 20789 transition count 36980
Free-agglomeration rule (complex) applied 1563 times.
Iterating global reduction 3 with 1563 rules applied. Total rules applied 24049 place count 20789 transition count 35417
Reduce places removed 1563 places and 0 transitions.
Iterating post reduction 3 with 1563 rules applied. Total rules applied 25612 place count 19226 transition count 35417
Partial Free-agglomeration rule applied 3084 times.
Drop transitions removed 3084 transitions
Iterating global reduction 4 with 3084 rules applied. Total rules applied 28696 place count 19226 transition count 35417
Applied a total of 28696 rules in 11350 ms. Remains 19226 /32032 variables (removed 12806) and now considering 35417/48223 (removed 12806) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11352 ms. Remains : 19226/32032 places, 35417/48223 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1241 ms. (steps per millisecond=8 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-24 06:04:09] [INFO ] Flow matrix only has 33863 transitions (discarded 1554 similar events)
// Phase 1: matrix 33863 rows 19226 cols
[2023-03-24 06:04:21] [INFO ] Computed 1837 place invariants in 11658 ms
[2023-03-24 06:04:26] [INFO ] [Real]Absence check using 65 positive place invariants in 164 ms returned sat
[2023-03-24 06:04:27] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1087 ms returned sat
[2023-03-24 06:04:46] [INFO ] After 14973ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:1
[2023-03-24 06:04:47] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:04:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:04:47] [INFO ] After 25970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 19226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19226/19226 places, 35417/35417 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19226 transition count 35416
Deduced a syphon composed of 1 places in 35 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19225 transition count 35416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 19225 transition count 35415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 19224 transition count 35415
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 19224 transition count 35415
Applied a total of 20 rules in 4073 ms. Remains 19224 /19226 variables (removed 2) and now considering 35415/35417 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4073 ms. Remains : 19224/19226 places, 35415/35417 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1300 ms. (steps per millisecond=7 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 24605 steps, run timeout after 9001 ms. (steps per millisecond=2 ) properties seen :{9=1, 13=1}
Probabilistic random walk after 24605 steps, saw 11580 distinct states, run finished after 9002 ms. (steps per millisecond=2 ) properties seen :2
Running SMT prover for 12 properties.
[2023-03-24 06:05:03] [INFO ] Flow matrix only has 33861 transitions (discarded 1554 similar events)
// Phase 1: matrix 33861 rows 19224 cols
[2023-03-24 06:05:15] [INFO ] Computed 1837 place invariants in 11668 ms
[2023-03-24 06:05:20] [INFO ] [Real]Absence check using 65 positive place invariants in 192 ms returned sat
[2023-03-24 06:05:21] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1081 ms returned sat
[2023-03-24 06:05:40] [INFO ] After 16372ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-24 06:05:41] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:05:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:05:41] [INFO ] After 25586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 19224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19224/19224 places, 35415/35415 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 19224 transition count 35414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19223 transition count 35414
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 19223 transition count 35413
Deduced a syphon composed of 1 places in 33 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19222 transition count 35413
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19222 transition count 35411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19220 transition count 35411
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 19220 transition count 35411
Applied a total of 24 rules in 4278 ms. Remains 19220 /19224 variables (removed 4) and now considering 35411/35415 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4278 ms. Remains : 19220/19224 places, 35411/35415 transitions.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26016 stabilizing places and 36254 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1692 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:05:47] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:05:54] [INFO ] Computed 1837 place invariants in 6957 ms
[2023-03-24 06:05:56] [INFO ] Implicit Places using invariants in 9342 ms returned []
Implicit Place search using SMT only with invariants took 9343 ms to find 0 implicit places.
[2023-03-24 06:05:56] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:05:56] [INFO ] Invariant cache hit.
[2023-03-24 06:05:59] [INFO ] Dead Transitions using invariants and state equation in 2374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13412 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s29845 1) (GEQ s31836 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 finished in 13846 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)||X(F((X(p2)||p1))))))'
Support contains 5 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1692 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:01] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:01] [INFO ] Invariant cache hit.
[2023-03-24 06:06:03] [INFO ] Implicit Places using invariants in 2446 ms returned []
Implicit Place search using SMT only with invariants took 2447 ms to find 0 implicit places.
[2023-03-24 06:06:03] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:03] [INFO ] Invariant cache hit.
[2023-03-24 06:06:06] [INFO ] Dead Transitions using invariants and state equation in 2428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6571 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s31436 1), p1:(OR (LT s12566 1) (LT s12871 1)), p2:(OR (LT s7875 1) (LT s31556 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]]
Product exploration timeout after 80400 steps with 26800 reset in 10002 ms.
Product exploration timeout after 83250 steps with 27750 reset in 10001 ms.
Computed a total of 26016 stabilizing places and 36254 stable transitions
Computed a total of 26016 stabilizing places and 36254 stable transitions
Detected a total of 26016/32032 stabilizing places and 36254/48223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01 finished in 27295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(!p1)&&F((G(F(!p2))||(!p1&&F(!p2))))) U G(p0)))'
Support contains 8 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1614 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:28] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:28] [INFO ] Invariant cache hit.
[2023-03-24 06:06:31] [INFO ] Implicit Places using invariants in 2515 ms returned []
Implicit Place search using SMT only with invariants took 2516 ms to find 0 implicit places.
[2023-03-24 06:06:31] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:31] [INFO ] Invariant cache hit.
[2023-03-24 06:06:33] [INFO ] Dead Transitions using invariants and state equation in 2405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6538 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p2), (OR (NOT p0) p1 p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s15846 1) (GEQ s15848 1) (GEQ s24548 1)), p2:(AND (GEQ s12928 1) (GEQ s31661 1)), p1:(AND (GEQ s3619 1) (GEQ s28219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 finished in 6989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1594 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:35] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:35] [INFO ] Invariant cache hit.
[2023-03-24 06:06:38] [INFO ] Implicit Places using invariants in 2494 ms returned []
Implicit Place search using SMT only with invariants took 2495 ms to find 0 implicit places.
[2023-03-24 06:06:38] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:38] [INFO ] Invariant cache hit.
[2023-03-24 06:06:40] [INFO ] Dead Transitions using invariants and state equation in 2425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6518 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s31665 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04 finished in 6776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (F(p0)&&p1)))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1570 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:42] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:42] [INFO ] Invariant cache hit.
[2023-03-24 06:06:44] [INFO ] Implicit Places using invariants in 2438 ms returned []
Implicit Place search using SMT only with invariants took 2439 ms to find 0 implicit places.
[2023-03-24 06:06:44] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:44] [INFO ] Invariant cache hit.
[2023-03-24 06:06:47] [INFO ] Dead Transitions using invariants and state equation in 2366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6378 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s21743 1) (GEQ s31522 1)), p0:(AND (GEQ s21446 1) (GEQ s21730 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 finished in 6713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1569 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:49] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:49] [INFO ] Invariant cache hit.
[2023-03-24 06:06:51] [INFO ] Implicit Places using invariants in 2465 ms returned []
Implicit Place search using SMT only with invariants took 2474 ms to find 0 implicit places.
[2023-03-24 06:06:51] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:51] [INFO ] Invariant cache hit.
[2023-03-24 06:06:53] [INFO ] Dead Transitions using invariants and state equation in 2415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6463 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s5127 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06 finished in 6772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1575 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:06:55] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:55] [INFO ] Invariant cache hit.
[2023-03-24 06:06:58] [INFO ] Implicit Places using invariants in 2367 ms returned []
Implicit Place search using SMT only with invariants took 2367 ms to find 0 implicit places.
[2023-03-24 06:06:58] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:06:58] [INFO ] Invariant cache hit.
[2023-03-24 06:07:00] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6346 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s15306 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 finished in 6640 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(G(p0))&&F(p1))))'
Support contains 3 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10559 transitions
Trivial Post-agglo rules discarded 10559 transitions
Performed 10559 trivial Post agglomeration. Transition count delta: 10559
Iterating post reduction 0 with 10559 rules applied. Total rules applied 10559 place count 32032 transition count 37664
Reduce places removed 10559 places and 0 transitions.
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21118 place count 21473 transition count 37664
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21118 place count 21473 transition count 37004
Deduced a syphon composed of 660 places in 61 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 50 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Applied a total of 22504 rules in 5389 ms. Remains 20780 /32032 variables (removed 11252) and now considering 36971/48223 (removed 11252) transitions.
[2023-03-24 06:07:06] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2023-03-24 06:07:11] [INFO ] Computed 1837 place invariants in 5121 ms
[2023-03-24 06:07:12] [INFO ] Implicit Places using invariants in 6715 ms returned []
Implicit Place search using SMT only with invariants took 6716 ms to find 0 implicit places.
[2023-03-24 06:07:12] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
[2023-03-24 06:07:12] [INFO ] Invariant cache hit.
[2023-03-24 06:07:14] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/32032 places, 36971/48223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13691 ms. Remains : 20780/32032 places, 36971/48223 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6485 1) (GEQ s11596 1)), p1:(GEQ s7461 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 finished in 13929 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)) U p1))'
Support contains 3 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10543 transitions
Trivial Post-agglo rules discarded 10543 transitions
Performed 10543 trivial Post agglomeration. Transition count delta: 10543
Iterating post reduction 0 with 10543 rules applied. Total rules applied 10543 place count 32032 transition count 37680
Reduce places removed 10543 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21102 place count 21489 transition count 37664
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 21118 place count 21473 transition count 37664
Performed 659 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 659 Pre rules applied. Total rules applied 21118 place count 21473 transition count 37005
Deduced a syphon composed of 659 places in 60 ms
Reduce places removed 659 places and 0 transitions.
Iterating global reduction 3 with 1318 rules applied. Total rules applied 22436 place count 20814 transition count 37005
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 49 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22502 place count 20781 transition count 36972
Applied a total of 22502 rules in 5335 ms. Remains 20781 /32032 variables (removed 11251) and now considering 36972/48223 (removed 11251) transitions.
[2023-03-24 06:07:20] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:07:25] [INFO ] Computed 1837 place invariants in 5003 ms
[2023-03-24 06:07:26] [INFO ] Implicit Places using invariants in 6631 ms returned []
Implicit Place search using SMT only with invariants took 6632 ms to find 0 implicit places.
[2023-03-24 06:07:26] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:07:26] [INFO ] Invariant cache hit.
[2023-03-24 06:07:28] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20781/32032 places, 36972/48223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13558 ms. Remains : 20781/32032 places, 36972/48223 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s14508 1), p0:(AND (GEQ s14109 1) (GEQ s14130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 finished in 13783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(((!p0||G(!p1))&&(!p0||X(!p0))))) U p2))'
Support contains 6 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1628 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:07:30] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:07:36] [INFO ] Computed 1837 place invariants in 6690 ms
[2023-03-24 06:07:39] [INFO ] Implicit Places using invariants in 9099 ms returned []
Implicit Place search using SMT only with invariants took 9101 ms to find 0 implicit places.
[2023-03-24 06:07:39] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:07:39] [INFO ] Invariant cache hit.
[2023-03-24 06:07:41] [INFO ] Dead Transitions using invariants and state equation in 2412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13142 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), p0, (AND p0 p1), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s23384 1) (GEQ s23588 1)), p0:(AND (GEQ s11865 1) (GEQ s31941 1)), p1:(AND (GEQ s28629 1) (GEQ s28806 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 979 reset in 2991 ms.
Product exploration explored 100000 steps with 978 reset in 3005 ms.
Computed a total of 26016 stabilizing places and 36254 stable transitions
Computed a total of 26016 stabilizing places and 36254 stable transitions
Detected a total of 26016/32032 stabilizing places and 36254/48223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 817 ms. Reduced automaton from 4 states, 16 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), p0]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5495 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5495 steps, saw 2864 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:07:52] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:07:52] [INFO ] Invariant cache hit.
[2023-03-24 06:07:58] [INFO ] [Real]Absence check using 63 positive place invariants in 298 ms returned sat
[2023-03-24 06:07:59] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1663 ms returned sat
[2023-03-24 06:08:17] [INFO ] After 17428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:08:18] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:08:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:08:18] [INFO ] After 25155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10560 transitions
Trivial Post-agglo rules discarded 10560 transitions
Performed 10560 trivial Post agglomeration. Transition count delta: 10560
Iterating post reduction 0 with 10560 rules applied. Total rules applied 10560 place count 32032 transition count 37663
Reduce places removed 10560 places and 0 transitions.
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37003
Deduced a syphon composed of 660 places in 62 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22440 place count 20812 transition count 37003
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 50 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Free-agglomeration rule (complex) applied 1572 times.
Iterating global reduction 2 with 1572 rules applied. Total rules applied 24076 place count 20780 transition count 35399
Reduce places removed 1572 places and 0 transitions.
Iterating post reduction 2 with 1572 rules applied. Total rules applied 25648 place count 19208 transition count 35399
Applied a total of 25648 rules in 8763 ms. Remains 19208 /32032 variables (removed 12824) and now considering 35399/48223 (removed 12824) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8764 ms. Remains : 19208/32032 places, 35399/48223 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1143 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7897 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7897 steps, saw 3840 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:08:31] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
// Phase 1: matrix 33845 rows 19208 cols
[2023-03-24 06:08:43] [INFO ] Computed 1837 place invariants in 11792 ms
[2023-03-24 06:08:45] [INFO ] [Real]Absence check using 65 positive place invariants in 160 ms returned sat
[2023-03-24 06:08:46] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1096 ms returned sat
[2023-03-24 06:09:08] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1285 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1285 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1271 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
[2023-03-24 06:09:10] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:09:10] [INFO ] Invariant cache hit.
[2023-03-24 06:09:12] [INFO ] Implicit Places using invariants in 1525 ms returned []
Implicit Place search using SMT only with invariants took 1534 ms to find 0 implicit places.
[2023-03-24 06:09:12] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:09:12] [INFO ] Invariant cache hit.
[2023-03-24 06:09:13] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4303 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Graph (trivial) has 7321 edges and 19208 vertex of which 32 / 19208 are part of one of the 1 SCC in 23 ms
Free SCC test removed 31 places
Drop transitions removed 1055 transitions
Ensure Unique test removed 1517 transitions
Reduce isomorphic transitions removed 2572 transitions.
Graph (complete) has 115444 edges and 19177 vertex of which 19147 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.17 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 639 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t21243.t24021 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 415 rules applied. Total rules applied 417 place count 18507 transition count 32412
Ensure Unique test removed 1 places
Reduce places removed 414 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 1 with 1201 rules applied. Total rules applied 1618 place count 18093 transition count 31625
Ensure Unique test removed 1 places
Reduce places removed 394 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 374 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 2 with 1092 rules applied. Total rules applied 2710 place count 17699 transition count 30927
Ensure Unique test removed 48 places
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 305 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 3 with 980 rules applied. Total rules applied 3690 place count 17327 transition count 30319
Ensure Unique test removed 2 places
Reduce places removed 305 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 284 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 4 with 831 rules applied. Total rules applied 4521 place count 17022 transition count 29793
Ensure Unique test removed 40 places
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 5 with 726 rules applied. Total rules applied 5247 place count 16740 transition count 29349
Ensure Unique test removed 2 places
Reduce places removed 223 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 202 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 6 with 593 rules applied. Total rules applied 5840 place count 16517 transition count 28979
Ensure Unique test removed 32 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 7 with 496 rules applied. Total rules applied 6336 place count 16317 transition count 28683
Ensure Unique test removed 2 places
Reduce places removed 149 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 8 with 379 rules applied. Total rules applied 6715 place count 16168 transition count 28453
Ensure Unique test removed 24 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 9 with 290 rules applied. Total rules applied 7005 place count 16042 transition count 28289
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 10 with 189 rules applied. Total rules applied 7194 place count 15959 transition count 28183
Ensure Unique test removed 16 places
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 11 with 108 rules applied. Total rules applied 7302 place count 15899 transition count 28135
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 12 with 61 rules applied. Total rules applied 7363 place count 15874 transition count 28099
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 13 with 47 rules applied. Total rules applied 7410 place count 15851 transition count 28075
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 29 rules applied. Total rules applied 7439 place count 15838 transition count 28059
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 15 with 19 rules applied. Total rules applied 7458 place count 15827 transition count 28051
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 7467 place count 15822 transition count 28047
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 17 with 16 rules applied. Total rules applied 7483 place count 15819 transition count 28034
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 7496 place count 15806 transition count 28034
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 660 Pre rules applied. Total rules applied 7496 place count 15806 transition count 27374
Deduced a syphon composed of 660 places in 20 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 19 with 1320 rules applied. Total rules applied 8816 place count 15146 transition count 27374
Performed 2501 Post agglomeration using F-continuation condition.Transition count delta: 2501
Deduced a syphon composed of 2501 places in 13 ms
Reduce places removed 2501 places and 0 transitions.
Iterating global reduction 19 with 5002 rules applied. Total rules applied 13818 place count 12645 transition count 24873
Drop transitions removed 2435 transitions
Reduce isomorphic transitions removed 2435 transitions.
Iterating post reduction 19 with 2435 rules applied. Total rules applied 16253 place count 12645 transition count 22438
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 16254 place count 12645 transition count 22438
Partial Post-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 20 with 31 rules applied. Total rules applied 16285 place count 12645 transition count 22438
Applied a total of 16285 rules in 95245 ms. Remains 12645 /19208 variables (removed 6563) and now considering 22438/35399 (removed 12961) transitions.
Running SMT prover for 2 properties.
[2023-03-24 06:10:49] [INFO ] Flow matrix only has 22182 transitions (discarded 256 similar events)
// Phase 1: matrix 22182 rows 12645 cols
[2023-03-24 06:11:00] [INFO ] Computed 973 place invariants in 11858 ms
[2023-03-24 06:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2023-03-24 06:11:02] [INFO ] [Real]Absence check using 4 positive and 969 generalized place invariants in 413 ms returned sat
[2023-03-24 06:11:03] [INFO ] After 2072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 06:11:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2023-03-24 06:11:04] [INFO ] [Nat]Absence check using 4 positive and 969 generalized place invariants in 433 ms returned sat
[2023-03-24 06:11:58] [INFO ] After 53620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 06:11:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:11:59] [INFO ] After 1085ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 06:12:01] [INFO ] After 2993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1096 ms.
[2023-03-24 06:12:02] [INFO ] After 59846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 650 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), p0]
[2023-03-24 06:12:03] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:12:10] [INFO ] Computed 1837 place invariants in 6749 ms
Could not prove EG (NOT p2)
Support contains 4 out of 32032 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10544 transitions
Trivial Post-agglo rules discarded 10544 transitions
Performed 10544 trivial Post agglomeration. Transition count delta: 10544
Iterating post reduction 0 with 10544 rules applied. Total rules applied 10544 place count 32032 transition count 37679
Reduce places removed 10544 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21104 place count 21488 transition count 37663
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 659 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 659 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37004
Deduced a syphon composed of 659 places in 61 ms
Reduce places removed 659 places and 0 transitions.
Iterating global reduction 3 with 1318 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 51 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 22502 place count 20781 transition count 36972
Applied a total of 22502 rules in 5362 ms. Remains 20781 /32032 variables (removed 11251) and now considering 36972/48223 (removed 11251) transitions.
[2023-03-24 06:12:31] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:12:36] [INFO ] Computed 1837 place invariants in 5028 ms
[2023-03-24 06:12:37] [INFO ] Implicit Places using invariants in 6637 ms returned []
Implicit Place search using SMT only with invariants took 6638 ms to find 0 implicit places.
[2023-03-24 06:12:37] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:12:37] [INFO ] Invariant cache hit.
[2023-03-24 06:12:39] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20781/32032 places, 36972/48223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13616 ms. Remains : 20781/32032 places, 36972/48223 transitions.
Computed a total of 14797 stabilizing places and 25035 stable transitions
Computed a total of 14797 stabilizing places and 25035 stable transitions
Detected a total of 14797/20781 stabilizing places and 25035/36972 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), p0]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6873 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6873 steps, saw 3426 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:12:43] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:12:43] [INFO ] Invariant cache hit.
[2023-03-24 06:12:46] [INFO ] [Real]Absence check using 63 positive place invariants in 164 ms returned sat
[2023-03-24 06:12:47] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1610 ms returned sat
[2023-03-24 06:13:08] [INFO ] After 20059ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:13:08] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:13:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:13:08] [INFO ] After 25195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20781 transition count 36971
Deduced a syphon composed of 1 places in 49 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20780 transition count 36971
Free-agglomeration rule (complex) applied 1572 times.
Iterating global reduction 0 with 1572 rules applied. Total rules applied 1574 place count 20780 transition count 35399
Reduce places removed 1572 places and 0 transitions.
Iterating post reduction 0 with 1572 rules applied. Total rules applied 3146 place count 19208 transition count 35399
Applied a total of 3146 rules in 5639 ms. Remains 19208 /20781 variables (removed 1573) and now considering 35399/36972 (removed 1573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5640 ms. Remains : 19208/20781 places, 35399/36972 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1133 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7963 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7963 steps, saw 3865 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:13:18] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
// Phase 1: matrix 33845 rows 19208 cols
[2023-03-24 06:13:31] [INFO ] Computed 1837 place invariants in 12480 ms
[2023-03-24 06:13:33] [INFO ] [Real]Absence check using 65 positive place invariants in 162 ms returned sat
[2023-03-24 06:13:34] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1136 ms returned sat
[2023-03-24 06:13:56] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1305 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1305 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1333 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
[2023-03-24 06:13:58] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:13:58] [INFO ] Invariant cache hit.
[2023-03-24 06:14:00] [INFO ] Implicit Places using invariants in 1526 ms returned []
Implicit Place search using SMT only with invariants took 1527 ms to find 0 implicit places.
[2023-03-24 06:14:00] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:14:00] [INFO ] Invariant cache hit.
[2023-03-24 06:14:01] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4380 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Graph (trivial) has 7321 edges and 19208 vertex of which 32 / 19208 are part of one of the 1 SCC in 5 ms
Free SCC test removed 31 places
Drop transitions removed 1055 transitions
Ensure Unique test removed 1517 transitions
Reduce isomorphic transitions removed 2572 transitions.
Graph (complete) has 115444 edges and 19177 vertex of which 19147 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.16 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 639 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t21243.t24021 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 415 rules applied. Total rules applied 417 place count 18507 transition count 32412
Ensure Unique test removed 1 places
Reduce places removed 414 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 1 with 1201 rules applied. Total rules applied 1618 place count 18093 transition count 31625
Ensure Unique test removed 1 places
Reduce places removed 394 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 374 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 2 with 1092 rules applied. Total rules applied 2710 place count 17699 transition count 30927
Ensure Unique test removed 48 places
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 305 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 3 with 980 rules applied. Total rules applied 3690 place count 17327 transition count 30319
Ensure Unique test removed 2 places
Reduce places removed 305 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 284 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 4 with 831 rules applied. Total rules applied 4521 place count 17022 transition count 29793
Ensure Unique test removed 40 places
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 5 with 726 rules applied. Total rules applied 5247 place count 16740 transition count 29349
Ensure Unique test removed 2 places
Reduce places removed 223 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 202 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 6 with 593 rules applied. Total rules applied 5840 place count 16517 transition count 28979
Ensure Unique test removed 32 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 7 with 496 rules applied. Total rules applied 6336 place count 16317 transition count 28683
Ensure Unique test removed 2 places
Reduce places removed 149 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 8 with 379 rules applied. Total rules applied 6715 place count 16168 transition count 28453
Ensure Unique test removed 24 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 9 with 290 rules applied. Total rules applied 7005 place count 16042 transition count 28289
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 10 with 189 rules applied. Total rules applied 7194 place count 15959 transition count 28183
Ensure Unique test removed 16 places
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 11 with 108 rules applied. Total rules applied 7302 place count 15899 transition count 28135
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 12 with 61 rules applied. Total rules applied 7363 place count 15874 transition count 28099
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 13 with 47 rules applied. Total rules applied 7410 place count 15851 transition count 28075
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 29 rules applied. Total rules applied 7439 place count 15838 transition count 28059
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 15 with 19 rules applied. Total rules applied 7458 place count 15827 transition count 28051
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 7467 place count 15822 transition count 28047
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 17 with 16 rules applied. Total rules applied 7483 place count 15819 transition count 28034
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 7496 place count 15806 transition count 28034
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 660 Pre rules applied. Total rules applied 7496 place count 15806 transition count 27374
Deduced a syphon composed of 660 places in 21 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 19 with 1320 rules applied. Total rules applied 8816 place count 15146 transition count 27374
Performed 2501 Post agglomeration using F-continuation condition.Transition count delta: 2501
Deduced a syphon composed of 2501 places in 12 ms
Reduce places removed 2501 places and 0 transitions.
Iterating global reduction 19 with 5002 rules applied. Total rules applied 13818 place count 12645 transition count 24873
Drop transitions removed 2435 transitions
Reduce isomorphic transitions removed 2435 transitions.
Iterating post reduction 19 with 2435 rules applied. Total rules applied 16253 place count 12645 transition count 22438
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 16254 place count 12645 transition count 22438
Partial Post-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 20 with 31 rules applied. Total rules applied 16285 place count 12645 transition count 22438
Applied a total of 16285 rules in 98347 ms. Remains 12645 /19208 variables (removed 6563) and now considering 22438/35399 (removed 12961) transitions.
Running SMT prover for 2 properties.
[2023-03-24 06:15:40] [INFO ] Flow matrix only has 22182 transitions (discarded 256 similar events)
// Phase 1: matrix 22182 rows 12645 cols
[2023-03-24 06:15:52] [INFO ] Computed 973 place invariants in 12075 ms
[2023-03-24 06:15:53] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-24 06:15:54] [INFO ] [Real]Absence check using 4 positive and 969 generalized place invariants in 421 ms returned sat
[2023-03-24 06:15:54] [INFO ] After 2136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 06:15:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 19 ms returned sat
[2023-03-24 06:15:56] [INFO ] [Nat]Absence check using 4 positive and 969 generalized place invariants in 443 ms returned sat
[2023-03-24 06:16:59] [INFO ] After 62866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 06:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:17:00] [INFO ] After 1157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 06:17:02] [INFO ] After 3155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1123 ms.
[2023-03-24 06:17:03] [INFO ] After 69250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), p0]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), p0]
[2023-03-24 06:17:04] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:17:09] [INFO ] Computed 1837 place invariants in 5061 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), p0]
Product exploration explored 100000 steps with 1222 reset in 2829 ms.
Product exploration explored 100000 steps with 1222 reset in 2850 ms.
Built C files in :
/tmp/ltsmin15568169574021200417
[2023-03-24 06:17:30] [INFO ] Too many transitions (36972) to apply POR reductions. Disabling POR matrices.
[2023-03-24 06:17:30] [INFO ] Built C files in 368ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15568169574021200417
Running compilation step : cd /tmp/ltsmin15568169574021200417;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15568169574021200417;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15568169574021200417;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 20781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20781 transition count 36971
Deduced a syphon composed of 1 places in 48 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20780 transition count 36971
Applied a total of 2 rules in 2051 ms. Remains 20780 /20781 variables (removed 1) and now considering 36971/36972 (removed 1) transitions.
[2023-03-24 06:17:35] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2023-03-24 06:17:40] [INFO ] Computed 1837 place invariants in 5146 ms
[2023-03-24 06:17:42] [INFO ] Implicit Places using invariants in 6765 ms returned []
Implicit Place search using SMT only with invariants took 6766 ms to find 0 implicit places.
[2023-03-24 06:17:42] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
[2023-03-24 06:17:42] [INFO ] Invariant cache hit.
[2023-03-24 06:17:44] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/20781 places, 36971/36972 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10467 ms. Remains : 20780/20781 places, 36971/36972 transitions.
Built C files in :
/tmp/ltsmin7112264858226557571
[2023-03-24 06:17:44] [INFO ] Too many transitions (36971) to apply POR reductions. Disabling POR matrices.
[2023-03-24 06:17:44] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7112264858226557571
Running compilation step : cd /tmp/ltsmin7112264858226557571;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7112264858226557571;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7112264858226557571;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-24 06:17:49] [INFO ] Flatten gal took : 884 ms
[2023-03-24 06:17:50] [INFO ] Flatten gal took : 853 ms
[2023-03-24 06:17:50] [INFO ] Time to serialize gal into /tmp/LTL2318471686479793253.gal : 206 ms
[2023-03-24 06:17:50] [INFO ] Time to serialize properties into /tmp/LTL6794578307674611948.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/LTL2318471686479793253.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4302953814023792730.hoa' '-atoms' '/tmp/LTL6794578307674611948.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...317
Loading property file /tmp/LTL6794578307674611948.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4302953814023792730.hoa
Detected timeout of ITS tools.
[2023-03-24 06:18:07] [INFO ] Flatten gal took : 817 ms
[2023-03-24 06:18:08] [INFO ] Flatten gal took : 846 ms
[2023-03-24 06:18:08] [INFO ] Time to serialize gal into /tmp/LTL6819094859712485691.gal : 176 ms
[2023-03-24 06:18:08] [INFO ] Time to serialize properties into /tmp/LTL2901891026336072274.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/LTL6819094859712485691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2901891026336072274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G(((!("((Node11ManageTheCrashOfNode25>=1)&&(Rx7IsAtTheRightExtremityOfTheLeafSet>=1))"))||(G(!("((Node30HasAskedItsLeafSetToRx0T...466
Formula 0 simplified : GF(("((Node11ManageTheCrashOfNode25>=1)&&(Rx7IsAtTheRightExtremityOfTheLeafSet>=1))" & F"((Node30HasAskedItsLeafSetToRx0ToReplaceNod...439
Detected timeout of ITS tools.
[2023-03-24 06:18:24] [INFO ] Flatten gal took : 757 ms
[2023-03-24 06:18:24] [INFO ] Applying decomposition
[2023-03-24 06:18:25] [INFO ] Flatten gal took : 821 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/graph1140321517814681659.txt' '-o' '/tmp/graph1140321517814681659.bin' '-w' '/tmp/graph1140321517814681659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1140321517814681659.bin' '-l' '-1' '-v' '-w' '/tmp/graph1140321517814681659.weights' '-q' '0' '-e' '0.001'
[2023-03-24 06:18:27] [INFO ] Decomposing Gal with order
[2023-03-24 06:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 06:18:44] [INFO ] Removed a total of 30451 redundant transitions.
[2023-03-24 06:18:46] [INFO ] Flatten gal took : 9455 ms
[2023-03-24 06:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 7436 labels/synchronizations in 1610 ms.
[2023-03-24 06:18:50] [INFO ] Time to serialize gal into /tmp/LTL466328660306932304.gal : 256 ms
[2023-03-24 06:18:50] [INFO ] Time to serialize properties into /tmp/LTL13949498416766537367.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/LTL466328660306932304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13949498416766537367.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6238311286299584498
[2023-03-24 06:19:05] [INFO ] Built C files in 269ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6238311286299584498
Running compilation step : cd /tmp/ltsmin6238311286299584498;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6238311286299584498;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6238311286299584498;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 finished in 699827 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(!p0)||G(F(p1))))))))'
Support contains 3 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1729 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:19:10] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:19:17] [INFO ] Computed 1837 place invariants in 6914 ms
[2023-03-24 06:19:19] [INFO ] Implicit Places using invariants in 9363 ms returned []
Implicit Place search using SMT only with invariants took 9364 ms to find 0 implicit places.
[2023-03-24 06:19:19] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:19:19] [INFO ] Invariant cache hit.
[2023-03-24 06:19:21] [INFO ] Dead Transitions using invariants and state equation in 2397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13493 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 201 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s21814 1) (GEQ s31451 1)), p1:(LT s1042 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 977 reset in 3619 ms.
Product exploration explored 100000 steps with 979 reset in 3342 ms.
Computed a total of 26016 stabilizing places and 36254 stable transitions
Computed a total of 26016 stabilizing places and 36254 stable transitions
Detected a total of 26016/32032 stabilizing places and 36254/48223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-24 06:19:30] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:19:30] [INFO ] Invariant cache hit.
[2023-03-24 06:19:35] [INFO ] [Real]Absence check using 63 positive place invariants in 423 ms returned sat
[2023-03-24 06:19:38] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 2228 ms returned sat
[2023-03-24 06:19:38] [INFO ] After 7217ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 10 factoid took 275 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12 finished in 30026 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(G(p0)))))))'
Support contains 2 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1746 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:19:40] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:19:40] [INFO ] Invariant cache hit.
[2023-03-24 06:19:42] [INFO ] Implicit Places using invariants in 2492 ms returned []
Implicit Place search using SMT only with invariants took 2493 ms to find 0 implicit places.
[2023-03-24 06:19:42] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:19:42] [INFO ] Invariant cache hit.
[2023-03-24 06:19:45] [INFO ] Dead Transitions using invariants and state equation in 2445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6686 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s20102 1) (GEQ s31521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 finished in 7054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||G((F(p1) U p2)))))'
Support contains 8 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10560 transitions
Trivial Post-agglo rules discarded 10560 transitions
Performed 10560 trivial Post agglomeration. Transition count delta: 10560
Iterating post reduction 0 with 10560 rules applied. Total rules applied 10560 place count 32032 transition count 37663
Reduce places removed 10560 places and 0 transitions.
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37003
Deduced a syphon composed of 660 places in 72 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22440 place count 20812 transition count 37003
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 53 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 22506 place count 20779 transition count 36970
Applied a total of 22506 rules in 5380 ms. Remains 20779 /32032 variables (removed 11253) and now considering 36970/48223 (removed 11253) transitions.
[2023-03-24 06:19:50] [INFO ] Flow matrix only has 35914 transitions (discarded 1056 similar events)
// Phase 1: matrix 35914 rows 20779 cols
[2023-03-24 06:19:56] [INFO ] Computed 1837 place invariants in 5195 ms
[2023-03-24 06:19:57] [INFO ] Implicit Places using invariants in 6805 ms returned []
Implicit Place search using SMT only with invariants took 6806 ms to find 0 implicit places.
[2023-03-24 06:19:57] [INFO ] Flow matrix only has 35914 transitions (discarded 1056 similar events)
[2023-03-24 06:19:57] [INFO ] Invariant cache hit.
[2023-03-24 06:19:59] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20779/32032 places, 36970/48223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13817 ms. Remains : 20779/32032 places, 36970/48223 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s10694 1) (LT s11838 1) (LT s11840 1)), p1:(AND (GEQ s12066 1) (GEQ s17116 1)), p2:(AND (GEQ s12545 1) (GEQ s14719 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14 finished in 14143 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(X(((p0 U p1)||F(G(p2))))))))'
Support contains 6 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1597 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 06:20:01] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2023-03-24 06:20:08] [INFO ] Computed 1837 place invariants in 6923 ms
[2023-03-24 06:20:10] [INFO ] Implicit Places using invariants in 9360 ms returned []
Implicit Place search using SMT only with invariants took 9361 ms to find 0 implicit places.
[2023-03-24 06:20:10] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 06:20:10] [INFO ] Invariant cache hit.
[2023-03-24 06:20:13] [INFO ] Dead Transitions using invariants and state equation in 2426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13387 ms. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (GEQ s5355 1) (GEQ s5759 1)), p0:(AND (GEQ s4716 1) (GEQ s28217 1)), p2:(AND (GEQ s28898 1) (GEQ s31416 1) (OR (LT s4716 1) (LT s28217 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 finished in 13820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(((!p0||G(!p1))&&(!p0||X(!p0))))) U p2))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), p0, (AND p0 p1), p0]
Support contains 6 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10544 transitions
Trivial Post-agglo rules discarded 10544 transitions
Performed 10544 trivial Post agglomeration. Transition count delta: 10544
Iterating post reduction 0 with 10544 rules applied. Total rules applied 10544 place count 32032 transition count 37679
Reduce places removed 10544 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21104 place count 21488 transition count 37663
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 659 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 659 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37004
Deduced a syphon composed of 659 places in 63 ms
Reduce places removed 659 places and 0 transitions.
Iterating global reduction 3 with 1318 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 48 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 22502 place count 20781 transition count 36972
Applied a total of 22502 rules in 5358 ms. Remains 20781 /32032 variables (removed 11251) and now considering 36972/48223 (removed 11251) transitions.
[2023-03-24 06:20:19] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:20:24] [INFO ] Computed 1837 place invariants in 5156 ms
[2023-03-24 06:20:25] [INFO ] Implicit Places using invariants in 6754 ms returned []
Implicit Place search using SMT only with invariants took 6755 ms to find 0 implicit places.
[2023-03-24 06:20:25] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:20:25] [INFO ] Invariant cache hit.
[2023-03-24 06:20:27] [INFO ] Dead Transitions using invariants and state equation in 1623 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 20781/32032 places, 36972/48223 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13741 ms. Remains : 20781/32032 places, 36972/48223 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s14608 1) (GEQ s14722 1)), p0:(AND (GEQ s7873 1) (GEQ s20690 1)), p1:(AND (GEQ s18149 1) (GEQ s18255 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1223 reset in 2797 ms.
Product exploration explored 100000 steps with 1223 reset in 2889 ms.
Computed a total of 14797 stabilizing places and 25035 stable transitions
Computed a total of 14797 stabilizing places and 25035 stable transitions
Detected a total of 14797/20781 stabilizing places and 25035/36972 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 795 ms. Reduced automaton from 4 states, 16 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), p0]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6795 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6795 steps, saw 3395 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:20:37] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:20:37] [INFO ] Invariant cache hit.
[2023-03-24 06:20:40] [INFO ] [Real]Absence check using 63 positive place invariants in 165 ms returned sat
[2023-03-24 06:20:42] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1580 ms returned sat
[2023-03-24 06:21:03] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20781 transition count 36971
Deduced a syphon composed of 1 places in 53 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20780 transition count 36971
Free-agglomeration rule (complex) applied 1572 times.
Iterating global reduction 0 with 1572 rules applied. Total rules applied 1574 place count 20780 transition count 35399
Reduce places removed 1572 places and 0 transitions.
Iterating post reduction 0 with 1572 rules applied. Total rules applied 3146 place count 19208 transition count 35399
Applied a total of 3146 rules in 6035 ms. Remains 19208 /20781 variables (removed 1573) and now considering 35399/36972 (removed 1573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6036 ms. Remains : 19208/20781 places, 35399/36972 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1156 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7935 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7935 steps, saw 3854 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:21:13] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
// Phase 1: matrix 33845 rows 19208 cols
[2023-03-24 06:21:25] [INFO ] Computed 1837 place invariants in 12452 ms
[2023-03-24 06:21:28] [INFO ] [Real]Absence check using 65 positive place invariants in 160 ms returned sat
[2023-03-24 06:21:29] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1184 ms returned sat
[2023-03-24 06:21:51] [INFO ] After 20879ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:21:51] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:21:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:21:51] [INFO ] After 25470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1320 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1320 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1315 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
[2023-03-24 06:21:54] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:21:54] [INFO ] Invariant cache hit.
[2023-03-24 06:21:55] [INFO ] Implicit Places using invariants in 1568 ms returned []
Implicit Place search using SMT only with invariants took 1571 ms to find 0 implicit places.
[2023-03-24 06:21:55] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:21:55] [INFO ] Invariant cache hit.
[2023-03-24 06:21:57] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4430 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Graph (trivial) has 7321 edges and 19208 vertex of which 32 / 19208 are part of one of the 1 SCC in 4 ms
Free SCC test removed 31 places
Drop transitions removed 1055 transitions
Ensure Unique test removed 1517 transitions
Reduce isomorphic transitions removed 2572 transitions.
Graph (complete) has 115444 edges and 19177 vertex of which 19147 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.16 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 639 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t21243.t24021 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 415 rules applied. Total rules applied 417 place count 18507 transition count 32412
Ensure Unique test removed 1 places
Reduce places removed 414 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 1 with 1201 rules applied. Total rules applied 1618 place count 18093 transition count 31625
Ensure Unique test removed 1 places
Reduce places removed 394 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 374 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 2 with 1092 rules applied. Total rules applied 2710 place count 17699 transition count 30927
Ensure Unique test removed 48 places
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 305 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 3 with 980 rules applied. Total rules applied 3690 place count 17327 transition count 30319
Ensure Unique test removed 2 places
Reduce places removed 305 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 284 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 4 with 831 rules applied. Total rules applied 4521 place count 17022 transition count 29793
Ensure Unique test removed 40 places
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 5 with 726 rules applied. Total rules applied 5247 place count 16740 transition count 29349
Ensure Unique test removed 2 places
Reduce places removed 223 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 202 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 6 with 593 rules applied. Total rules applied 5840 place count 16517 transition count 28979
Ensure Unique test removed 32 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 7 with 496 rules applied. Total rules applied 6336 place count 16317 transition count 28683
Ensure Unique test removed 2 places
Reduce places removed 149 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 8 with 379 rules applied. Total rules applied 6715 place count 16168 transition count 28453
Ensure Unique test removed 24 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 9 with 290 rules applied. Total rules applied 7005 place count 16042 transition count 28289
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 10 with 189 rules applied. Total rules applied 7194 place count 15959 transition count 28183
Ensure Unique test removed 16 places
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 11 with 108 rules applied. Total rules applied 7302 place count 15899 transition count 28135
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 12 with 61 rules applied. Total rules applied 7363 place count 15874 transition count 28099
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 13 with 47 rules applied. Total rules applied 7410 place count 15851 transition count 28075
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 29 rules applied. Total rules applied 7439 place count 15838 transition count 28059
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 15 with 19 rules applied. Total rules applied 7458 place count 15827 transition count 28051
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 7467 place count 15822 transition count 28047
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 17 with 16 rules applied. Total rules applied 7483 place count 15819 transition count 28034
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 7496 place count 15806 transition count 28034
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 660 Pre rules applied. Total rules applied 7496 place count 15806 transition count 27374
Deduced a syphon composed of 660 places in 21 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 19 with 1320 rules applied. Total rules applied 8816 place count 15146 transition count 27374
Performed 2501 Post agglomeration using F-continuation condition.Transition count delta: 2501
Deduced a syphon composed of 2501 places in 12 ms
Reduce places removed 2501 places and 0 transitions.
Iterating global reduction 19 with 5002 rules applied. Total rules applied 13818 place count 12645 transition count 24873
Drop transitions removed 2435 transitions
Reduce isomorphic transitions removed 2435 transitions.
Iterating post reduction 19 with 2435 rules applied. Total rules applied 16253 place count 12645 transition count 22438
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 16254 place count 12645 transition count 22438
Partial Post-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 20 with 31 rules applied. Total rules applied 16285 place count 12645 transition count 22438
Applied a total of 16285 rules in 98999 ms. Remains 12645 /19208 variables (removed 6563) and now considering 22438/35399 (removed 12961) transitions.
Running SMT prover for 2 properties.
[2023-03-24 06:23:36] [INFO ] Flow matrix only has 22182 transitions (discarded 256 similar events)
// Phase 1: matrix 22182 rows 12645 cols
[2023-03-24 06:23:48] [INFO ] Computed 973 place invariants in 12175 ms
[2023-03-24 06:23:49] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-24 06:23:50] [INFO ] [Real]Absence check using 4 positive and 969 generalized place invariants in 420 ms returned sat
[2023-03-24 06:23:50] [INFO ] After 2100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 06:23:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2023-03-24 06:23:52] [INFO ] [Nat]Absence check using 4 positive and 969 generalized place invariants in 438 ms returned sat
[2023-03-24 06:24:53] [INFO ] After 60720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 06:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:24:54] [INFO ] After 1138ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 06:24:56] [INFO ] After 3109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1153 ms.
[2023-03-24 06:24:57] [INFO ] After 67077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 637 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), p0]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), p0]
[2023-03-24 06:24:58] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:25:03] [INFO ] Computed 1837 place invariants in 5220 ms
Could not prove EG (NOT p2)
Support contains 4 out of 20781 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Applied a total of 0 rules in 1845 ms. Remains 20781 /20781 variables (removed 0) and now considering 36972/36972 (removed 0) transitions.
[2023-03-24 06:25:20] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:25:20] [INFO ] Invariant cache hit.
[2023-03-24 06:25:22] [INFO ] Implicit Places using invariants in 1628 ms returned []
Implicit Place search using SMT only with invariants took 1630 ms to find 0 implicit places.
[2023-03-24 06:25:22] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:25:22] [INFO ] Invariant cache hit.
[2023-03-24 06:25:23] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5092 ms. Remains : 20781/20781 places, 36972/36972 transitions.
Computed a total of 14797 stabilizing places and 25035 stable transitions
Computed a total of 14797 stabilizing places and 25035 stable transitions
Detected a total of 14797/20781 stabilizing places and 25035/36972 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), p0]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6969 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6969 steps, saw 3465 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:25:28] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
[2023-03-24 06:25:28] [INFO ] Invariant cache hit.
[2023-03-24 06:25:30] [INFO ] [Real]Absence check using 63 positive place invariants in 156 ms returned sat
[2023-03-24 06:25:32] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1273 ms returned sat
[2023-03-24 06:25:53] [INFO ] After 20486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:25:53] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:25:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:25:53] [INFO ] After 25169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20781 transition count 36971
Deduced a syphon composed of 1 places in 53 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20780 transition count 36971
Free-agglomeration rule (complex) applied 1572 times.
Iterating global reduction 0 with 1572 rules applied. Total rules applied 1574 place count 20780 transition count 35399
Reduce places removed 1572 places and 0 transitions.
Iterating post reduction 0 with 1572 rules applied. Total rules applied 3146 place count 19208 transition count 35399
Applied a total of 3146 rules in 5806 ms. Remains 19208 /20781 variables (removed 1573) and now considering 35399/36972 (removed 1573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5806 ms. Remains : 19208/20781 places, 35399/36972 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1185 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7824 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7824 steps, saw 3798 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:26:03] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
// Phase 1: matrix 33845 rows 19208 cols
[2023-03-24 06:26:15] [INFO ] Computed 1837 place invariants in 12226 ms
[2023-03-24 06:26:18] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2023-03-24 06:26:19] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1245 ms returned sat
[2023-03-24 06:26:40] [INFO ] After 20709ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 06:26:41] [INFO ] State equation strengthened by 15490 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:26:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:26:41] [INFO ] After 25396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1326 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1326 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Applied a total of 0 rules in 1296 ms. Remains 19208 /19208 variables (removed 0) and now considering 35399/35399 (removed 0) transitions.
[2023-03-24 06:26:43] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:26:43] [INFO ] Invariant cache hit.
[2023-03-24 06:26:45] [INFO ] Implicit Places using invariants in 1523 ms returned []
Implicit Place search using SMT only with invariants took 1525 ms to find 0 implicit places.
[2023-03-24 06:26:45] [INFO ] Flow matrix only has 33845 transitions (discarded 1554 similar events)
[2023-03-24 06:26:45] [INFO ] Invariant cache hit.
[2023-03-24 06:26:46] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4347 ms. Remains : 19208/19208 places, 35399/35399 transitions.
Graph (trivial) has 7321 edges and 19208 vertex of which 32 / 19208 are part of one of the 1 SCC in 6 ms
Free SCC test removed 31 places
Drop transitions removed 1055 transitions
Ensure Unique test removed 1517 transitions
Reduce isomorphic transitions removed 2572 transitions.
Graph (complete) has 115444 edges and 19177 vertex of which 19147 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.17 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 639 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t21243.t24021 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 415 rules applied. Total rules applied 417 place count 18507 transition count 32412
Ensure Unique test removed 1 places
Reduce places removed 414 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 1 with 1201 rules applied. Total rules applied 1618 place count 18093 transition count 31625
Ensure Unique test removed 1 places
Reduce places removed 394 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 374 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 2 with 1092 rules applied. Total rules applied 2710 place count 17699 transition count 30927
Ensure Unique test removed 48 places
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 305 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 3 with 980 rules applied. Total rules applied 3690 place count 17327 transition count 30319
Ensure Unique test removed 2 places
Reduce places removed 305 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 284 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 4 with 831 rules applied. Total rules applied 4521 place count 17022 transition count 29793
Ensure Unique test removed 40 places
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 5 with 726 rules applied. Total rules applied 5247 place count 16740 transition count 29349
Ensure Unique test removed 2 places
Reduce places removed 223 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 202 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 6 with 593 rules applied. Total rules applied 5840 place count 16517 transition count 28979
Ensure Unique test removed 32 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 7 with 496 rules applied. Total rules applied 6336 place count 16317 transition count 28683
Ensure Unique test removed 2 places
Reduce places removed 149 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 8 with 379 rules applied. Total rules applied 6715 place count 16168 transition count 28453
Ensure Unique test removed 24 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 9 with 290 rules applied. Total rules applied 7005 place count 16042 transition count 28289
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 10 with 189 rules applied. Total rules applied 7194 place count 15959 transition count 28183
Ensure Unique test removed 16 places
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 11 with 108 rules applied. Total rules applied 7302 place count 15899 transition count 28135
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 12 with 61 rules applied. Total rules applied 7363 place count 15874 transition count 28099
Ensure Unique test removed 10 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 13 with 47 rules applied. Total rules applied 7410 place count 15851 transition count 28075
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 29 rules applied. Total rules applied 7439 place count 15838 transition count 28059
Ensure Unique test removed 6 places
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 15 with 19 rules applied. Total rules applied 7458 place count 15827 transition count 28051
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 7467 place count 15822 transition count 28047
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 17 with 16 rules applied. Total rules applied 7483 place count 15819 transition count 28034
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 7496 place count 15806 transition count 28034
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 660 Pre rules applied. Total rules applied 7496 place count 15806 transition count 27374
Deduced a syphon composed of 660 places in 22 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 19 with 1320 rules applied. Total rules applied 8816 place count 15146 transition count 27374
Performed 2501 Post agglomeration using F-continuation condition.Transition count delta: 2501
Deduced a syphon composed of 2501 places in 12 ms
Reduce places removed 2501 places and 0 transitions.
Iterating global reduction 19 with 5002 rules applied. Total rules applied 13818 place count 12645 transition count 24873
Drop transitions removed 2435 transitions
Reduce isomorphic transitions removed 2435 transitions.
Iterating post reduction 19 with 2435 rules applied. Total rules applied 16253 place count 12645 transition count 22438
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 16254 place count 12645 transition count 22438
Partial Post-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 20 with 31 rules applied. Total rules applied 16285 place count 12645 transition count 22438
Applied a total of 16285 rules in 97865 ms. Remains 12645 /19208 variables (removed 6563) and now considering 22438/35399 (removed 12961) transitions.
Running SMT prover for 2 properties.
[2023-03-24 06:28:24] [INFO ] Flow matrix only has 22182 transitions (discarded 256 similar events)
// Phase 1: matrix 22182 rows 12645 cols
[2023-03-24 06:28:37] [INFO ] Computed 973 place invariants in 12217 ms
[2023-03-24 06:28:38] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2023-03-24 06:28:38] [INFO ] [Real]Absence check using 4 positive and 969 generalized place invariants in 435 ms returned sat
[2023-03-24 06:28:39] [INFO ] After 2135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 06:28:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-24 06:28:41] [INFO ] [Nat]Absence check using 4 positive and 969 generalized place invariants in 471 ms returned sat
[2023-03-24 06:29:42] [INFO ] After 61524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 06:29:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:29:43] [INFO ] After 1113ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 06:29:45] [INFO ] After 3065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1128 ms.
[2023-03-24 06:29:47] [INFO ] After 67864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), p0]
[2023-03-24 06:29:47] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2023-03-24 06:29:52] [INFO ] Computed 1837 place invariants in 5052 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), p0]
Product exploration explored 100000 steps with 1221 reset in 2751 ms.
Product exploration explored 100000 steps with 1222 reset in 2790 ms.
Built C files in :
/tmp/ltsmin2733600720098900126
[2023-03-24 06:30:13] [INFO ] Too many transitions (36972) to apply POR reductions. Disabling POR matrices.
[2023-03-24 06:30:13] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2733600720098900126
Running compilation step : cd /tmp/ltsmin2733600720098900126;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2733600720098900126;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2733600720098900126;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 20781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20781/20781 places, 36972/36972 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20781 transition count 36971
Deduced a syphon composed of 1 places in 48 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20780 transition count 36971
Applied a total of 2 rules in 2004 ms. Remains 20780 /20781 variables (removed 1) and now considering 36971/36972 (removed 1) transitions.
[2023-03-24 06:30:18] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2023-03-24 06:30:23] [INFO ] Computed 1837 place invariants in 5259 ms
[2023-03-24 06:30:25] [INFO ] Implicit Places using invariants in 6852 ms returned []
Implicit Place search using SMT only with invariants took 6853 ms to find 0 implicit places.
[2023-03-24 06:30:25] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
[2023-03-24 06:30:25] [INFO ] Invariant cache hit.
[2023-03-24 06:30:27] [INFO ] Dead Transitions using invariants and state equation in 1599 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/20781 places, 36971/36972 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10458 ms. Remains : 20780/20781 places, 36971/36972 transitions.
Built C files in :
/tmp/ltsmin5873134077384756587
[2023-03-24 06:30:27] [INFO ] Too many transitions (36971) to apply POR reductions. Disabling POR matrices.
[2023-03-24 06:30:27] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5873134077384756587
Running compilation step : cd /tmp/ltsmin5873134077384756587;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5873134077384756587;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5873134077384756587;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-24 06:30:31] [INFO ] Flatten gal took : 817 ms
[2023-03-24 06:30:32] [INFO ] Flatten gal took : 841 ms
[2023-03-24 06:30:32] [INFO ] Time to serialize gal into /tmp/LTL3953975002065994051.gal : 160 ms
[2023-03-24 06:30:32] [INFO ] Time to serialize properties into /tmp/LTL6135865255353887494.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3953975002065994051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3338998470225438874.hoa' '-atoms' '/tmp/LTL6135865255353887494.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...317
Loading property file /tmp/LTL6135865255353887494.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3338998470225438874.hoa
Detected timeout of ITS tools.
[2023-03-24 06:30:49] [INFO ] Flatten gal took : 823 ms
[2023-03-24 06:30:50] [INFO ] Flatten gal took : 744 ms
[2023-03-24 06:30:50] [INFO ] Time to serialize gal into /tmp/LTL6014702996539837919.gal : 157 ms
[2023-03-24 06:30:50] [INFO ] Time to serialize properties into /tmp/LTL2453181433798852646.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/LTL6014702996539837919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2453181433798852646.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G(((!("((Node11ManageTheCrashOfNode25>=1)&&(Rx7IsAtTheRightExtremityOfTheLeafSet>=1))"))||(G(!("((Node30HasAskedItsLeafSetToRx0T...466
Formula 0 simplified : GF(("((Node11ManageTheCrashOfNode25>=1)&&(Rx7IsAtTheRightExtremityOfTheLeafSet>=1))" & F"((Node30HasAskedItsLeafSetToRx0ToReplaceNod...439
Detected timeout of ITS tools.
[2023-03-24 06:31:06] [INFO ] Flatten gal took : 814 ms
[2023-03-24 06:31:06] [INFO ] Applying decomposition
[2023-03-24 06:31:07] [INFO ] Flatten gal took : 850 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/graph16859721193513167170.txt' '-o' '/tmp/graph16859721193513167170.bin' '-w' '/tmp/graph16859721193513167170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16859721193513167170.bin' '-l' '-1' '-v' '-w' '/tmp/graph16859721193513167170.weights' '-q' '0' '-e' '0.001'
[2023-03-24 06:31:09] [INFO ] Decomposing Gal with order
[2023-03-24 06:31:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 06:31:25] [INFO ] Removed a total of 28589 redundant transitions.
[2023-03-24 06:31:25] [INFO ] Flatten gal took : 7752 ms
[2023-03-24 06:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 9545 labels/synchronizations in 1755 ms.
[2023-03-24 06:31:29] [INFO ] Time to serialize gal into /tmp/LTL14806760847289357689.gal : 221 ms
[2023-03-24 06:31:29] [INFO ] Time to serialize properties into /tmp/LTL9180732166569533864.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/LTL14806760847289357689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9180732166569533864.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G(((!("((i14.i1.u670.Node11ManageTheCrashOfNode25>=1)&&(i14.i0.u652.Rx7IsAtTheRightExtremityOfTheLeafSet>=1))"))||(G(!("((i6.u66...571
Formula 0 simplified : GF(("((i14.i1.u670.Node11ManageTheCrashOfNode25>=1)&&(i14.i0.u652.Rx7IsAtTheRightExtremityOfTheLeafSet>=1))" & F"((i6.u664.Node30Has...544
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9956644310661533316
[2023-03-24 06:31:45] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9956644310661533316
Running compilation step : cd /tmp/ltsmin9956644310661533316;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9956644310661533316;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9956644310661533316;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 finished in 694783 ms.
[2023-03-24 06:31:49] [INFO ] Flatten gal took : 1202 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5920970684603807713
[2023-03-24 06:31:50] [INFO ] Too many transitions (48223) to apply POR reductions. Disabling POR matrices.
[2023-03-24 06:31:50] [INFO ] Built C files in 498ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5920970684603807713
Running compilation step : cd /tmp/ltsmin5920970684603807713;'/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-24 06:31:50] [INFO ] Applying decomposition
[2023-03-24 06:31:52] [INFO ] Flatten gal took : 1268 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/graph6734859210536651724.txt' '-o' '/tmp/graph6734859210536651724.bin' '-w' '/tmp/graph6734859210536651724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6734859210536651724.bin' '-l' '-1' '-v' '-w' '/tmp/graph6734859210536651724.weights' '-q' '0' '-e' '0.001'
[2023-03-24 06:31:55] [INFO ] Decomposing Gal with order
[2023-03-24 06:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 06:32:18] [INFO ] Removed a total of 32491 redundant transitions.
[2023-03-24 06:32:19] [INFO ] Flatten gal took : 6792 ms
[2023-03-24 06:32:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 3291 labels/synchronizations in 1447 ms.
[2023-03-24 06:32:22] [INFO ] Time to serialize gal into /tmp/LTLFireability2636703400857557829.gal : 266 ms
[2023-03-24 06:32:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17908144889594889493.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/LTLFireability2636703400857557829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17908144889594889493.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 : !(((F(G(((!("((i18.u44.Node11ManageTheCrashOfNode25>=1)&&(i10.u697.Rx7IsAtTheRightExtremityOfTheLeafSet>=1))"))||(G(!("((i18.u710.Node...547
Formula 0 simplified : GF(("((i18.u44.Node11ManageTheCrashOfNode25>=1)&&(i10.u697.Rx7IsAtTheRightExtremityOfTheLeafSet>=1))" & F"((i18.u710.Node30HasAskedI...520
BK_STOP 1679639962708
--------------------
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="MultiCrashLeafsetExtension-PT-S32C10"
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 MultiCrashLeafsetExtension-PT-S32C10, 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 r229-tall-167856414000956"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C10.tgz
mv MultiCrashLeafsetExtension-PT-S32C10 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 ;