About the Execution of ITS-Tools for DatabaseWithMutex-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16224.296 | 3600000.00 | 6004261.00 | 276323.80 | TFFFTFTFTFFFF?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772200531.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DatabaseWithMutex-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772200531
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 27K May 10 09:33 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 DatabaseWithMutex-COL-10-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-COL-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652614450179
Running Version 202205111006
[2022-05-15 11:34:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 11:34:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 11:34:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 11:34:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 11:34:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2022-05-15 11:34:12] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 11:34:12] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 8 ms.
[2022-05-15 11:34:12] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 11 cols
[2022-05-15 11:34:12] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 11:34:12] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:34:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2022-05-15 11:34:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-15 11:34:12] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2022-05-15 11:34:12] [INFO ] Flatten gal took : 14 ms
[2022-05-15 11:34:12] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2022-05-15 11:34:12] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 24 ms.
[2022-05-15 11:34:12] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 830 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:12] [INFO ] Computed 130 place invariants in 32 ms
[2022-05-15 11:34:13] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:13] [INFO ] Computed 130 place invariants in 30 ms
[2022-05-15 11:34:13] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:13] [INFO ] Computed 130 place invariants in 15 ms
[2022-05-15 11:34:14] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Support contains 830 out of 830 places after structural reductions.
[2022-05-15 11:34:14] [INFO ] Flatten gal took : 95 ms
[2022-05-15 11:34:14] [INFO ] Flatten gal took : 84 ms
[2022-05-15 11:34:14] [INFO ] Input system was already deterministic with 800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:14] [INFO ] Computed 130 place invariants in 15 ms
[2022-05-15 11:34:14] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 11:34:14] [INFO ] [Nat]Absence check using 29 positive place invariants in 10 ms returned sat
[2022-05-15 11:34:14] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 46 ms returned sat
[2022-05-15 11:34:14] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(F((X(p0) U p1)))&&(true U p2)))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 47 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:15] [INFO ] Computed 130 place invariants in 6 ms
[2022-05-15 11:34:15] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:15] [INFO ] Computed 130 place invariants in 6 ms
[2022-05-15 11:34:15] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:15] [INFO ] Computed 130 place invariants in 11 ms
[2022-05-15 11:34:16] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109)), p1:(LEQ (ADD s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s12...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 908 ms.
Product exploration explored 100000 steps with 33333 reset in 830 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-00 finished in 3499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&X(G(p1))))'
Support contains 220 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 28 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:34:18] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:34:19] [INFO ] Implicit Places using invariants in 460 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 472 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ (ADD s520 s521 s522 s523 s524 s525 s526 s527 s528 s529) (ADD s110 s111 s112 s113 s114 s115 s116 s117 s118 s119)), p0:(GT (ADD s120 s121 s122 s123 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 3 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-01 finished in 646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(X(G(p1)))))'
Support contains 200 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 700
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 730 transition count 700
Applied a total of 200 rules in 72 ms. Remains 730 /830 variables (removed 100) and now considering 700/800 (removed 100) transitions.
// Phase 1: matrix 700 rows 730 cols
[2022-05-15 11:34:19] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 11:34:19] [INFO ] Implicit Places using invariants in 524 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 541 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/830 places, 700/800 transitions.
Applied a total of 0 rules in 21 ms. Remains 630 /630 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 630/830 places, 700/800 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 613 ms.
Product exploration explored 100000 steps with 0 reset in 838 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
// Phase 1: matrix 700 rows 630 cols
[2022-05-15 11:34:21] [INFO ] Computed 30 place invariants in 15 ms
[2022-05-15 11:34:22] [INFO ] [Real]Absence check using 27 positive place invariants in 136 ms returned sat
[2022-05-15 11:34:22] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 23 ms returned sat
[2022-05-15 11:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:34:23] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2022-05-15 11:34:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:34:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 96 ms returned sat
[2022-05-15 11:34:24] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 75 ms returned sat
[2022-05-15 11:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:34:26] [INFO ] [Nat]Absence check using state equation in 2015 ms returned sat
[2022-05-15 11:34:26] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2022-05-15 11:34:26] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-15 11:34:27] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2022-05-15 11:34:28] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2022-05-15 11:34:28] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-15 11:34:28] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2022-05-15 11:34:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1840 ms
[2022-05-15 11:34:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1840 ms
[2022-05-15 11:34:28] [INFO ] Computed and/alt/rep : 600/2200/600 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-15 11:34:33] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-05-15 11:34:33] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-15 11:34:33] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2022-05-15 11:34:33] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:34:33] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2022-05-15 11:34:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1706 ms
[2022-05-15 11:34:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1706 ms
[2022-05-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2022-05-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:34:35] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-15 11:34:36] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-15 11:34:36] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:34:36] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:34:38] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:34:38] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-15 11:34:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-15 11:34:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3496 ms
[2022-05-15 11:34:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3496 ms
[2022-05-15 11:34:39] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:34:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 100 out of 630 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 : 630/630 places, 700/700 transitions.
Applied a total of 0 rules in 19 ms. Remains 630 /630 variables (removed 0) and now considering 700/700 (removed 0) transitions.
// Phase 1: matrix 700 rows 630 cols
[2022-05-15 11:34:39] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-15 11:34:39] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 700 rows 630 cols
[2022-05-15 11:34:39] [INFO ] Computed 30 place invariants in 12 ms
[2022-05-15 11:34:40] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2022-05-15 11:34:40] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 700 rows 630 cols
[2022-05-15 11:34:40] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-15 11:34:41] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 630/630 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
// Phase 1: matrix 700 rows 630 cols
[2022-05-15 11:34:41] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-15 11:34:42] [INFO ] [Real]Absence check using 27 positive place invariants in 124 ms returned sat
[2022-05-15 11:34:42] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 22 ms returned sat
[2022-05-15 11:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:34:43] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2022-05-15 11:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:34:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 101 ms returned sat
[2022-05-15 11:34:44] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 77 ms returned sat
[2022-05-15 11:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:34:46] [INFO ] [Nat]Absence check using state equation in 2081 ms returned sat
[2022-05-15 11:34:46] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 4 ms to minimize.
[2022-05-15 11:34:46] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-15 11:34:46] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:34:47] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2022-05-15 11:34:48] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-15 11:34:48] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-15 11:34:48] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1751 ms
[2022-05-15 11:34:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1751 ms
[2022-05-15 11:34:48] [INFO ] Computed and/alt/rep : 600/2200/600 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:34:53] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 3 ms to minimize.
[2022-05-15 11:34:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1755 ms
[2022-05-15 11:34:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1755 ms
[2022-05-15 11:34:55] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2022-05-15 11:34:55] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-05-15 11:34:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-15 11:34:55] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:34:55] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2022-05-15 11:34:56] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-15 11:34:56] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-15 11:34:56] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-05-15 11:34:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:34:58] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-15 11:34:58] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 4 ms to minimize.
[2022-05-15 11:34:58] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3622 ms
[2022-05-15 11:34:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3622 ms
[2022-05-15 11:34:58] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:34:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 608 ms.
Product exploration explored 100000 steps with 0 reset in 712 ms.
Built C files in :
/tmp/ltsmin5892185637475874415
[2022-05-15 11:35:00] [INFO ] Computing symmetric may disable matrix : 700 transitions.
[2022-05-15 11:35:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:35:00] [INFO ] Computing symmetric may enable matrix : 700 transitions.
[2022-05-15 11:35:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:35:00] [INFO ] Computing Do-Not-Accords matrix : 700 transitions.
[2022-05-15 11:35:00] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:35:00] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5892185637475874415
Running compilation step : cd /tmp/ltsmin5892185637475874415;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2016 ms.
Running link step : cd /tmp/ltsmin5892185637475874415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5892185637475874415;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16127850318832355737.hoa' '--buchi-type=spotba'
LTSmin run took 2837 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-03 finished in 46208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 610 place count 520 transition count 400
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Applied a total of 810 rules in 44 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
// Phase 1: matrix 400 rows 420 cols
[2022-05-15 11:35:05] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 11:35:06] [INFO ] Implicit Places using invariants in 732 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
[2022-05-15 11:35:06] [INFO ] Actually due to overlaps returned [120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 736 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/830 places, 400/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 320 transition count 300
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 220 transition count 300
Applied a total of 200 rules in 11 ms. Remains 220 /320 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:35:06] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 11:35:06] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 11:35:06] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 11:35:06] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 220/830 places, 300/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 496 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7973 reset in 462 ms.
Stack based approach found an accepted trace after 1861 steps with 150 reset with depth 10 and stack size 10 in 9 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-05 finished in 1974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((X(p1)||p1))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:07] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 11:35:07] [INFO ] Implicit Places using invariants in 540 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 542 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s556 s557 s...], nbAcceptance=1, 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 2857 reset in 753 ms.
Product exploration explored 100000 steps with 2849 reset in 765 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 4 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 4 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:35:10] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-15 11:35:11] [INFO ] [Real]Absence check using 26 positive place invariants in 108 ms returned sat
[2022-05-15 11:35:11] [INFO ] [Real]Absence check using 26 positive and 4 generalized place invariants in 23 ms returned sat
[2022-05-15 11:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:35:15] [INFO ] [Real]Absence check using state equation in 3846 ms returned sat
[2022-05-15 11:35:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:35:15] [INFO ] [Nat]Absence check using 26 positive place invariants in 48 ms returned sat
[2022-05-15 11:35:15] [INFO ] [Nat]Absence check using 26 positive and 4 generalized place invariants in 15 ms returned sat
[2022-05-15 11:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:35:19] [INFO ] [Nat]Absence check using state equation in 3493 ms returned sat
[2022-05-15 11:35:19] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2022-05-15 11:35:19] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 0 ms to minimize.
[2022-05-15 11:35:20] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 0 ms to minimize.
[2022-05-15 11:35:20] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 0 ms to minimize.
[2022-05-15 11:35:20] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2022-05-15 11:35:20] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2022-05-15 11:35:21] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 0 ms to minimize.
[2022-05-15 11:35:21] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2022-05-15 11:35:21] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2022-05-15 11:35:21] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-05-15 11:35:22] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2022-05-15 11:35:22] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-15 11:35:22] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-15 11:35:22] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-05-15 11:35:22] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2022-05-15 11:35:23] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2022-05-15 11:35:23] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2022-05-15 11:35:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4145 ms
[2022-05-15 11:35:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4145 ms
[2022-05-15 11:35:23] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 45 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:35:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 210 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 6 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:35:30] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-15 11:35:30] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:35:30] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-15 11:35:31] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:35:31] [INFO ] Computed 30 place invariants in 37 ms
[2022-05-15 11:35:32] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 4 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 49 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 4 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 11:35:33] [INFO ] Computed 30 place invariants in 21 ms
[2022-05-15 11:35:33] [INFO ] [Real]Absence check using 26 positive place invariants in 101 ms returned sat
[2022-05-15 11:35:33] [INFO ] [Real]Absence check using 26 positive and 4 generalized place invariants in 22 ms returned sat
[2022-05-15 11:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:35:37] [INFO ] [Real]Absence check using state equation in 3831 ms returned sat
[2022-05-15 11:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:35:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 45 ms returned sat
[2022-05-15 11:35:38] [INFO ] [Nat]Absence check using 26 positive and 4 generalized place invariants in 15 ms returned sat
[2022-05-15 11:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:35:41] [INFO ] [Nat]Absence check using state equation in 3522 ms returned sat
[2022-05-15 11:35:41] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2022-05-15 11:35:42] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 0 ms to minimize.
[2022-05-15 11:35:42] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2022-05-15 11:35:42] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2022-05-15 11:35:42] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 0 ms to minimize.
[2022-05-15 11:35:43] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 1 ms to minimize.
[2022-05-15 11:35:43] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2022-05-15 11:35:43] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-15 11:35:43] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2022-05-15 11:35:44] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-15 11:35:44] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-05-15 11:35:44] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2022-05-15 11:35:44] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-15 11:35:45] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-15 11:35:45] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2022-05-15 11:35:45] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2022-05-15 11:35:45] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2022-05-15 11:35:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4165 ms
[2022-05-15 11:35:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4166 ms
[2022-05-15 11:35:45] [INFO ] Computed and/alt/rep : 700/2300/700 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-15 11:35:52] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:35:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2845 reset in 734 ms.
Product exploration explored 100000 steps with 2833 reset in 757 ms.
Built C files in :
/tmp/ltsmin10130982143004189157
[2022-05-15 11:35:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10130982143004189157
Running compilation step : cd /tmp/ltsmin10130982143004189157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1416 ms.
Running link step : cd /tmp/ltsmin10130982143004189157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10130982143004189157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6626012062271121834.hoa' '--buchi-type=spotba'
LTSmin run took 1497 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-07 finished in 50336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 200 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:57] [INFO ] Computed 130 place invariants in 6 ms
[2022-05-15 11:35:58] [INFO ] Implicit Places using invariants in 426 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 427 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-10 finished in 542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 130 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:58] [INFO ] Computed 130 place invariants in 13 ms
[2022-05-15 11:35:58] [INFO ] Implicit Places using invariants in 516 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 517 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], 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 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-11 finished in 737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(!X(p0)) U X(p1))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 11:35:59] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 11:35:59] [INFO ] Implicit Places using invariants in 517 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 519 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, p1, (AND p1 (NOT p0)), p1, p1]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(LEQ 3 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18683 steps with 4670 reset in 152 ms.
FORMULA DatabaseWithMutex-COL-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-12 finished in 1031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(G(p0))&&G(F(p1)))))))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 730 transition count 600
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 38 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2022-05-15 11:36:00] [INFO ] Computed 130 place invariants in 4 ms
[2022-05-15 11:36:00] [INFO ] Implicit Places using invariants in 337 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 338 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/830 places, 600/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 530/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s320 s321 s322 s323 s324 s325 s326 s327 s328 s329)), p1:(OR (GT 2 (ADD s320 s321 s322 s323 s324 s325 s326 s327 s328 s329)) (LEQ 2 (ADD s220...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3141 reset in 600 ms.
Product exploration explored 100000 steps with 3142 reset in 629 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 31 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:02] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:36:03] [INFO ] [Real]Absence check using 27 positive place invariants in 60 ms returned sat
[2022-05-15 11:36:03] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 16 ms returned sat
[2022-05-15 11:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:05] [INFO ] [Real]Absence check using state equation in 1702 ms returned sat
[2022-05-15 11:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:36:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 31 ms returned sat
[2022-05-15 11:36:06] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 35 ms returned sat
[2022-05-15 11:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:07] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2022-05-15 11:36:07] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:36:07] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:36:07] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-15 11:36:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-15 11:36:07] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2022-05-15 11:36:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1682 ms
[2022-05-15 11:36:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1683 ms
[2022-05-15 11:36:08] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:36:13] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-15 11:36:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1684 ms
[2022-05-15 11:36:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1684 ms
[2022-05-15 11:36:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2022-05-15 11:36:15] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1670 ms
[2022-05-15 11:36:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1670 ms
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:36:16] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-15 11:36:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-15 11:36:18] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2022-05-15 11:36:18] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2022-05-15 11:36:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1744 ms
[2022-05-15 11:36:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1744 ms
[2022-05-15 11:36:18] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-15 11:36:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-15 11:36:18] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:36:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:36:20] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:36:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-15 11:36:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1711 ms
[2022-05-15 11:36:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1711 ms
[2022-05-15 11:36:20] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:36:20] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 20 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:36:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:20] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:36:20] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:21] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-15 11:36:21] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2022-05-15 11:36:21] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:21] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:36:22] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 486 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT p1)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:23] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-15 11:36:23] [INFO ] [Real]Absence check using 27 positive place invariants in 59 ms returned sat
[2022-05-15 11:36:23] [INFO ] [Real]Absence check using 27 positive and 3 generalized place invariants in 16 ms returned sat
[2022-05-15 11:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:25] [INFO ] [Real]Absence check using state equation in 1713 ms returned sat
[2022-05-15 11:36:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 11:36:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 29 ms returned sat
[2022-05-15 11:36:26] [INFO ] [Nat]Absence check using 27 positive and 3 generalized place invariants in 36 ms returned sat
[2022-05-15 11:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 11:36:27] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2022-05-15 11:36:27] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:36:27] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-15 11:36:27] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2022-05-15 11:36:28] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-15 11:36:29] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2022-05-15 11:36:29] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-15 11:36:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1707 ms
[2022-05-15 11:36:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1707 ms
[2022-05-15 11:36:29] [INFO ] Computed and/alt/rep : 500/2100/500 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-15 11:36:33] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2022-05-15 11:36:33] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2022-05-15 11:36:33] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-15 11:36:34] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1635 ms
[2022-05-15 11:36:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1636 ms
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-05-15 11:36:35] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:36:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1580 ms
[2022-05-15 11:36:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1580 ms
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-15 11:36:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1629 ms
[2022-05-15 11:36:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1629 ms
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-15 11:36:38] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-15 11:36:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2022-05-15 11:36:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-15 11:36:40] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-15 11:36:40] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-15 11:36:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1698 ms
[2022-05-15 11:36:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1698 ms
[2022-05-15 11:36:40] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-05-15 11:36:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 11:36:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3141 reset in 624 ms.
Product exploration explored 100000 steps with 3156 reset in 640 ms.
Built C files in :
/tmp/ltsmin4731283905345719083
[2022-05-15 11:36:42] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2022-05-15 11:36:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:42] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2022-05-15 11:36:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:42] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2022-05-15 11:36:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:42] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4731283905345719083
Running compilation step : cd /tmp/ltsmin4731283905345719083;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1501 ms.
Running link step : cd /tmp/ltsmin4731283905345719083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4731283905345719083;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16201184184536891837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 110 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 600/600 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:57] [INFO ] Computed 30 place invariants in 13 ms
[2022-05-15 11:36:57] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:57] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-15 11:36:58] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2022-05-15 11:36:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 600 rows 530 cols
[2022-05-15 11:36:58] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-15 11:36:58] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin1010618143776815964
[2022-05-15 11:36:58] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2022-05-15 11:36:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:58] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2022-05-15 11:36:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:58] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2022-05-15 11:36:58] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:36:58] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1010618143776815964
Running compilation step : cd /tmp/ltsmin1010618143776815964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1473 ms.
Running link step : cd /tmp/ltsmin1010618143776815964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1010618143776815964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14327133566930408433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 11:37:13] [INFO ] Flatten gal took : 57 ms
[2022-05-15 11:37:13] [INFO ] Flatten gal took : 49 ms
[2022-05-15 11:37:13] [INFO ] Time to serialize gal into /tmp/LTL3733036321370566008.gal : 6 ms
[2022-05-15 11:37:13] [INFO ] Time to serialize properties into /tmp/LTL14691673323500550251.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3733036321370566008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14691673323500550251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3733036...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(G("(((((all_passive_0+all_passive_1)+(all_passive_2+all_passive_3))+((all_passive_4+all_passive_5)+(all_passive_6+all_pass...2076
Formula 0 simplified : !GFG(XG"(((((all_passive_0+all_passive_1)+(all_passive_2+all_passive_3))+((all_passive_4+all_passive_5)+(all_passive_6+all_passive_7...2059
Detected timeout of ITS tools.
[2022-05-15 11:37:28] [INFO ] Flatten gal took : 42 ms
[2022-05-15 11:37:28] [INFO ] Applying decomposition
[2022-05-15 11:37:28] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11254514357210903327.txt' '-o' '/tmp/graph11254514357210903327.bin' '-w' '/tmp/graph11254514357210903327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11254514357210903327.bin' '-l' '-1' '-v' '-w' '/tmp/graph11254514357210903327.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:37:28] [INFO ] Decomposing Gal with order
[2022-05-15 11:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:37:29] [INFO ] Removed a total of 414 redundant transitions.
[2022-05-15 11:37:29] [INFO ] Flatten gal took : 192 ms
[2022-05-15 11:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2022-05-15 11:37:29] [INFO ] Time to serialize gal into /tmp/LTL15914796747145075052.gal : 11 ms
[2022-05-15 11:37:29] [INFO ] Time to serialize properties into /tmp/LTL3253939120855349413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15914796747145075052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3253939120855349413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1591479...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(G("(((((gi1.gi0.gi1.gu19.all_passive_0+gi1.gi0.gi1.gu19.all_passive_1)+(gi1.gi0.gi1.gu19.all_passive_2+gi1.gi0.gi1.gu19.al...2916
Formula 0 simplified : !GFG(XG"(((((gi1.gi0.gi1.gu19.all_passive_0+gi1.gi0.gi1.gu19.all_passive_1)+(gi1.gi0.gi1.gu19.all_passive_2+gi1.gi0.gi1.gu19.all_pas...2899
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1886733597549901170
[2022-05-15 11:37:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1886733597549901170
Running compilation step : cd /tmp/ltsmin1886733597549901170;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1060 ms.
Running link step : cd /tmp/ltsmin1886733597549901170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1886733597549901170;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-COL-10-LTLCardinality-13 finished in 119407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(G(p0))&&G(F(p1)))))))'
[2022-05-15 11:37:59] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12080246327881260098
[2022-05-15 11:37:59] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 11:37:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:59] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 11:37:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:59] [INFO ] Applying decomposition
[2022-05-15 11:37:59] [INFO ] Flatten gal took : 54 ms
[2022-05-15 11:37:59] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 11:37:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 11:37:59] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12080246327881260098
Running compilation step : cd /tmp/ltsmin12080246327881260098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6106151192043109653.txt' '-o' '/tmp/graph6106151192043109653.bin' '-w' '/tmp/graph6106151192043109653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6106151192043109653.bin' '-l' '-1' '-v' '-w' '/tmp/graph6106151192043109653.weights' '-q' '0' '-e' '0.001'
[2022-05-15 11:37:59] [INFO ] Decomposing Gal with order
[2022-05-15 11:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:37:59] [INFO ] Removed a total of 897 redundant transitions.
[2022-05-15 11:37:59] [INFO ] Flatten gal took : 151 ms
[2022-05-15 11:38:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-15 11:38:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality1814574126765484459.gal : 8 ms
[2022-05-15 11:38:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality4175878597893541678.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1814574126765484459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4175878597893541678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(G("(((((gi1.gi10.gu121.all_passive_0+gi1.gi10.gu121.all_passive_1)+(gi1.gi10.gu121.all_passive_2+gi1.gi10.gu121.all_passiv...2976
Formula 0 simplified : !GFG(XG"(((((gi1.gi10.gu121.all_passive_0+gi1.gi10.gu121.all_passive_1)+(gi1.gi10.gu121.all_passive_2+gi1.gi10.gu121.all_passive_3))...2959
Compilation finished in 2382 ms.
Running link step : cd /tmp/ltsmin12080246327881260098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin12080246327881260098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.042: LTL layer: formula: [](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.042: "[](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.043: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.573: There are 803 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.574: State length is 831, there are 807 groups
pins2lts-mc-linux64( 0/ 8), 0.574: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.574: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.574: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.574: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.442: [Blue] ~56 levels ~960 states ~15152 transitions
pins2lts-mc-linux64( 0/ 8), 1.615: [Blue] ~76 levels ~1920 states ~19784 transitions
pins2lts-mc-linux64( 0/ 8), 1.837: [Blue] ~104 levels ~3840 states ~26840 transitions
pins2lts-mc-linux64( 0/ 8), 2.651: [Blue] ~139 levels ~7680 states ~38720 transitions
pins2lts-mc-linux64( 1/ 8), 3.581: [Blue] ~158 levels ~15360 states ~46488 transitions
pins2lts-mc-linux64( 1/ 8), 5.794: [Blue] ~158 levels ~30720 states ~62600 transitions
pins2lts-mc-linux64( 4/ 8), 6.960: [Blue] ~158 levels ~61440 states ~98904 transitions
pins2lts-mc-linux64( 4/ 8), 8.925: [Blue] ~158 levels ~122880 states ~164360 transitions
pins2lts-mc-linux64( 1/ 8), 12.827: [Blue] ~158 levels ~245760 states ~292576 transitions
pins2lts-mc-linux64( 1/ 8), 20.192: [Blue] ~158 levels ~491520 states ~558912 transitions
pins2lts-mc-linux64( 1/ 8), 34.714: [Blue] ~158 levels ~983040 states ~1101384 transitions
pins2lts-mc-linux64( 5/ 8), 62.687: [Blue] ~158 levels ~1966080 states ~2179088 transitions
pins2lts-mc-linux64( 5/ 8), 118.953: [Blue] ~158 levels ~3932160 states ~4384696 transitions
pins2lts-mc-linux64( 5/ 8), 233.174: [Blue] ~158 levels ~7864320 states ~8799704 transitions
pins2lts-mc-linux64( 5/ 8), 464.184: [Blue] ~158 levels ~15728640 states ~17802648 transitions
pins2lts-mc-linux64( 1/ 8), 900.380: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 901.851:
pins2lts-mc-linux64( 0/ 8), 901.851: Explored 29046359 states 32164214 transitions, fanout: 1.107
pins2lts-mc-linux64( 0/ 8), 901.851: Total exploration time 901.260 sec (900.280 sec minimum, 900.853 sec on average)
pins2lts-mc-linux64( 0/ 8), 901.851: States per second: 32229, Transitions per second: 35688
pins2lts-mc-linux64( 0/ 8), 901.851:
pins2lts-mc-linux64( 0/ 8), 901.851: State space has 29084543 states, 29044968 are accepting
pins2lts-mc-linux64( 0/ 8), 901.851: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 901.851: blue states: 29046359 (99.87%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 901.851: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 901.851: all-red states: 29044968 (99.86%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 901.851:
pins2lts-mc-linux64( 0/ 8), 901.851: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 901.851:
pins2lts-mc-linux64( 0/ 8), 901.851: Queue width: 8B, total height: 1496, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 901.851: Tree memory: 477.9MB, 17.2 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 901.851: Tree fill ratio (roots/leafs): 21.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 901.851: Stored 847 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 901.851: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 901.851: Est. total memory use: 477.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12080246327881260098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12080246327881260098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X([]((LTLAPp0==true)))&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 11:59:17] [INFO ] Applying decomposition
[2022-05-15 11:59:17] [INFO ] Flatten gal took : 224 ms
[2022-05-15 11:59:17] [INFO ] Decomposing Gal with order
[2022-05-15 11:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 11:59:17] [INFO ] Removed a total of 2140 redundant transitions.
[2022-05-15 11:59:17] [INFO ] Flatten gal took : 169 ms
[2022-05-15 11:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2022-05-15 11:59:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality16887084921933225252.gal : 25 ms
[2022-05-15 11:59:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality7714672547703475490.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16887084921933225252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7714672547703475490.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(G("(((((gsite0.all_passive_0+gsite1.all_passive_1)+(gsite2.all_passive_2+gsite3.all_passive_3))+((gsite4.all_passive_4+gsi...3406
Formula 0 simplified : !GFG(XG"(((((gsite0.all_passive_0+gsite1.all_passive_1)+(gsite2.all_passive_2+gsite3.all_passive_3))+((gsite4.all_passive_4+gsite5.a...3389
Detected timeout of ITS tools.
[2022-05-15 12:20:36] [INFO ] Flatten gal took : 338 ms
[2022-05-15 12:20:54] [INFO ] Input system was already deterministic with 800 transitions.
[2022-05-15 12:20:54] [INFO ] Transformed 830 places.
[2022-05-15 12:20:54] [INFO ] Transformed 800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 12:21:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality509343319632470116.gal : 7 ms
[2022-05-15 12:21:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality7140228485709485055.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality509343319632470116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7140228485709485055.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...332
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G((X(G("(((((all_passive_0+all_passive_1)+(all_passive_2+all_passive_3))+((all_passive_4+all_passive_5)+(all_passive_6+all_pass...2076
Formula 0 simplified : !GFG(XG"(((((all_passive_0+all_passive_1)+(all_passive_2+all_passive_3))+((all_passive_4+all_passive_5)+(all_passive_6+all_passive_7...2059
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DatabaseWithMutex-COL-10"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772200531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-10.tgz
mv DatabaseWithMutex-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;