About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15961.472 | 3600000.00 | 12522237.00 | 9819.90 | TFFFFF?FTF??FTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413700771.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413700771
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679558264068
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 07:57:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 07:57:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:57:45] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-23 07:57:45] [INFO ] Transformed 4914 places.
[2023-03-23 07:57:46] [INFO ] Transformed 6913 transitions.
[2023-03-23 07:57:46] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1335 places :
Symmetric choice reduction at 1 with 1335 rule applications. Total rules 1365 place count 3549 transition count 5578
Iterating global reduction 1 with 1335 rules applied. Total rules applied 2700 place count 3549 transition count 5578
Discarding 1159 places :
Symmetric choice reduction at 1 with 1159 rule applications. Total rules 3859 place count 2390 transition count 4419
Iterating global reduction 1 with 1159 rules applied. Total rules applied 5018 place count 2390 transition count 4419
Discarding 207 places :
Symmetric choice reduction at 1 with 207 rule applications. Total rules 5225 place count 2183 transition count 3384
Iterating global reduction 1 with 207 rules applied. Total rules applied 5432 place count 2183 transition count 3384
Applied a total of 5432 rules in 996 ms. Remains 2183 /4914 variables (removed 2731) and now considering 3384/6913 (removed 3529) transitions.
[2023-03-23 07:57:47] [INFO ] Flow matrix only has 3112 transitions (discarded 272 similar events)
// Phase 1: matrix 3112 rows 2183 cols
[2023-03-23 07:57:47] [INFO ] Computed 505 place invariants in 145 ms
[2023-03-23 07:57:50] [INFO ] Implicit Places using invariants in 2982 ms returned [4, 8, 12, 14, 18, 20, 22, 27, 37, 46, 57, 70, 85, 101, 117, 121, 123, 125, 127, 140, 151, 160, 170, 175, 180, 203, 210, 213, 214, 216, 217, 218, 221, 229, 236, 245, 256, 269, 283, 297, 298, 299, 300, 301, 302, 313, 322, 329, 334, 337, 339, 362, 369, 372, 374, 376, 377, 381, 384, 389, 398, 407, 418, 430, 442, 443, 444, 445, 446, 447, 456, 463, 468, 471, 473, 475, 498, 505, 508, 509, 510, 511, 512, 513, 515, 517, 520, 525, 532, 541, 551, 564, 565, 566, 578, 584, 587, 589, 593, 595, 618, 625, 628, 629, 630, 631, 632, 633, 635, 637, 639, 642, 647, 654, 662, 670, 671, 672, 673, 674, 675, 680, 683, 685, 687, 689, 691, 714, 721, 725, 726, 727, 729, 731, 733, 735, 737, 743, 751, 760, 766, 767, 768, 770, 771, 774, 778, 780, 782, 784, 786, 809, 816, 819, 820, 821, 823, 824, 826, 830, 832, 834, 836, 839, 843, 849, 850, 851, 852, 853, 857, 859, 861, 863, 865, 867, 890, 897, 900, 901, 902, 903, 904, 905, 907, 909, 911, 913, 915, 919, 924, 925, 926, 927, 929, 931, 935, 940, 942, 944, 967, 969, 973, 978, 979, 980, 981, 985, 987, 989, 994, 996, 998, 1000, 1003, 1004, 1005, 1006, 1007, 1008, 1010, 1012, 1014, 1016, 1018, 1020, 1043, 1050, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1062, 1064, 1066, 1068, 1070, 1072, 1075, 1077, 1078, 1079, 1080, 1082, 1084, 1088, 1090, 1092, 1094, 1117, 1124, 1127, 1128, 1129, 1131, 1132, 1134, 1138, 1140, 1142, 1144, 1146, 1149, 1155, 1156, 1157, 1158, 1159, 1162, 1164, 1166, 1170, 1172, 1174, 1197, 1204, 1209, 1210, 1211, 1212, 1213, 1217, 1219, 1221, 1223, 1225, 1228, 1233, 1240, 1242, 1244, 1245, 1250, 1253, 1258, 1260, 1262, 1264, 1290, 1297, 1300, 1301, 1303, 1304, 1305, 1307, 1309, 1312, 1314, 1317, 1324, 1331, 1342, 1343, 1344, 1345, 1352, 1357, 1360, 1362, 1364, 1369, 1395, 1402, 1405, 1406, 1407, 1408, 1410, 1412, 1416, 1418, 1421, 1426, 1433, 1442, 1453, 1454, 1456, 1457, 1458, 1467, 1474, 1479, 1482, 1484, 1486, 1511, 1518, 1521, 1522, 1523, 1524, 1525, 1526, 1528, 1530, 1533, 1538, 1545, 1554, 1565, 1578, 1579, 1580, 1581, 1582, 1583, 1594, 1603, 1610, 1615, 1618, 1620, 1643, 1650, 1653, 1654, 1655, 1656, 1657, 1658, 1660, 1663, 1668, 1675, 1684, 1695, 1708, 1723, 1724, 1725, 1726, 1727, 1728, 1741, 1752, 1761, 1768, 1773, 1776, 1799, 1801, 1805, 1808, 1809, 1810, 1811, 1812, 1813, 1816, 1821, 1828, 1837, 1848, 1861, 1876, 1893, 1894, 1895, 1896, 1897, 1898, 1913, 1926, 1937, 1946, 1953, 1958, 1982]
Discarding 433 places :
Implicit Place search using SMT only with invariants took 3016 ms to find 433 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1750/4914 places, 3384/6913 transitions.
Discarding 131 places :
Symmetric choice reduction at 0 with 131 rule applications. Total rules 131 place count 1619 transition count 3253
Iterating global reduction 0 with 131 rules applied. Total rules applied 262 place count 1619 transition count 3253
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 392 place count 1489 transition count 3123
Iterating global reduction 0 with 130 rules applied. Total rules applied 522 place count 1489 transition count 3123
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 651 place count 1360 transition count 2994
Iterating global reduction 0 with 129 rules applied. Total rules applied 780 place count 1360 transition count 2994
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 791 place count 1349 transition count 2939
Iterating global reduction 0 with 11 rules applied. Total rules applied 802 place count 1349 transition count 2939
Applied a total of 802 rules in 299 ms. Remains 1349 /1750 variables (removed 401) and now considering 2939/3384 (removed 445) transitions.
[2023-03-23 07:57:50] [INFO ] Flow matrix only has 2667 transitions (discarded 272 similar events)
// Phase 1: matrix 2667 rows 1349 cols
[2023-03-23 07:57:50] [INFO ] Computed 72 place invariants in 67 ms
[2023-03-23 07:57:51] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-03-23 07:57:51] [INFO ] Flow matrix only has 2667 transitions (discarded 272 similar events)
[2023-03-23 07:57:51] [INFO ] Invariant cache hit.
[2023-03-23 07:57:52] [INFO ] State equation strengthened by 1034 read => feed constraints.
[2023-03-23 07:58:06] [INFO ] Implicit Places using invariants and state equation in 14877 ms returned []
Implicit Place search using SMT with State Equation took 16022 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1349/4914 places, 2939/6913 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20335 ms. Remains : 1349/4914 places, 2939/6913 transitions.
Support contains 46 out of 1349 places after structural reductions.
[2023-03-23 07:58:07] [INFO ] Flatten gal took : 278 ms
[2023-03-23 07:58:07] [INFO ] Flatten gal took : 162 ms
[2023-03-23 07:58:07] [INFO ] Input system was already deterministic with 2939 transitions.
Support contains 44 out of 1349 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-23 07:58:08] [INFO ] Flow matrix only has 2667 transitions (discarded 272 similar events)
[2023-03-23 07:58:08] [INFO ] Invariant cache hit.
[2023-03-23 07:58:08] [INFO ] [Real]Absence check using 32 positive place invariants in 36 ms returned sat
[2023-03-23 07:58:08] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 8 ms returned sat
[2023-03-23 07:58:08] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2023-03-23 07:58:09] [INFO ] [Nat]Absence check using 32 positive place invariants in 28 ms returned sat
[2023-03-23 07:58:09] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-23 07:58:11] [INFO ] After 1745ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :10
[2023-03-23 07:58:11] [INFO ] State equation strengthened by 1034 read => feed constraints.
[2023-03-23 07:58:12] [INFO ] After 1573ms SMT Verify possible using 1034 Read/Feed constraints in natural domain returned unsat :10 sat :7
[2023-03-23 07:58:13] [INFO ] Deduced a trap composed of 455 places in 639 ms of which 9 ms to minimize.
[2023-03-23 07:58:14] [INFO ] Deduced a trap composed of 390 places in 679 ms of which 2 ms to minimize.
[2023-03-23 07:58:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1560 ms
[2023-03-23 07:58:15] [INFO ] Deduced a trap composed of 212 places in 637 ms of which 2 ms to minimize.
[2023-03-23 07:58:16] [INFO ] Deduced a trap composed of 244 places in 623 ms of which 4 ms to minimize.
[2023-03-23 07:58:17] [INFO ] Deduced a trap composed of 248 places in 667 ms of which 1 ms to minimize.
[2023-03-23 07:58:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2264 ms
[2023-03-23 07:58:17] [INFO ] Deduced a trap composed of 404 places in 643 ms of which 1 ms to minimize.
[2023-03-23 07:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 817 ms
[2023-03-23 07:58:19] [INFO ] Deduced a trap composed of 225 places in 650 ms of which 2 ms to minimize.
[2023-03-23 07:58:19] [INFO ] Deduced a trap composed of 384 places in 627 ms of which 2 ms to minimize.
[2023-03-23 07:58:20] [INFO ] Deduced a trap composed of 286 places in 582 ms of which 1 ms to minimize.
[2023-03-23 07:58:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2265 ms
[2023-03-23 07:58:20] [INFO ] After 9697ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :7
Attempting to minimize the solution found.
Minimization took 1038 ms.
[2023-03-23 07:58:22] [INFO ] After 13252ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :7
Fused 17 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 12 out of 1349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1349 transition count 2919
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1329 transition count 2919
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 40 place count 1329 transition count 2886
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 106 place count 1296 transition count 2886
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 1281 transition count 2867
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 1281 transition count 2867
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 1281 transition count 2866
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 1280 transition count 2866
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 151 place count 1267 transition count 2805
Iterating global reduction 2 with 13 rules applied. Total rules applied 164 place count 1267 transition count 2805
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 226 place count 1236 transition count 2774
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 236 place count 1226 transition count 2764
Iterating global reduction 2 with 10 rules applied. Total rules applied 246 place count 1226 transition count 2764
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 256 place count 1216 transition count 2714
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 1216 transition count 2714
Free-agglomeration rule (complex) applied 158 times.
Iterating global reduction 2 with 158 rules applied. Total rules applied 424 place count 1216 transition count 3300
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 2 with 158 rules applied. Total rules applied 582 place count 1058 transition count 3300
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 608 place count 1058 transition count 3300
Applied a total of 608 rules in 794 ms. Remains 1058 /1349 variables (removed 291) and now considering 3300/2939 (removed -361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 1058/1349 places, 3300/2939 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 07:58:23] [INFO ] Flow matrix only has 2903 transitions (discarded 397 similar events)
// Phase 1: matrix 2903 rows 1058 cols
[2023-03-23 07:58:23] [INFO ] Computed 72 place invariants in 22 ms
[2023-03-23 07:58:23] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:58:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 07:58:23] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 8 ms returned sat
[2023-03-23 07:58:25] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:58:25] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2023-03-23 07:58:28] [INFO ] After 2837ms SMT Verify possible using 1686 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 07:58:29] [INFO ] Deduced a trap composed of 205 places in 484 ms of which 1 ms to minimize.
[2023-03-23 07:58:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 649 ms
[2023-03-23 07:58:30] [INFO ] Deduced a trap composed of 162 places in 502 ms of which 1 ms to minimize.
[2023-03-23 07:58:30] [INFO ] Deduced a trap composed of 111 places in 521 ms of which 1 ms to minimize.
[2023-03-23 07:58:31] [INFO ] Deduced a trap composed of 133 places in 527 ms of which 1 ms to minimize.
[2023-03-23 07:58:31] [INFO ] Deduced a trap composed of 118 places in 505 ms of which 1 ms to minimize.
[2023-03-23 07:58:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2461 ms
[2023-03-23 07:58:32] [INFO ] Deduced a trap composed of 174 places in 459 ms of which 1 ms to minimize.
[2023-03-23 07:58:33] [INFO ] Deduced a trap composed of 163 places in 440 ms of which 1 ms to minimize.
[2023-03-23 07:58:33] [INFO ] Deduced a trap composed of 164 places in 482 ms of which 1 ms to minimize.
[2023-03-23 07:58:34] [INFO ] Deduced a trap composed of 167 places in 470 ms of which 1 ms to minimize.
[2023-03-23 07:58:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2603 ms
[2023-03-23 07:58:35] [INFO ] After 9676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1609 ms.
[2023-03-23 07:58:36] [INFO ] After 13077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 14 ms.
Support contains 9 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 3300/3300 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1058 transition count 3299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1057 transition count 3299
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 1057 transition count 3299
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 1054 transition count 3296
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 1054 transition count 3296
Applied a total of 11 rules in 341 ms. Remains 1054 /1058 variables (removed 4) and now considering 3296/3300 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 1054/1058 places, 3296/3300 transitions.
Incomplete random walk after 10000 steps, including 328 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 64013 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{4=1}
Probabilistic random walk after 64013 steps, saw 27314 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-23 07:58:41] [INFO ] Flow matrix only has 2899 transitions (discarded 397 similar events)
// Phase 1: matrix 2899 rows 1054 cols
[2023-03-23 07:58:41] [INFO ] Computed 72 place invariants in 23 ms
[2023-03-23 07:58:41] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:58:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2023-03-23 07:58:41] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 6 ms returned sat
[2023-03-23 07:58:42] [INFO ] After 937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:58:42] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2023-03-23 07:58:44] [INFO ] After 2296ms SMT Verify possible using 1686 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:58:45] [INFO ] Deduced a trap composed of 182 places in 461 ms of which 1 ms to minimize.
[2023-03-23 07:58:46] [INFO ] Deduced a trap composed of 135 places in 559 ms of which 2 ms to minimize.
[2023-03-23 07:58:46] [INFO ] Deduced a trap composed of 123 places in 549 ms of which 1 ms to minimize.
[2023-03-23 07:58:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1860 ms
[2023-03-23 07:58:47] [INFO ] Deduced a trap composed of 153 places in 480 ms of which 1 ms to minimize.
[2023-03-23 07:58:48] [INFO ] Deduced a trap composed of 157 places in 457 ms of which 1 ms to minimize.
[2023-03-23 07:58:49] [INFO ] Deduced a trap composed of 158 places in 471 ms of which 1 ms to minimize.
[2023-03-23 07:58:49] [INFO ] Deduced a trap composed of 160 places in 474 ms of which 1 ms to minimize.
[2023-03-23 07:58:50] [INFO ] Deduced a trap composed of 160 places in 467 ms of which 1 ms to minimize.
[2023-03-23 07:58:51] [INFO ] Deduced a trap composed of 127 places in 469 ms of which 1 ms to minimize.
[2023-03-23 07:58:51] [INFO ] Deduced a trap composed of 159 places in 486 ms of which 0 ms to minimize.
[2023-03-23 07:58:52] [INFO ] Deduced a trap composed of 172 places in 485 ms of which 1 ms to minimize.
[2023-03-23 07:58:52] [INFO ] Deduced a trap composed of 142 places in 491 ms of which 1 ms to minimize.
[2023-03-23 07:58:53] [INFO ] Deduced a trap composed of 164 places in 479 ms of which 1 ms to minimize.
[2023-03-23 07:58:53] [INFO ] Deduced a trap composed of 161 places in 451 ms of which 5 ms to minimize.
[2023-03-23 07:58:54] [INFO ] Deduced a trap composed of 157 places in 447 ms of which 5 ms to minimize.
[2023-03-23 07:58:55] [INFO ] Deduced a trap composed of 198 places in 453 ms of which 1 ms to minimize.
[2023-03-23 07:58:55] [INFO ] Deduced a trap composed of 160 places in 439 ms of which 1 ms to minimize.
[2023-03-23 07:58:56] [INFO ] Deduced a trap composed of 163 places in 453 ms of which 1 ms to minimize.
[2023-03-23 07:58:56] [INFO ] Deduced a trap composed of 170 places in 472 ms of which 1 ms to minimize.
[2023-03-23 07:58:57] [INFO ] Deduced a trap composed of 151 places in 443 ms of which 1 ms to minimize.
[2023-03-23 07:58:58] [INFO ] Deduced a trap composed of 144 places in 463 ms of which 1 ms to minimize.
[2023-03-23 07:58:58] [INFO ] Deduced a trap composed of 165 places in 443 ms of which 1 ms to minimize.
[2023-03-23 07:58:59] [INFO ] Deduced a trap composed of 170 places in 465 ms of which 1 ms to minimize.
[2023-03-23 07:58:59] [INFO ] Deduced a trap composed of 156 places in 455 ms of which 1 ms to minimize.
[2023-03-23 07:59:00] [INFO ] Deduced a trap composed of 145 places in 446 ms of which 0 ms to minimize.
[2023-03-23 07:59:01] [INFO ] Deduced a trap composed of 167 places in 457 ms of which 1 ms to minimize.
[2023-03-23 07:59:01] [INFO ] Deduced a trap composed of 161 places in 472 ms of which 1 ms to minimize.
[2023-03-23 07:59:02] [INFO ] Deduced a trap composed of 153 places in 476 ms of which 1 ms to minimize.
[2023-03-23 07:59:02] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 15773 ms
[2023-03-23 07:59:03] [INFO ] Deduced a trap composed of 147 places in 464 ms of which 1 ms to minimize.
[2023-03-23 07:59:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 650 ms
[2023-03-23 07:59:03] [INFO ] After 21263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2570 ms.
[2023-03-23 07:59:06] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 1054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 3296/3296 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1054 transition count 3295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1053 transition count 3295
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1053 transition count 3514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1052 transition count 3514
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 1052 transition count 3514
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 1051 transition count 3513
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 1051 transition count 3513
Applied a total of 7 rules in 301 ms. Remains 1051 /1054 variables (removed 3) and now considering 3513/3296 (removed -217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 1051/1054 places, 3513/3296 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63425 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63425 steps, saw 27003 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 07:59:10] [INFO ] Flow matrix only has 3116 transitions (discarded 397 similar events)
// Phase 1: matrix 3116 rows 1051 cols
[2023-03-23 07:59:10] [INFO ] Computed 72 place invariants in 26 ms
[2023-03-23 07:59:10] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:59:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 45 ms returned sat
[2023-03-23 07:59:10] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-23 07:59:11] [INFO ] After 1016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:59:11] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 07:59:14] [INFO ] After 2565ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:59:15] [INFO ] Deduced a trap composed of 139 places in 485 ms of which 1 ms to minimize.
[2023-03-23 07:59:16] [INFO ] Deduced a trap composed of 95 places in 548 ms of which 1 ms to minimize.
[2023-03-23 07:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1255 ms
[2023-03-23 07:59:17] [INFO ] Deduced a trap composed of 164 places in 500 ms of which 1 ms to minimize.
[2023-03-23 07:59:18] [INFO ] Deduced a trap composed of 173 places in 478 ms of which 1 ms to minimize.
[2023-03-23 07:59:18] [INFO ] Deduced a trap composed of 176 places in 441 ms of which 1 ms to minimize.
[2023-03-23 07:59:19] [INFO ] Deduced a trap composed of 164 places in 451 ms of which 8 ms to minimize.
[2023-03-23 07:59:19] [INFO ] Deduced a trap composed of 159 places in 455 ms of which 1 ms to minimize.
[2023-03-23 07:59:20] [INFO ] Deduced a trap composed of 162 places in 484 ms of which 1 ms to minimize.
[2023-03-23 07:59:21] [INFO ] Deduced a trap composed of 155 places in 463 ms of which 1 ms to minimize.
[2023-03-23 07:59:21] [INFO ] Deduced a trap composed of 163 places in 459 ms of which 0 ms to minimize.
[2023-03-23 07:59:22] [INFO ] Deduced a trap composed of 162 places in 467 ms of which 1 ms to minimize.
[2023-03-23 07:59:22] [INFO ] Deduced a trap composed of 149 places in 460 ms of which 1 ms to minimize.
[2023-03-23 07:59:23] [INFO ] Deduced a trap composed of 165 places in 484 ms of which 1 ms to minimize.
[2023-03-23 07:59:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6916 ms
[2023-03-23 07:59:24] [INFO ] Deduced a trap composed of 134 places in 464 ms of which 2 ms to minimize.
[2023-03-23 07:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2023-03-23 07:59:24] [INFO ] After 12810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2192 ms.
[2023-03-23 07:59:26] [INFO ] After 16338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 1051 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1051/1051 places, 3513/3513 transitions.
Applied a total of 0 rules in 82 ms. Remains 1051 /1051 variables (removed 0) and now considering 3513/3513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1051/1051 places, 3513/3513 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1051/1051 places, 3513/3513 transitions.
Applied a total of 0 rules in 109 ms. Remains 1051 /1051 variables (removed 0) and now considering 3513/3513 (removed 0) transitions.
[2023-03-23 07:59:27] [INFO ] Flow matrix only has 3116 transitions (discarded 397 similar events)
[2023-03-23 07:59:27] [INFO ] Invariant cache hit.
[2023-03-23 07:59:28] [INFO ] Implicit Places using invariants in 1187 ms returned [7, 141, 237, 238, 346, 347, 348, 411, 451, 461, 484, 487, 488, 503, 504, 536, 552, 562, 579, 593, 594, 614, 634, 635, 690]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1210 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1026/1051 places, 3513/3513 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1007 transition count 3494
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1007 transition count 3494
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 988 transition count 3475
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 988 transition count 3475
Applied a total of 76 rules in 136 ms. Remains 988 /1026 variables (removed 38) and now considering 3475/3513 (removed 38) transitions.
[2023-03-23 07:59:28] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
// Phase 1: matrix 3078 rows 988 cols
[2023-03-23 07:59:28] [INFO ] Computed 47 place invariants in 28 ms
[2023-03-23 07:59:29] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2023-03-23 07:59:29] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
[2023-03-23 07:59:29] [INFO ] Invariant cache hit.
[2023-03-23 07:59:30] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 07:59:45] [INFO ] Implicit Places using invariants and state equation in 15668 ms returned []
Implicit Place search using SMT with State Equation took 16846 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 988/1051 places, 3475/3513 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18303 ms. Remains : 988/1051 places, 3475/3513 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68709 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68709 steps, saw 28867 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 07:59:48] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
[2023-03-23 07:59:48] [INFO ] Invariant cache hit.
[2023-03-23 07:59:48] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:59:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 07:59:49] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 07:59:50] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:59:50] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 07:59:51] [INFO ] After 1409ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:59:52] [INFO ] Deduced a trap composed of 189 places in 461 ms of which 1 ms to minimize.
[2023-03-23 07:59:53] [INFO ] Deduced a trap composed of 89 places in 515 ms of which 2 ms to minimize.
[2023-03-23 07:59:53] [INFO ] Deduced a trap composed of 96 places in 543 ms of which 3 ms to minimize.
[2023-03-23 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1822 ms
[2023-03-23 07:59:54] [INFO ] After 4164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 901 ms.
[2023-03-23 07:59:55] [INFO ] After 6391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 3475/3475 transitions.
Applied a total of 0 rules in 86 ms. Remains 988 /988 variables (removed 0) and now considering 3475/3475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 988/988 places, 3475/3475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 3475/3475 transitions.
Applied a total of 0 rules in 78 ms. Remains 988 /988 variables (removed 0) and now considering 3475/3475 (removed 0) transitions.
[2023-03-23 07:59:55] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
[2023-03-23 07:59:55] [INFO ] Invariant cache hit.
[2023-03-23 07:59:56] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2023-03-23 07:59:56] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
[2023-03-23 07:59:56] [INFO ] Invariant cache hit.
[2023-03-23 07:59:57] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:00:13] [INFO ] Implicit Places using invariants and state equation in 16613 ms returned []
Implicit Place search using SMT with State Equation took 17652 ms to find 0 implicit places.
[2023-03-23 08:00:13] [INFO ] Redundant transitions in 256 ms returned []
[2023-03-23 08:00:13] [INFO ] Flow matrix only has 3078 transitions (discarded 397 similar events)
[2023-03-23 08:00:13] [INFO ] Invariant cache hit.
[2023-03-23 08:00:14] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19200 ms. Remains : 988/988 places, 3475/3475 transitions.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 517 stabilizing places and 1306 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(p0&&F(p1))))))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1316 transition count 2902
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1316 transition count 2902
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 97 place count 1285 transition count 2811
Iterating global reduction 0 with 31 rules applied. Total rules applied 128 place count 1285 transition count 2811
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 143 place count 1270 transition count 2740
Iterating global reduction 0 with 15 rules applied. Total rules applied 158 place count 1270 transition count 2740
Applied a total of 158 rules in 137 ms. Remains 1270 /1349 variables (removed 79) and now considering 2740/2939 (removed 199) transitions.
[2023-03-23 08:00:15] [INFO ] Flow matrix only has 2468 transitions (discarded 272 similar events)
// Phase 1: matrix 2468 rows 1270 cols
[2023-03-23 08:00:15] [INFO ] Computed 72 place invariants in 32 ms
[2023-03-23 08:00:16] [INFO ] Implicit Places using invariants in 1093 ms returned [12, 101, 178, 292, 293, 424, 425, 507, 508, 529, 553, 567, 593, 597, 598, 617, 618, 655, 674, 687, 709, 727, 728, 755, 781, 816, 850]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1243/1349 places, 2740/2939 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1217 transition count 2714
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1217 transition count 2714
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 78 place count 1191 transition count 2688
Iterating global reduction 0 with 26 rules applied. Total rules applied 104 place count 1191 transition count 2688
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 130 place count 1165 transition count 2662
Iterating global reduction 0 with 26 rules applied. Total rules applied 156 place count 1165 transition count 2662
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 174 place count 1147 transition count 2572
Iterating global reduction 0 with 18 rules applied. Total rules applied 192 place count 1147 transition count 2572
Applied a total of 192 rules in 166 ms. Remains 1147 /1243 variables (removed 96) and now considering 2572/2740 (removed 168) transitions.
[2023-03-23 08:00:16] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2023-03-23 08:00:16] [INFO ] Computed 45 place invariants in 25 ms
[2023-03-23 08:00:17] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-23 08:00:17] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2023-03-23 08:00:17] [INFO ] Invariant cache hit.
[2023-03-23 08:00:18] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 08:00:27] [INFO ] Implicit Places using invariants and state equation in 10212 ms returned [1117]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1349 places, 2572/2939 transitions.
Applied a total of 0 rules in 32 ms. Remains 1146 /1146 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12627 ms. Remains : 1146/1349 places, 2572/2939 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 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:(GT 1 s715)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 5148 steps with 99 reset in 77 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 finished in 13099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1315 transition count 2901
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1315 transition count 2901
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 100 place count 1283 transition count 2805
Iterating global reduction 0 with 32 rules applied. Total rules applied 132 place count 1283 transition count 2805
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 147 place count 1268 transition count 2734
Iterating global reduction 0 with 15 rules applied. Total rules applied 162 place count 1268 transition count 2734
Applied a total of 162 rules in 138 ms. Remains 1268 /1349 variables (removed 81) and now considering 2734/2939 (removed 205) transitions.
[2023-03-23 08:00:28] [INFO ] Flow matrix only has 2462 transitions (discarded 272 similar events)
// Phase 1: matrix 2462 rows 1268 cols
[2023-03-23 08:00:28] [INFO ] Computed 72 place invariants in 27 ms
[2023-03-23 08:00:29] [INFO ] Implicit Places using invariants in 1050 ms returned [12, 101, 178, 292, 293, 424, 425, 426, 505, 506, 527, 551, 565, 591, 596, 618, 619, 656, 675, 688, 710, 728, 729, 756, 781, 782, 814, 848]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1058 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1240/1349 places, 2734/2939 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1213 transition count 2707
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1213 transition count 2707
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 81 place count 1186 transition count 2680
Iterating global reduction 0 with 27 rules applied. Total rules applied 108 place count 1186 transition count 2680
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 135 place count 1159 transition count 2653
Iterating global reduction 0 with 27 rules applied. Total rules applied 162 place count 1159 transition count 2653
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 181 place count 1140 transition count 2558
Iterating global reduction 0 with 19 rules applied. Total rules applied 200 place count 1140 transition count 2558
Applied a total of 200 rules in 183 ms. Remains 1140 /1240 variables (removed 100) and now considering 2558/2734 (removed 176) transitions.
[2023-03-23 08:00:29] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
// Phase 1: matrix 2286 rows 1140 cols
[2023-03-23 08:00:29] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 08:00:30] [INFO ] Implicit Places using invariants in 913 ms returned []
[2023-03-23 08:00:30] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
[2023-03-23 08:00:30] [INFO ] Invariant cache hit.
[2023-03-23 08:00:31] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 08:00:39] [INFO ] Implicit Places using invariants and state equation in 9253 ms returned [1111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1139/1349 places, 2558/2939 transitions.
Applied a total of 0 rules in 42 ms. Remains 1139 /1139 variables (removed 0) and now considering 2558/2558 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11593 ms. Remains : 1139/1349 places, 2558/2939 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s553)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 finished in 11779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1349 transition count 2914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1324 transition count 2914
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 50 place count 1324 transition count 2882
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 114 place count 1292 transition count 2882
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 132 place count 1274 transition count 2860
Iterating global reduction 2 with 18 rules applied. Total rules applied 150 place count 1274 transition count 2860
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 150 place count 1274 transition count 2857
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 1271 transition count 2857
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 1255 transition count 2781
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 1255 transition count 2781
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 248 place count 1225 transition count 2751
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 261 place count 1212 transition count 2738
Iterating global reduction 2 with 13 rules applied. Total rules applied 274 place count 1212 transition count 2738
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 287 place count 1199 transition count 2673
Iterating global reduction 2 with 13 rules applied. Total rules applied 300 place count 1199 transition count 2673
Applied a total of 300 rules in 372 ms. Remains 1199 /1349 variables (removed 150) and now considering 2673/2939 (removed 266) transitions.
[2023-03-23 08:00:40] [INFO ] Flow matrix only has 2401 transitions (discarded 272 similar events)
// Phase 1: matrix 2401 rows 1199 cols
[2023-03-23 08:00:40] [INFO ] Computed 72 place invariants in 30 ms
[2023-03-23 08:00:41] [INFO ] Implicit Places using invariants in 1047 ms returned [9, 94, 156, 267, 268, 395, 396, 397, 472, 473, 516, 530, 553, 557, 558, 574, 575, 609, 626, 639, 658, 676, 677, 700, 725, 793]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1049 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1173/1349 places, 2673/2939 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1154 transition count 2654
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1154 transition count 2654
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1135 transition count 2635
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1135 transition count 2635
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 1126 transition count 2590
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 1126 transition count 2590
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 1120 transition count 2584
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 1114 transition count 2578
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 1114 transition count 2578
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 1107 transition count 2543
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 1107 transition count 2543
Applied a total of 132 rules in 309 ms. Remains 1107 /1173 variables (removed 66) and now considering 2543/2673 (removed 130) transitions.
[2023-03-23 08:00:41] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1107 cols
[2023-03-23 08:00:41] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-23 08:00:42] [INFO ] Implicit Places using invariants in 939 ms returned []
[2023-03-23 08:00:42] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:00:42] [INFO ] Invariant cache hit.
[2023-03-23 08:00:43] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:00:52] [INFO ] Implicit Places using invariants and state equation in 9791 ms returned []
Implicit Place search using SMT with State Equation took 10731 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1349 places, 2543/2939 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12463 ms. Remains : 1107/1349 places, 2543/2939 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s697 s476), p1:(LEQ s682 s1079)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2720 reset in 547 ms.
Product exploration explored 100000 steps with 2716 reset in 641 ms.
Computed a total of 292 stabilizing places and 927 stable transitions
Computed a total of 292 stabilizing places and 927 stable transitions
Detected a total of 292/1107 stabilizing places and 927/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:00:54] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:00:54] [INFO ] Invariant cache hit.
[2023-03-23 08:00:54] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:00:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 08:00:54] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 08:00:55] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:00:55] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:00:55] [INFO ] After 132ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:00:55] [INFO ] Deduced a trap composed of 224 places in 450 ms of which 1 ms to minimize.
[2023-03-23 08:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 570 ms
[2023-03-23 08:00:55] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-23 08:00:56] [INFO ] After 1702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1107 transition count 2542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1106 transition count 2542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1105 transition count 2541
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1105 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1104 transition count 2536
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1104 transition count 2536
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1103 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1102 transition count 2534
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1102 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1101 transition count 2529
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1101 transition count 2529
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 148 place count 1101 transition count 3453
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 284 place count 965 transition count 3453
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 965 transition count 3453
Applied a total of 287 rules in 474 ms. Remains 965 /1107 variables (removed 142) and now considering 3453/2543 (removed -910) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 965/1107 places, 3453/2543 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82522 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82522 steps, saw 34457 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:00:59] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 965 cols
[2023-03-23 08:00:59] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-23 08:00:59] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:00:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2023-03-23 08:00:59] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 08:01:00] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:00] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:01:01] [INFO ] After 289ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:01] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-23 08:01:01] [INFO ] After 1535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 78 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 965/965 places, 3453/3453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 76 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2023-03-23 08:01:01] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:01] [INFO ] Invariant cache hit.
[2023-03-23 08:01:02] [INFO ] Implicit Places using invariants in 981 ms returned [580]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 964/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 77 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1153 ms. Remains : 964/965 places, 3453/3453 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82395 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82395 steps, saw 34411 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:01:05] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 964 cols
[2023-03-23 08:01:05] [INFO ] Computed 45 place invariants in 29 ms
[2023-03-23 08:01:05] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:01:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 08:01:06] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-23 08:01:06] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:06] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:01:07] [INFO ] After 282ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:07] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-23 08:01:07] [INFO ] After 1445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3453/3453 transitions.
Applied a total of 0 rules in 83 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 964/964 places, 3453/3453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3453/3453 transitions.
Applied a total of 0 rules in 76 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2023-03-23 08:01:07] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:07] [INFO ] Invariant cache hit.
[2023-03-23 08:01:08] [INFO ] Implicit Places using invariants in 978 ms returned []
[2023-03-23 08:01:08] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:08] [INFO ] Invariant cache hit.
[2023-03-23 08:01:09] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:01:25] [INFO ] Implicit Places using invariants and state equation in 16669 ms returned []
Implicit Place search using SMT with State Equation took 17658 ms to find 0 implicit places.
[2023-03-23 08:01:25] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-23 08:01:25] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:25] [INFO ] Invariant cache hit.
[2023-03-23 08:01:26] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19180 ms. Remains : 964/964 places, 3453/3453 transitions.
Graph (trivial) has 1050 edges and 964 vertex of which 17 / 964 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4011 edges and 948 vertex of which 934 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1287.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 917 transition count 2684
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 820 transition count 2491
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 724 transition count 2323
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 652 transition count 2181
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 582 transition count 2061
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 532 transition count 1963
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 484 transition count 1883
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 452 transition count 1821
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 422 transition count 1773
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 404 transition count 1739
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 388 transition count 1715
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 380 transition count 1701
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 374 transition count 1693
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 371 transition count 1691
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 11 Pre rules applied. Total rules applied 1640 place count 371 transition count 1680
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 1662 place count 360 transition count 1680
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1944 place count 78 transition count 338
Iterating global reduction 14 with 282 rules applied. Total rules applied 2226 place count 78 transition count 338
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 231 rules applied. Total rules applied 2457 place count 78 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2458 place count 77 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2458 place count 77 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2460 place count 76 transition count 106
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2470 place count 66 transition count 79
Iterating global reduction 16 with 10 rules applied. Total rules applied 2480 place count 66 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 5 rules applied. Total rules applied 2485 place count 66 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2486 place count 65 transition count 74
Discarding 10 places :
Symmetric choice reduction at 18 with 10 rule applications. Total rules 2496 place count 55 transition count 63
Iterating global reduction 18 with 10 rules applied. Total rules applied 2506 place count 55 transition count 63
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2507 place count 54 transition count 62
Iterating global reduction 18 with 1 rules applied. Total rules applied 2508 place count 54 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2516 place count 50 transition count 58
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 2518 place count 48 transition count 54
Iterating global reduction 18 with 2 rules applied. Total rules applied 2520 place count 48 transition count 54
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2528 place count 48 transition count 46
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 2536 place count 40 transition count 46
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 2538 place count 40 transition count 46
Applied a total of 2538 rules in 397 ms. Remains 40 /964 variables (removed 924) and now considering 46/3453 (removed 3407) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 40 cols
[2023-03-23 08:01:26] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-23 08:01:27] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:01:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 08:01:27] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 08:01:27] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:27] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 08:01:27] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Applied a total of 0 rules in 67 ms. Remains 1107 /1107 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 08:01:27] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1107 cols
[2023-03-23 08:01:27] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-23 08:01:28] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2023-03-23 08:01:28] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:01:28] [INFO ] Invariant cache hit.
[2023-03-23 08:01:29] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:01:38] [INFO ] Implicit Places using invariants and state equation in 9443 ms returned []
Implicit Place search using SMT with State Equation took 10467 ms to find 0 implicit places.
[2023-03-23 08:01:38] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-23 08:01:38] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:01:38] [INFO ] Invariant cache hit.
[2023-03-23 08:01:39] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11678 ms. Remains : 1107/1107 places, 2543/2543 transitions.
Computed a total of 292 stabilizing places and 927 stable transitions
Computed a total of 292 stabilizing places and 927 stable transitions
Detected a total of 292/1107 stabilizing places and 927/2543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-23 08:01:39] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:01:39] [INFO ] Invariant cache hit.
[2023-03-23 08:01:39] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:01:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 08:01:40] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 08:01:40] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:40] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:01:40] [INFO ] After 129ms SMT Verify possible using 854 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:41] [INFO ] Deduced a trap composed of 224 places in 423 ms of which 1 ms to minimize.
[2023-03-23 08:01:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2023-03-23 08:01:41] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-23 08:01:41] [INFO ] After 1551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1107 transition count 2542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1106 transition count 2542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1105 transition count 2541
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1105 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1104 transition count 2536
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1104 transition count 2536
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1103 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1102 transition count 2534
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1102 transition count 2534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1101 transition count 2529
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1101 transition count 2529
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 148 place count 1101 transition count 3453
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 284 place count 965 transition count 3453
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 965 transition count 3453
Applied a total of 287 rules in 479 ms. Remains 965 /1107 variables (removed 142) and now considering 3453/2543 (removed -910) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 965/1107 places, 3453/2543 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82611 steps, run timeout after 3003 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82611 steps, saw 34488 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:01:45] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 965 cols
[2023-03-23 08:01:45] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-23 08:01:45] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:01:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 08:01:45] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 08:01:46] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:46] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:01:46] [INFO ] After 283ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:46] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-23 08:01:46] [INFO ] After 1339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 80 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 965/965 places, 3453/3453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 91 ms. Remains 965 /965 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2023-03-23 08:01:46] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:46] [INFO ] Invariant cache hit.
[2023-03-23 08:01:47] [INFO ] Implicit Places using invariants in 984 ms returned [580]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 964/965 places, 3453/3453 transitions.
Applied a total of 0 rules in 76 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1175 ms. Remains : 964/965 places, 3453/3453 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82047 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82047 steps, saw 34254 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:01:51] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
// Phase 1: matrix 3055 rows 964 cols
[2023-03-23 08:01:51] [INFO ] Computed 45 place invariants in 28 ms
[2023-03-23 08:01:51] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:01:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 08:01:51] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-23 08:01:52] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:52] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:01:52] [INFO ] After 287ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:01:52] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-23 08:01:52] [INFO ] After 1412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3453/3453 transitions.
Applied a total of 0 rules in 76 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 964/964 places, 3453/3453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3453/3453 transitions.
Applied a total of 0 rules in 87 ms. Remains 964 /964 variables (removed 0) and now considering 3453/3453 (removed 0) transitions.
[2023-03-23 08:01:52] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:52] [INFO ] Invariant cache hit.
[2023-03-23 08:01:53] [INFO ] Implicit Places using invariants in 985 ms returned []
[2023-03-23 08:01:53] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:01:53] [INFO ] Invariant cache hit.
[2023-03-23 08:01:54] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:02:11] [INFO ] Implicit Places using invariants and state equation in 17214 ms returned []
Implicit Place search using SMT with State Equation took 18221 ms to find 0 implicit places.
[2023-03-23 08:02:11] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-23 08:02:11] [INFO ] Flow matrix only has 3055 transitions (discarded 398 similar events)
[2023-03-23 08:02:11] [INFO ] Invariant cache hit.
[2023-03-23 08:02:12] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19722 ms. Remains : 964/964 places, 3453/3453 transitions.
Graph (trivial) has 1050 edges and 964 vertex of which 17 / 964 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4011 edges and 948 vertex of which 934 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1287.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 917 transition count 2684
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 820 transition count 2491
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 724 transition count 2323
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 652 transition count 2181
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 582 transition count 2061
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 532 transition count 1963
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 484 transition count 1883
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 452 transition count 1821
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 422 transition count 1773
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 404 transition count 1739
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 388 transition count 1715
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 380 transition count 1701
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 374 transition count 1693
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 371 transition count 1691
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 11 Pre rules applied. Total rules applied 1640 place count 371 transition count 1680
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 1662 place count 360 transition count 1680
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1944 place count 78 transition count 338
Iterating global reduction 14 with 282 rules applied. Total rules applied 2226 place count 78 transition count 338
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 231 rules applied. Total rules applied 2457 place count 78 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2458 place count 77 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2458 place count 77 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2460 place count 76 transition count 106
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2470 place count 66 transition count 79
Iterating global reduction 16 with 10 rules applied. Total rules applied 2480 place count 66 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 5 rules applied. Total rules applied 2485 place count 66 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2486 place count 65 transition count 74
Discarding 10 places :
Symmetric choice reduction at 18 with 10 rule applications. Total rules 2496 place count 55 transition count 63
Iterating global reduction 18 with 10 rules applied. Total rules applied 2506 place count 55 transition count 63
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2507 place count 54 transition count 62
Iterating global reduction 18 with 1 rules applied. Total rules applied 2508 place count 54 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2516 place count 50 transition count 58
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 2518 place count 48 transition count 54
Iterating global reduction 18 with 2 rules applied. Total rules applied 2520 place count 48 transition count 54
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2528 place count 48 transition count 46
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 2536 place count 40 transition count 46
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 2538 place count 40 transition count 46
Applied a total of 2538 rules in 292 ms. Remains 40 /964 variables (removed 924) and now considering 46/3453 (removed 3407) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 40 cols
[2023-03-23 08:02:12] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-23 08:02:12] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:02:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 08:02:13] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 08:02:13] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:02:13] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 08:02:13] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2716 reset in 485 ms.
Product exploration explored 100000 steps with 2718 reset in 514 ms.
Built C files in :
/tmp/ltsmin15781332462665494016
[2023-03-23 08:02:14] [INFO ] Too many transitions (2543) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:02:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15781332462665494016
Running compilation step : cd /tmp/ltsmin15781332462665494016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15781332462665494016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15781332462665494016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2543/2543 transitions.
Applied a total of 0 rules in 75 ms. Remains 1107 /1107 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2023-03-23 08:02:17] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1107 cols
[2023-03-23 08:02:17] [INFO ] Computed 46 place invariants in 17 ms
[2023-03-23 08:02:18] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-23 08:02:18] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:02:18] [INFO ] Invariant cache hit.
[2023-03-23 08:02:19] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:02:28] [INFO ] Implicit Places using invariants and state equation in 9482 ms returned []
Implicit Place search using SMT with State Equation took 10397 ms to find 0 implicit places.
[2023-03-23 08:02:28] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-23 08:02:28] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 08:02:28] [INFO ] Invariant cache hit.
[2023-03-23 08:02:29] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11620 ms. Remains : 1107/1107 places, 2543/2543 transitions.
Built C files in :
/tmp/ltsmin9849492776645344173
[2023-03-23 08:02:29] [INFO ] Too many transitions (2543) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:02:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9849492776645344173
Running compilation step : cd /tmp/ltsmin9849492776645344173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9849492776645344173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9849492776645344173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 08:02:32] [INFO ] Flatten gal took : 194 ms
[2023-03-23 08:02:33] [INFO ] Flatten gal took : 132 ms
[2023-03-23 08:02:33] [INFO ] Time to serialize gal into /tmp/LTL7606737290080734348.gal : 30 ms
[2023-03-23 08:02:33] [INFO ] Time to serialize properties into /tmp/LTL14574455416962023069.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7606737290080734348.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2788119019804476436.hoa' '-atoms' '/tmp/LTL14574455416962023069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14574455416962023069.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2788119019804476436.hoa
Detected timeout of ITS tools.
[2023-03-23 08:02:48] [INFO ] Flatten gal took : 135 ms
[2023-03-23 08:02:48] [INFO ] Flatten gal took : 133 ms
[2023-03-23 08:02:48] [INFO ] Time to serialize gal into /tmp/LTL2988489017875847964.gal : 11 ms
[2023-03-23 08:02:48] [INFO ] Time to serialize properties into /tmp/LTL14037371146178583276.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2988489017875847964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14037371146178583276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)"))&&(F(G("(Node12HasTheLeafSetOfRx...212
Formula 0 simplified : F(G!"(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)" | GF!"(Node12HasTheLeafSetOfRx1ToRe...202
Detected timeout of ITS tools.
[2023-03-23 08:03:03] [INFO ] Flatten gal took : 71 ms
[2023-03-23 08:03:03] [INFO ] Applying decomposition
[2023-03-23 08:03:03] [INFO ] Flatten gal took : 127 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7845733779201863881.txt' '-o' '/tmp/graph7845733779201863881.bin' '-w' '/tmp/graph7845733779201863881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7845733779201863881.bin' '-l' '-1' '-v' '-w' '/tmp/graph7845733779201863881.weights' '-q' '0' '-e' '0.001'
[2023-03-23 08:03:04] [INFO ] Decomposing Gal with order
[2023-03-23 08:03:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 08:03:04] [INFO ] Removed a total of 81 redundant transitions.
[2023-03-23 08:03:05] [INFO ] Flatten gal took : 544 ms
[2023-03-23 08:03:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2023-03-23 08:03:05] [INFO ] Time to serialize gal into /tmp/LTL2272811420073144466.gal : 33 ms
[2023-03-23 08:03:05] [INFO ] Time to serialize properties into /tmp/LTL10295510355569915524.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2272811420073144466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10295510355569915524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu9.Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=gu9.Node5HasAskedItsLeafSetToRx3ToReplaceNode11)"))&&(F(G("(gu15.Node12HasT...230
Formula 0 simplified : F(G!"(gu9.Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=gu9.Node5HasAskedItsLeafSetToRx3ToReplaceNode11)" | GF!"(gu15.Node12HasTheLea...220
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12858227167809432535
[2023-03-23 08:03:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12858227167809432535
Running compilation step : cd /tmp/ltsmin12858227167809432535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12858227167809432535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12858227167809432535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 finished in 164082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1318 transition count 2904
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1318 transition count 2904
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 91 place count 1289 transition count 2819
Iterating global reduction 0 with 29 rules applied. Total rules applied 120 place count 1289 transition count 2819
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 134 place count 1275 transition count 2753
Iterating global reduction 0 with 14 rules applied. Total rules applied 148 place count 1275 transition count 2753
Applied a total of 148 rules in 133 ms. Remains 1275 /1349 variables (removed 74) and now considering 2753/2939 (removed 186) transitions.
[2023-03-23 08:03:23] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1275 cols
[2023-03-23 08:03:24] [INFO ] Computed 72 place invariants in 34 ms
[2023-03-23 08:03:25] [INFO ] Implicit Places using invariants in 1237 ms returned [12, 183, 297, 298, 430, 431, 512, 537, 561, 575, 601, 605, 606, 625, 626, 663, 682, 695, 717, 735, 736, 763, 788, 789, 821, 855]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1239 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1249/1349 places, 2753/2939 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1224 transition count 2728
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1224 transition count 2728
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 75 place count 1199 transition count 2703
Iterating global reduction 0 with 25 rules applied. Total rules applied 100 place count 1199 transition count 2703
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 1174 transition count 2678
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 1174 transition count 2678
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 167 place count 1157 transition count 2593
Iterating global reduction 0 with 17 rules applied. Total rules applied 184 place count 1157 transition count 2593
Applied a total of 184 rules in 160 ms. Remains 1157 /1249 variables (removed 92) and now considering 2593/2753 (removed 160) transitions.
[2023-03-23 08:03:25] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1157 cols
[2023-03-23 08:03:25] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-23 08:03:26] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2023-03-23 08:03:26] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2023-03-23 08:03:26] [INFO ] Invariant cache hit.
[2023-03-23 08:03:27] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 08:03:36] [INFO ] Implicit Places using invariants and state equation in 10485 ms returned []
Implicit Place search using SMT with State Equation took 11527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1157/1349 places, 2593/2939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13060 ms. Remains : 1157/1349 places, 2593/2939 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s509 s143), p0:(LEQ s430 s151)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 980 ms.
Product exploration explored 100000 steps with 50000 reset in 1013 ms.
Computed a total of 325 stabilizing places and 960 stable transitions
Computed a total of 325 stabilizing places and 960 stable transitions
Detected a total of 325/1157 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 finished in 15404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1316 transition count 2902
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1316 transition count 2902
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 97 place count 1285 transition count 2811
Iterating global reduction 0 with 31 rules applied. Total rules applied 128 place count 1285 transition count 2811
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 143 place count 1270 transition count 2740
Iterating global reduction 0 with 15 rules applied. Total rules applied 158 place count 1270 transition count 2740
Applied a total of 158 rules in 138 ms. Remains 1270 /1349 variables (removed 79) and now considering 2740/2939 (removed 199) transitions.
[2023-03-23 08:03:39] [INFO ] Flow matrix only has 2468 transitions (discarded 272 similar events)
// Phase 1: matrix 2468 rows 1270 cols
[2023-03-23 08:03:39] [INFO ] Computed 72 place invariants in 23 ms
[2023-03-23 08:03:40] [INFO ] Implicit Places using invariants in 1056 ms returned [12, 101, 178, 292, 293, 425, 426, 508, 509, 530, 570, 596, 600, 601, 620, 621, 658, 677, 690, 712, 730, 731, 758, 783, 784, 816, 850]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1243/1349 places, 2740/2939 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1217 transition count 2714
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1217 transition count 2714
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 78 place count 1191 transition count 2688
Iterating global reduction 0 with 26 rules applied. Total rules applied 104 place count 1191 transition count 2688
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 130 place count 1165 transition count 2662
Iterating global reduction 0 with 26 rules applied. Total rules applied 156 place count 1165 transition count 2662
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 174 place count 1147 transition count 2572
Iterating global reduction 0 with 18 rules applied. Total rules applied 192 place count 1147 transition count 2572
Applied a total of 192 rules in 198 ms. Remains 1147 /1243 variables (removed 96) and now considering 2572/2740 (removed 168) transitions.
[2023-03-23 08:03:40] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2023-03-23 08:03:40] [INFO ] Computed 45 place invariants in 26 ms
[2023-03-23 08:03:41] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-23 08:03:41] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2023-03-23 08:03:41] [INFO ] Invariant cache hit.
[2023-03-23 08:03:42] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 08:03:50] [INFO ] Implicit Places using invariants and state equation in 9088 ms returned []
Implicit Place search using SMT with State Equation took 10061 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1349 places, 2572/2939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11469 ms. Remains : 1147/1349 places, 2572/2939 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 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:(GT s414 s522)], 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 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 finished in 11561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1349 transition count 2914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1324 transition count 2914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 50 place count 1324 transition count 2881
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 116 place count 1291 transition count 2881
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 137 place count 1270 transition count 2856
Iterating global reduction 2 with 21 rules applied. Total rules applied 158 place count 1270 transition count 2856
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 158 place count 1270 transition count 2853
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 1267 transition count 2853
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 183 place count 1248 transition count 2766
Iterating global reduction 2 with 19 rules applied. Total rules applied 202 place count 1248 transition count 2766
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 260 place count 1219 transition count 2737
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 273 place count 1206 transition count 2724
Iterating global reduction 2 with 13 rules applied. Total rules applied 286 place count 1206 transition count 2724
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 299 place count 1193 transition count 2659
Iterating global reduction 2 with 13 rules applied. Total rules applied 312 place count 1193 transition count 2659
Applied a total of 312 rules in 333 ms. Remains 1193 /1349 variables (removed 156) and now considering 2659/2939 (removed 280) transitions.
[2023-03-23 08:03:51] [INFO ] Flow matrix only has 2387 transitions (discarded 272 similar events)
// Phase 1: matrix 2387 rows 1193 cols
[2023-03-23 08:03:51] [INFO ] Computed 72 place invariants in 32 ms
[2023-03-23 08:03:52] [INFO ] Implicit Places using invariants in 1011 ms returned [9, 94, 156, 267, 268, 395, 396, 397, 472, 496, 516, 530, 553, 557, 558, 574, 575, 609, 626, 639, 658, 676, 677, 700, 725, 726, 754, 788]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1165/1349 places, 2659/2939 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1144 transition count 2638
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1144 transition count 2638
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 1123 transition count 2617
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 1123 transition count 2617
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1112 transition count 2562
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1112 transition count 2562
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 118 place count 1106 transition count 2556
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 1100 transition count 2550
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 1100 transition count 2550
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 1092 transition count 2510
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 1092 transition count 2510
Applied a total of 146 rules in 279 ms. Remains 1092 /1165 variables (removed 73) and now considering 2510/2659 (removed 149) transitions.
[2023-03-23 08:03:52] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2023-03-23 08:03:52] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-23 08:03:53] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-23 08:03:53] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2023-03-23 08:03:53] [INFO ] Invariant cache hit.
[2023-03-23 08:03:53] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 08:04:01] [INFO ] Implicit Places using invariants and state equation in 8488 ms returned [1083]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9371 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1349 places, 2510/2939 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 77 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2023-03-23 08:04:01] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2023-03-23 08:04:01] [INFO ] Computed 43 place invariants in 26 ms
[2023-03-23 08:04:02] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-23 08:04:02] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:02] [INFO ] Invariant cache hit.
[2023-03-23 08:04:03] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 08:04:10] [INFO ] Implicit Places using invariants and state equation in 7551 ms returned []
Implicit Place search using SMT with State Equation took 8480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1349 places, 2509/2939 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 19554 ms. Remains : 1090/1349 places, 2509/2939 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s459)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2728 reset in 517 ms.
Product exploration explored 100000 steps with 2728 reset in 524 ms.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1090 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 286 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=95 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2023-03-23 08:04:12] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:12] [INFO ] Invariant cache hit.
[2023-03-23 08:04:13] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-23 08:04:13] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:13] [INFO ] Invariant cache hit.
[2023-03-23 08:04:13] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 08:04:21] [INFO ] Implicit Places using invariants and state equation in 8329 ms returned []
Implicit Place search using SMT with State Equation took 9232 ms to find 0 implicit places.
[2023-03-23 08:04:21] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-23 08:04:21] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:21] [INFO ] Invariant cache hit.
[2023-03-23 08:04:22] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10344 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Detected a total of 275/1090 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8872 steps, including 241 resets, run visited all 1 properties in 60 ms. (steps per millisecond=147 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2728 reset in 462 ms.
Product exploration explored 100000 steps with 2727 reset in 488 ms.
Built C files in :
/tmp/ltsmin10373950489883667132
[2023-03-23 08:04:24] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:04:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10373950489883667132
Running compilation step : cd /tmp/ltsmin10373950489883667132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10373950489883667132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10373950489883667132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2023-03-23 08:04:27] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:27] [INFO ] Invariant cache hit.
[2023-03-23 08:04:28] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-23 08:04:28] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:28] [INFO ] Invariant cache hit.
[2023-03-23 08:04:28] [INFO ] State equation strengthened by 834 read => feed constraints.
[2023-03-23 08:04:36] [INFO ] Implicit Places using invariants and state equation in 8041 ms returned []
Implicit Place search using SMT with State Equation took 8922 ms to find 0 implicit places.
[2023-03-23 08:04:36] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-23 08:04:36] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2023-03-23 08:04:36] [INFO ] Invariant cache hit.
[2023-03-23 08:04:37] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10047 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin15960825111051783888
[2023-03-23 08:04:37] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:04:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15960825111051783888
Running compilation step : cd /tmp/ltsmin15960825111051783888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15960825111051783888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15960825111051783888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 08:04:40] [INFO ] Flatten gal took : 141 ms
[2023-03-23 08:04:40] [INFO ] Flatten gal took : 133 ms
[2023-03-23 08:04:40] [INFO ] Time to serialize gal into /tmp/LTL3236301870314530659.gal : 11 ms
[2023-03-23 08:04:40] [INFO ] Time to serialize properties into /tmp/LTL16589623220419923518.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3236301870314530659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18206276733922329030.hoa' '-atoms' '/tmp/LTL16589623220419923518.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16589623220419923518.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18206276733922329030.hoa
Detected timeout of ITS tools.
[2023-03-23 08:04:56] [INFO ] Flatten gal took : 73 ms
[2023-03-23 08:04:56] [INFO ] Flatten gal took : 65 ms
[2023-03-23 08:04:56] [INFO ] Time to serialize gal into /tmp/LTL2978470824231913172.gal : 14 ms
[2023-03-23 08:04:56] [INFO ] Time to serialize properties into /tmp/LTL16654141790326243289.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2978470824231913172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16654141790326243289.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node5HasTheLeafSetOfLx0ToReplaceNode6<1)"))))
Formula 0 simplified : FG!"(Node5HasTheLeafSetOfLx0ToReplaceNode6<1)"
Detected timeout of ITS tools.
[2023-03-23 08:05:11] [INFO ] Flatten gal took : 59 ms
[2023-03-23 08:05:11] [INFO ] Applying decomposition
[2023-03-23 08:05:11] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17058592683991940246.txt' '-o' '/tmp/graph17058592683991940246.bin' '-w' '/tmp/graph17058592683991940246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17058592683991940246.bin' '-l' '-1' '-v' '-w' '/tmp/graph17058592683991940246.weights' '-q' '0' '-e' '0.001'
[2023-03-23 08:05:11] [INFO ] Decomposing Gal with order
[2023-03-23 08:05:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 08:05:11] [INFO ] Removed a total of 2241 redundant transitions.
[2023-03-23 08:05:11] [INFO ] Flatten gal took : 359 ms
[2023-03-23 08:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1355 labels/synchronizations in 129 ms.
[2023-03-23 08:05:12] [INFO ] Time to serialize gal into /tmp/LTL5099448374166787996.gal : 29 ms
[2023-03-23 08:05:12] [INFO ] Time to serialize properties into /tmp/LTL17298735986656264613.ltl : 321 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5099448374166787996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17298735986656264613.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i16.i0.i5.u157.Node5HasTheLeafSetOfLx0ToReplaceNode6<1)"))))
Formula 0 simplified : FG!"(i16.i0.i5.u157.Node5HasTheLeafSetOfLx0ToReplaceNode6<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11542094840575515844
[2023-03-23 08:05:27] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11542094840575515844
Running compilation step : cd /tmp/ltsmin11542094840575515844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11542094840575515844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11542094840575515844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 finished in 99820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1349 transition count 2915
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1325 transition count 2915
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 48 place count 1325 transition count 2882
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 114 place count 1292 transition count 2882
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 133 place count 1273 transition count 2859
Iterating global reduction 2 with 19 rules applied. Total rules applied 152 place count 1273 transition count 2859
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 152 place count 1273 transition count 2857
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 1271 transition count 2857
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 173 place count 1254 transition count 2776
Iterating global reduction 2 with 17 rules applied. Total rules applied 190 place count 1254 transition count 2776
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 250 place count 1224 transition count 2746
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 264 place count 1210 transition count 2732
Iterating global reduction 2 with 14 rules applied. Total rules applied 278 place count 1210 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 292 place count 1196 transition count 2662
Iterating global reduction 2 with 14 rules applied. Total rules applied 306 place count 1196 transition count 2662
Applied a total of 306 rules in 309 ms. Remains 1196 /1349 variables (removed 153) and now considering 2662/2939 (removed 277) transitions.
[2023-03-23 08:05:30] [INFO ] Flow matrix only has 2390 transitions (discarded 272 similar events)
// Phase 1: matrix 2390 rows 1196 cols
[2023-03-23 08:05:31] [INFO ] Computed 72 place invariants in 57 ms
[2023-03-23 08:05:32] [INFO ] Implicit Places using invariants in 1123 ms returned [9, 95, 157, 268, 269, 396, 397, 398, 472, 497, 517, 531, 554, 558, 559, 575, 576, 610, 627, 640, 659, 677, 678, 701, 726, 727, 757, 791]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1125 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1349 places, 2662/2939 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1148 transition count 2642
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1148 transition count 2642
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1128 transition count 2622
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1128 transition count 2622
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 1119 transition count 2577
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 1119 transition count 2577
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 1112 transition count 2570
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 1105 transition count 2563
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 1105 transition count 2563
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 135 place count 1096 transition count 2518
Iterating global reduction 0 with 9 rules applied. Total rules applied 144 place count 1096 transition count 2518
Applied a total of 144 rules in 285 ms. Remains 1096 /1168 variables (removed 72) and now considering 2518/2662 (removed 144) transitions.
[2023-03-23 08:05:32] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1096 cols
[2023-03-23 08:05:32] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 08:05:33] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-23 08:05:33] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
[2023-03-23 08:05:33] [INFO ] Invariant cache hit.
[2023-03-23 08:05:33] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:05:41] [INFO ] Implicit Places using invariants and state equation in 8587 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9493 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1095/1349 places, 2518/2939 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1095 transition count 2517
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1094 transition count 2517
Applied a total of 2 rules in 66 ms. Remains 1094 /1095 variables (removed 1) and now considering 2517/2518 (removed 1) transitions.
[2023-03-23 08:05:41] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1094 cols
[2023-03-23 08:05:41] [INFO ] Computed 43 place invariants in 27 ms
[2023-03-23 08:05:42] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-23 08:05:42] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:05:42] [INFO ] Invariant cache hit.
[2023-03-23 08:05:43] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:05:51] [INFO ] Implicit Places using invariants and state equation in 8968 ms returned []
Implicit Place search using SMT with State Equation took 9906 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1094/1349 places, 2517/2939 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21185 ms. Remains : 1094/1349 places, 2517/2939 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s464 s681)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2726 reset in 489 ms.
Product exploration explored 100000 steps with 2723 reset in 515 ms.
Computed a total of 279 stabilizing places and 901 stable transitions
Computed a total of 279 stabilizing places and 901 stable transitions
Detected a total of 279/1094 stabilizing places and 901/2517 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 272 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88523 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88523 steps, saw 37278 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:05:56] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:05:56] [INFO ] Invariant cache hit.
[2023-03-23 08:05:56] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:05:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 08:05:57] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 08:05:57] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:05:57] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:05:57] [INFO ] After 128ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:05:58] [INFO ] Deduced a trap composed of 241 places in 461 ms of which 2 ms to minimize.
[2023-03-23 08:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2023-03-23 08:05:58] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-23 08:05:58] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2517/2517 transitions.
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 0 with 134 rules applied. Total rules applied 134 place count 1094 transition count 3451
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 0 with 134 rules applied. Total rules applied 268 place count 960 transition count 3451
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 269 place count 960 transition count 3451
Applied a total of 269 rules in 242 ms. Remains 960 /1094 variables (removed 134) and now considering 3451/2517 (removed -934) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 960/1094 places, 3451/2517 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81670 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81670 steps, saw 34037 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:06:02] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
// Phase 1: matrix 3053 rows 960 cols
[2023-03-23 08:06:02] [INFO ] Computed 43 place invariants in 28 ms
[2023-03-23 08:06:02] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:06:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 08:06:02] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 08:06:03] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:03] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:06:03] [INFO ] After 228ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:03] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-23 08:06:03] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 3451/3451 transitions.
Applied a total of 0 rules in 76 ms. Remains 960 /960 variables (removed 0) and now considering 3451/3451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 960/960 places, 3451/3451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 3451/3451 transitions.
Applied a total of 0 rules in 87 ms. Remains 960 /960 variables (removed 0) and now considering 3451/3451 (removed 0) transitions.
[2023-03-23 08:06:03] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:06:03] [INFO ] Invariant cache hit.
[2023-03-23 08:06:04] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-23 08:06:04] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:06:04] [INFO ] Invariant cache hit.
[2023-03-23 08:06:05] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:06:20] [INFO ] Implicit Places using invariants and state equation in 15892 ms returned []
Implicit Place search using SMT with State Equation took 16893 ms to find 0 implicit places.
[2023-03-23 08:06:20] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-23 08:06:20] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:06:20] [INFO ] Invariant cache hit.
[2023-03-23 08:06:21] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18329 ms. Remains : 960/960 places, 3451/3451 transitions.
Graph (trivial) has 1048 edges and 960 vertex of which 17 / 960 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3992 edges and 944 vertex of which 930 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1287.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 913 transition count 2682
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 816 transition count 2489
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 720 transition count 2321
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 648 transition count 2179
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 578 transition count 2059
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 528 transition count 1961
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 480 transition count 1881
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 448 transition count 1819
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 418 transition count 1771
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 400 transition count 1737
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 384 transition count 1713
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 376 transition count 1699
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 370 transition count 1691
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 367 transition count 1689
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 1640 place count 367 transition count 1680
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 1658 place count 358 transition count 1680
Discarding 283 places :
Symmetric choice reduction at 14 with 283 rule applications. Total rules 1941 place count 75 transition count 329
Iterating global reduction 14 with 283 rules applied. Total rules applied 2224 place count 75 transition count 329
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 245 rules applied. Total rules applied 2469 place count 75 transition count 84
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2476 place count 68 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2476 place count 68 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2478 place count 67 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2489 place count 56 transition count 64
Iterating global reduction 16 with 11 rules applied. Total rules applied 2500 place count 56 transition count 64
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2504 place count 52 transition count 60
Iterating global reduction 16 with 4 rules applied. Total rules applied 2508 place count 52 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 2518 place count 47 transition count 55
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2519 place count 46 transition count 52
Iterating global reduction 16 with 1 rules applied. Total rules applied 2520 place count 46 transition count 52
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 16 with 9 rules applied. Total rules applied 2529 place count 46 transition count 43
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2538 place count 37 transition count 43
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 2543 place count 37 transition count 43
Applied a total of 2543 rules in 299 ms. Remains 37 /960 variables (removed 923) and now considering 43/3451 (removed 3408) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 37 cols
[2023-03-23 08:06:22] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-23 08:06:22] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:06:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 08:06:22] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 08:06:22] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:22] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 08:06:22] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2517/2517 transitions.
Applied a total of 0 rules in 62 ms. Remains 1094 /1094 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2023-03-23 08:06:22] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1094 cols
[2023-03-23 08:06:22] [INFO ] Computed 43 place invariants in 24 ms
[2023-03-23 08:06:23] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-23 08:06:23] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:06:23] [INFO ] Invariant cache hit.
[2023-03-23 08:06:24] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:06:32] [INFO ] Implicit Places using invariants and state equation in 9271 ms returned []
Implicit Place search using SMT with State Equation took 10177 ms to find 0 implicit places.
[2023-03-23 08:06:32] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-23 08:06:32] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:06:32] [INFO ] Invariant cache hit.
[2023-03-23 08:06:33] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11339 ms. Remains : 1094/1094 places, 2517/2517 transitions.
Computed a total of 279 stabilizing places and 901 stable transitions
Computed a total of 279 stabilizing places and 901 stable transitions
Detected a total of 279/1094 stabilizing places and 901/2517 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 90342 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90342 steps, saw 38052 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:06:37] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:06:37] [INFO ] Invariant cache hit.
[2023-03-23 08:06:37] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:06:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 08:06:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 08:06:38] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:38] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:06:38] [INFO ] After 127ms SMT Verify possible using 838 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:38] [INFO ] Deduced a trap composed of 241 places in 440 ms of which 1 ms to minimize.
[2023-03-23 08:06:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2023-03-23 08:06:38] [INFO ] After 746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-23 08:06:38] [INFO ] After 1609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2517/2517 transitions.
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 0 with 134 rules applied. Total rules applied 134 place count 1094 transition count 3451
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 0 with 134 rules applied. Total rules applied 268 place count 960 transition count 3451
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 269 place count 960 transition count 3451
Applied a total of 269 rules in 242 ms. Remains 960 /1094 variables (removed 134) and now considering 3451/2517 (removed -934) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 960/1094 places, 3451/2517 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83315 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83315 steps, saw 34724 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:06:42] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
// Phase 1: matrix 3053 rows 960 cols
[2023-03-23 08:06:42] [INFO ] Computed 43 place invariants in 25 ms
[2023-03-23 08:06:42] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:06:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 08:06:42] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 08:06:43] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:43] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:06:43] [INFO ] After 222ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:06:43] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-23 08:06:43] [INFO ] After 1285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 3451/3451 transitions.
Applied a total of 0 rules in 78 ms. Remains 960 /960 variables (removed 0) and now considering 3451/3451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 960/960 places, 3451/3451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 3451/3451 transitions.
Applied a total of 0 rules in 76 ms. Remains 960 /960 variables (removed 0) and now considering 3451/3451 (removed 0) transitions.
[2023-03-23 08:06:43] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:06:43] [INFO ] Invariant cache hit.
[2023-03-23 08:06:45] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-23 08:06:45] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:06:45] [INFO ] Invariant cache hit.
[2023-03-23 08:06:45] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 08:07:01] [INFO ] Implicit Places using invariants and state equation in 16039 ms returned []
Implicit Place search using SMT with State Equation took 17119 ms to find 0 implicit places.
[2023-03-23 08:07:01] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-23 08:07:01] [INFO ] Flow matrix only has 3053 transitions (discarded 398 similar events)
[2023-03-23 08:07:01] [INFO ] Invariant cache hit.
[2023-03-23 08:07:02] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18577 ms. Remains : 960/960 places, 3451/3451 transitions.
Graph (trivial) has 1048 edges and 960 vertex of which 17 / 960 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3992 edges and 944 vertex of which 930 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1287.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 913 transition count 2682
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 816 transition count 2489
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 720 transition count 2321
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 648 transition count 2179
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 578 transition count 2059
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 528 transition count 1961
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 480 transition count 1881
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 448 transition count 1819
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 418 transition count 1771
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 400 transition count 1737
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 384 transition count 1713
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 376 transition count 1699
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 370 transition count 1691
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 367 transition count 1689
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 1640 place count 367 transition count 1680
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 1658 place count 358 transition count 1680
Discarding 283 places :
Symmetric choice reduction at 14 with 283 rule applications. Total rules 1941 place count 75 transition count 329
Iterating global reduction 14 with 283 rules applied. Total rules applied 2224 place count 75 transition count 329
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 245 rules applied. Total rules applied 2469 place count 75 transition count 84
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2476 place count 68 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2476 place count 68 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2478 place count 67 transition count 83
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2489 place count 56 transition count 64
Iterating global reduction 16 with 11 rules applied. Total rules applied 2500 place count 56 transition count 64
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2504 place count 52 transition count 60
Iterating global reduction 16 with 4 rules applied. Total rules applied 2508 place count 52 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 2518 place count 47 transition count 55
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2519 place count 46 transition count 52
Iterating global reduction 16 with 1 rules applied. Total rules applied 2520 place count 46 transition count 52
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 16 with 9 rules applied. Total rules applied 2529 place count 46 transition count 43
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2538 place count 37 transition count 43
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 2543 place count 37 transition count 43
Applied a total of 2543 rules in 301 ms. Remains 37 /960 variables (removed 923) and now considering 43/3451 (removed 3408) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 37 cols
[2023-03-23 08:07:02] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 08:07:02] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:07:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 08:07:02] [INFO ] [Nat]Absence check using 2 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 08:07:02] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:07:02] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 08:07:02] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 301 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2725 reset in 479 ms.
Product exploration explored 100000 steps with 2725 reset in 484 ms.
Built C files in :
/tmp/ltsmin880062387696020080
[2023-03-23 08:07:04] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:07:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin880062387696020080
Running compilation step : cd /tmp/ltsmin880062387696020080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin880062387696020080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin880062387696020080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2517/2517 transitions.
Applied a total of 0 rules in 58 ms. Remains 1094 /1094 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2023-03-23 08:07:07] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1094 cols
[2023-03-23 08:07:07] [INFO ] Computed 43 place invariants in 19 ms
[2023-03-23 08:07:08] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-23 08:07:08] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:07:08] [INFO ] Invariant cache hit.
[2023-03-23 08:07:08] [INFO ] State equation strengthened by 838 read => feed constraints.
[2023-03-23 08:07:17] [INFO ] Implicit Places using invariants and state equation in 8885 ms returned []
Implicit Place search using SMT with State Equation took 9738 ms to find 0 implicit places.
[2023-03-23 08:07:17] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-23 08:07:17] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2023-03-23 08:07:17] [INFO ] Invariant cache hit.
[2023-03-23 08:07:18] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10904 ms. Remains : 1094/1094 places, 2517/2517 transitions.
Built C files in :
/tmp/ltsmin8543444406309374293
[2023-03-23 08:07:18] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:07:18] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8543444406309374293
Running compilation step : cd /tmp/ltsmin8543444406309374293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8543444406309374293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8543444406309374293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 08:07:21] [INFO ] Flatten gal took : 49 ms
[2023-03-23 08:07:21] [INFO ] Flatten gal took : 50 ms
[2023-03-23 08:07:21] [INFO ] Time to serialize gal into /tmp/LTL12787483418453892250.gal : 12 ms
[2023-03-23 08:07:21] [INFO ] Time to serialize properties into /tmp/LTL13515259688121579251.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12787483418453892250.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8328447918126988408.hoa' '-atoms' '/tmp/LTL13515259688121579251.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13515259688121579251.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8328447918126988408.hoa
Detected timeout of ITS tools.
[2023-03-23 08:07:36] [INFO ] Flatten gal took : 52 ms
[2023-03-23 08:07:36] [INFO ] Flatten gal took : 52 ms
[2023-03-23 08:07:36] [INFO ] Time to serialize gal into /tmp/LTL8839368616442104341.gal : 24 ms
[2023-03-23 08:07:36] [INFO ] Time to serialize properties into /tmp/LTL17923127228820066807.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8839368616442104341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17923127228820066807.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node5HasTheLeafSetOfLx4ToReplaceNode7<=LeafSetOfLx3IsSentToNode12)"))))
Formula 0 simplified : FG!"(Node5HasTheLeafSetOfLx4ToReplaceNode7<=LeafSetOfLx3IsSentToNode12)"
Detected timeout of ITS tools.
[2023-03-23 08:07:51] [INFO ] Flatten gal took : 50 ms
[2023-03-23 08:07:51] [INFO ] Applying decomposition
[2023-03-23 08:07:51] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13973236317785444292.txt' '-o' '/tmp/graph13973236317785444292.bin' '-w' '/tmp/graph13973236317785444292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13973236317785444292.bin' '-l' '-1' '-v' '-w' '/tmp/graph13973236317785444292.weights' '-q' '0' '-e' '0.001'
[2023-03-23 08:07:52] [INFO ] Decomposing Gal with order
[2023-03-23 08:07:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 08:07:52] [INFO ] Removed a total of 431 redundant transitions.
[2023-03-23 08:07:52] [INFO ] Flatten gal took : 117 ms
[2023-03-23 08:07:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-23 08:07:52] [INFO ] Time to serialize gal into /tmp/LTL18209094617684662570.gal : 12 ms
[2023-03-23 08:07:52] [INFO ] Time to serialize properties into /tmp/LTL6187019747979518100.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18209094617684662570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6187019747979518100.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu15.Node5HasTheLeafSetOfLx4ToReplaceNode7<=gu15.LeafSetOfLx3IsSentToNode12)"))))
Formula 0 simplified : FG!"(gu15.Node5HasTheLeafSetOfLx4ToReplaceNode7<=gu15.LeafSetOfLx3IsSentToNode12)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14817339273618998270
[2023-03-23 08:08:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14817339273618998270
Running compilation step : cd /tmp/ltsmin14817339273618998270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14817339273618998270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14817339273618998270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 finished in 159864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1349 transition count 2913
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1323 transition count 2913
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 52 place count 1323 transition count 2880
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 118 place count 1290 transition count 2880
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 137 place count 1271 transition count 2857
Iterating global reduction 2 with 19 rules applied. Total rules applied 156 place count 1271 transition count 2857
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 156 place count 1271 transition count 2855
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 1269 transition count 2855
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 177 place count 1252 transition count 2778
Iterating global reduction 2 with 17 rules applied. Total rules applied 194 place count 1252 transition count 2778
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 254 place count 1222 transition count 2748
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 268 place count 1208 transition count 2734
Iterating global reduction 2 with 14 rules applied. Total rules applied 282 place count 1208 transition count 2734
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 296 place count 1194 transition count 2664
Iterating global reduction 2 with 14 rules applied. Total rules applied 310 place count 1194 transition count 2664
Applied a total of 310 rules in 309 ms. Remains 1194 /1349 variables (removed 155) and now considering 2664/2939 (removed 275) transitions.
[2023-03-23 08:08:10] [INFO ] Flow matrix only has 2392 transitions (discarded 272 similar events)
// Phase 1: matrix 2392 rows 1194 cols
[2023-03-23 08:08:10] [INFO ] Computed 72 place invariants in 32 ms
[2023-03-23 08:08:11] [INFO ] Implicit Places using invariants in 993 ms returned [10, 95, 157, 268, 269, 396, 397, 398, 472, 473, 494, 514, 528, 551, 555, 574, 611, 628, 641, 660, 678, 679, 702, 727, 728, 756, 790]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 996 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1167/1349 places, 2664/2939 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1148 transition count 2645
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1148 transition count 2645
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1129 transition count 2626
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1129 transition count 2626
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 1121 transition count 2586
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 1121 transition count 2586
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 106 place count 1114 transition count 2579
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 1107 transition count 2572
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 1107 transition count 2572
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 1097 transition count 2522
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 1097 transition count 2522
Applied a total of 140 rules in 290 ms. Remains 1097 /1167 variables (removed 70) and now considering 2522/2664 (removed 142) transitions.
[2023-03-23 08:08:12] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1097 cols
[2023-03-23 08:08:12] [INFO ] Computed 45 place invariants in 28 ms
[2023-03-23 08:08:12] [INFO ] Implicit Places using invariants in 898 ms returned []
[2023-03-23 08:08:12] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2023-03-23 08:08:12] [INFO ] Invariant cache hit.
[2023-03-23 08:08:13] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 08:08:21] [INFO ] Implicit Places using invariants and state equation in 8902 ms returned []
Implicit Place search using SMT with State Equation took 9801 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1097/1349 places, 2522/2939 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11397 ms. Remains : 1097/1349 places, 2522/2939 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s524 s536)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4598 steps with 125 reset in 26 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 finished in 11502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&G(p2))))'
Support contains 6 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 2939/2939 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1319 transition count 2905
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1319 transition count 2905
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 88 place count 1291 transition count 2825
Iterating global reduction 0 with 28 rules applied. Total rules applied 116 place count 1291 transition count 2825
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 130 place count 1277 transition count 2759
Iterating global reduction 0 with 14 rules applied. Total rules applied 144 place count 1277 transition count 2759
Applied a total of 144 rules in 140 ms. Remains 1277 /1349 variables (removed 72) and now considering 2759/2939 (removed 180) transitions.
[2023-03-23 08:08:22] [INFO ] Flow matrix only has 2487 transitions (discarded 272 similar events)
// Phase 1: matrix 2487 rows 1277 cols
[2023-03-23 08:08:22] [INFO ] Computed 72 place invariants in 28 ms
[2023-03-23 08:08:23] [INFO ] Implicit Places using invariants in 1000 ms returned [12, 101, 178, 292, 293, 424, 425, 426, 505, 506, 527, 551, 594, 598, 599, 618, 619, 656, 690, 712, 730, 788, 789, 821]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1253/1349 places, 2759/2939 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1230 transition count 2736
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1230 transition count 2736
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1207 transition count 2713
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1207 transition count 2713
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1184 transition count 2690
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1184 transition count 2690
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 153 place count 1169 transition count 2615
Iterating global reduction 0 with 15 rules applied. Total rules applied 168 place count 1169 transition count 2615
Applied a total of 168 rules in 164 ms. Remains 1169 /1253 variables (removed 84) and now considering 2615/2759 (removed 144) transitions.
[2023-03-23 08:08:23] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1169 cols
[2023-03-23 08:08:23] [INFO ] Computed 48 place invariants in 28 ms
[2023-03-23 08:08:24] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-23 08:08:24] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
[2023-03-23 08:08:24] [INFO ] Invariant cache hit.
[2023-03-23 08:08:25] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 08:08:31] [INFO ] Implicit Places using invariants and state equation in 7722 ms returned []
Implicit Place search using SMT with State Equation took 8683 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1169/1349 places, 2615/2939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9989 ms. Remains : 1169/1349 places, 2615/2939 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(GT s616 s699), p1:(GT s671 s592), p0:(GT s797 s524)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 finished in 10223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 08:08:32] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14320367698379749845
[2023-03-23 08:08:32] [INFO ] Too many transitions (2939) to apply POR reductions. Disabling POR matrices.
[2023-03-23 08:08:32] [INFO ] Applying decomposition
[2023-03-23 08:08:32] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14320367698379749845
Running compilation step : cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 08:08:32] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9618096184542537388.txt' '-o' '/tmp/graph9618096184542537388.bin' '-w' '/tmp/graph9618096184542537388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9618096184542537388.bin' '-l' '-1' '-v' '-w' '/tmp/graph9618096184542537388.weights' '-q' '0' '-e' '0.001'
[2023-03-23 08:08:32] [INFO ] Decomposing Gal with order
[2023-03-23 08:08:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 08:08:33] [INFO ] Removed a total of 2196 redundant transitions.
[2023-03-23 08:08:33] [INFO ] Flatten gal took : 220 ms
[2023-03-23 08:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 20 ms.
[2023-03-23 08:08:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality2103218559713098963.gal : 15 ms
[2023-03-23 08:08:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality8654658278556593064.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2103218559713098963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8654658278556593064.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((G((F("(gu96.Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=gu96.Node5HasAskedItsLeafSetToRx3ToReplaceNode11)"))&&(F(G("(gu185.Node12H...234
Formula 0 simplified : F(G!"(gu96.Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=gu96.Node5HasAskedItsLeafSetToRx3ToReplaceNode11)" | GF!"(gu185.Node12HasThe...224
Compilation finished in 7040 ms.
Running link step : cd /tmp/ltsmin14320367698379749845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 08:32:09] [INFO ] Flatten gal took : 143 ms
[2023-03-23 08:32:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality10299813275768124096.gal : 26 ms
[2023-03-23 08:32:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality1453688620500618414.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10299813275768124096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1453688620500618414.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G((F("(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)"))&&(F(G("(Node12HasTheLeafSetOfRx...212
Formula 0 simplified : F(G!"(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)" | GF!"(Node12HasTheLeafSetOfRx1ToRe...202
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14320367698379749845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 08:55:46] [INFO ] Flatten gal took : 211 ms
[2023-03-23 08:55:46] [INFO ] Input system was already deterministic with 2939 transitions.
[2023-03-23 08:55:46] [INFO ] Transformed 1349 places.
[2023-03-23 08:55:46] [INFO ] Transformed 2939 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 08:56:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality1014458150026693426.gal : 9 ms
[2023-03-23 08:56:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality11411595328491561888.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1014458150026693426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11411595328491561888.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)"))&&(F(G("(Node12HasTheLeafSetOfRx...212
Formula 0 simplified : F(G!"(Node13HasAskedItsLeafSetToLx4ToReplaceNode2<=Node5HasAskedItsLeafSetToRx3ToReplaceNode11)" | GF!"(Node12HasTheLeafSetOfRx1ToRe...202
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13929324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099840 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r229-tall-167856413700771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 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 ;