About the Execution of ITS-Tools for ParamProductionCell-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1091.048 | 158934.00 | 353094.00 | 1039.80 | TFFTTFFTFFTTFFTT | 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.r261-smll-167863536300387.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 ParamProductionCell-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678919246188
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=ParamProductionCell-PT-3
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-15 22:27:29] [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-15 22:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:27:29] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-15 22:27:29] [INFO ] Transformed 231 places.
[2023-03-15 22:27:29] [INFO ] Transformed 202 transitions.
[2023-03-15 22:27:29] [INFO ] Found NUPN structural information;
[2023-03-15 22:27:29] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ParamProductionCell-PT-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 94 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-15 22:27:30] [INFO ] Computed 59 place invariants in 25 ms
[2023-03-15 22:27:31] [INFO ] Implicit Places using invariants in 970 ms returned [15, 16, 18, 19, 24, 31, 36, 41, 42, 46, 59, 64, 65, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 159, 160, 162, 164, 192, 195, 201, 206, 217]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1044 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/231 places, 197/202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 196
Applied a total of 2 rules in 33 ms. Remains 193 /194 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 193 cols
[2023-03-15 22:27:31] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 22:27:31] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-15 22:27:31] [INFO ] Invariant cache hit.
[2023-03-15 22:27:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:27:32] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 193/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2151 ms. Remains : 193/231 places, 196/202 transitions.
Support contains 25 out of 193 places after structural reductions.
[2023-03-15 22:27:32] [INFO ] Flatten gal took : 117 ms
[2023-03-15 22:27:32] [INFO ] Flatten gal took : 39 ms
[2023-03-15 22:27:32] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 22 out of 193 places (down from 25) after GAL structural reductions.
Finished random walk after 193 steps, including 0 resets, run visited all 14 properties in 63 ms. (steps per millisecond=3 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 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 193 transition count 172
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 169 transition count 172
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 48 place count 169 transition count 157
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 78 place count 154 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 152 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 152 transition count 155
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 180 place count 103 transition count 106
Applied a total of 180 rules in 77 ms. Remains 103 /193 variables (removed 90) and now considering 106/196 (removed 90) transitions.
// Phase 1: matrix 106 rows 103 cols
[2023-03-15 22:27:33] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 22:27:33] [INFO ] Implicit Places using invariants in 215 ms returned [17, 22, 70, 85, 88, 93]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 229 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/193 places, 106/196 transitions.
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 14 place count 90 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 89 transition count 98
Applied a total of 16 rules in 33 ms. Remains 89 /97 variables (removed 8) and now considering 98/106 (removed 8) transitions.
// Phase 1: matrix 98 rows 89 cols
[2023-03-15 22:27:33] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:27:33] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-15 22:27:33] [INFO ] Invariant cache hit.
[2023-03-15 22:27:33] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:27:34] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 98/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 852 ms. Remains : 89/193 places, 98/196 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s72 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 567 ms.
Stack based approach found an accepted trace after 482 steps with 0 reset with depth 483 and stack size 389 in 4 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-02 finished in 1881 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 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 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 193 transition count 172
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 169 transition count 172
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 48 place count 169 transition count 155
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 152 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 150 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 150 transition count 153
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 184 place count 101 transition count 104
Applied a total of 184 rules in 43 ms. Remains 101 /193 variables (removed 92) and now considering 104/196 (removed 92) transitions.
// Phase 1: matrix 104 rows 101 cols
[2023-03-15 22:27:35] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-15 22:27:35] [INFO ] Implicit Places using invariants in 189 ms returned [17, 22, 34, 69, 82, 85, 90]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 205 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/193 places, 104/196 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 87 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 86 transition count 96
Applied a total of 16 rules in 17 ms. Remains 86 /94 variables (removed 8) and now considering 96/104 (removed 8) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-15 22:27:35] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:27:35] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-15 22:27:35] [INFO ] Invariant cache hit.
[2023-03-15 22:27:35] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:27:35] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 712 ms. Remains : 86/193 places, 96/196 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-03 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:(AND (EQ s33 0) (EQ s79 1))], 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 1695 reset in 270 ms.
Product exploration explored 100000 steps with 1693 reset in 287 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-15 22:27:36] [INFO ] Invariant cache hit.
[2023-03-15 22:27:37] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 22:27:37] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-15 22:27:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:27:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 22:27:37] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:37] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-15 22:27:37] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:27:37] [INFO ] [Nat]Added 67 Read/Feed constraints in 26 ms returned sat
[2023-03-15 22:27:37] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 5 ms to minimize.
[2023-03-15 22:27:37] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2023-03-15 22:27:37] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-15 22:27:37] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2023-03-15 22:27:38] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-15 22:27:38] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 13 ms to minimize.
[2023-03-15 22:27:38] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:27:38] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:27:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 894 ms
[2023-03-15 22:27:38] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-15 22:27:38] [INFO ] Added : 91 causal constraints over 19 iterations in 363 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-15 22:27:38] [INFO ] Invariant cache hit.
[2023-03-15 22:27:38] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 22:27:38] [INFO ] Invariant cache hit.
[2023-03-15 22:27:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:27:39] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-15 22:27:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 22:27:39] [INFO ] Invariant cache hit.
[2023-03-15 22:27:39] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 789 ms. Remains : 86/86 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 166 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 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
[2023-03-15 22:27:40] [INFO ] Invariant cache hit.
[2023-03-15 22:27:40] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-15 22:27:40] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:40] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-15 22:27:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:27:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-15 22:27:40] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:40] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-15 22:27:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:27:40] [INFO ] [Nat]Added 67 Read/Feed constraints in 23 ms returned sat
[2023-03-15 22:27:40] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2023-03-15 22:27:40] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-15 22:27:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:27:40] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-03-15 22:27:41] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-15 22:27:41] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:27:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:27:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-15 22:27:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 601 ms
[2023-03-15 22:27:41] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 22:27:41] [INFO ] Added : 91 causal constraints over 19 iterations in 357 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1695 reset in 287 ms.
Product exploration explored 100000 steps with 1691 reset in 289 ms.
Built C files in :
/tmp/ltsmin3714593554787661785
[2023-03-15 22:27:42] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2023-03-15 22:27:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:27:42] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2023-03-15 22:27:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:27:42] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2023-03-15 22:27:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:27:42] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3714593554787661785
Running compilation step : cd /tmp/ltsmin3714593554787661785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin3714593554787661785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin3714593554787661785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3846408617113371802.hoa' '--buchi-type=spotba'
LTSmin run took 4643 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-03 finished in 12607 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))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-15 22:27:47] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-15 22:27:48] [INFO ] Implicit Places using invariants in 481 ms returned [29, 37, 60, 137, 164, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 483 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 194/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 185/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s157 0) (NEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 766 ms.
Product exploration explored 100000 steps with 50000 reset in 522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLCardinality-04 finished in 2003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p1))||p0)))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 5 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2023-03-15 22:27:49] [INFO ] Invariant cache hit.
[2023-03-15 22:27:49] [INFO ] Implicit Places using invariants in 131 ms returned [29, 37, 60, 161, 164, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 147 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 185/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s144 0) (EQ s134 1)), p1:(OR (EQ s144 0) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 531 ms.
Product exploration explored 100000 steps with 25000 reset in 479 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 199 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:27:52] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-15 22:27:52] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-15 22:27:52] [INFO ] Invariant cache hit.
[2023-03-15 22:27:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:27:52] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-15 22:27:52] [INFO ] Invariant cache hit.
[2023-03-15 22:27:53] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1052 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 375 steps, including 0 resets, run visited all 2 properties in 34 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 279 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 280 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 532 ms.
Product exploration explored 100000 steps with 25000 reset in 560 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 278 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 37 place count 185 transition count 196
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 50 place count 185 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 178 transition count 188
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 178 transition count 188
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 108 place count 178 transition count 188
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 135 place count 151 transition count 161
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 162 place count 151 transition count 161
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 162 rules in 55 ms. Remains 151 /185 variables (removed 34) and now considering 161/194 (removed 33) transitions.
[2023-03-15 22:27:56] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 161 rows 151 cols
[2023-03-15 22:27:56] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:27:56] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/185 places, 161/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 151/185 places, 161/194 transitions.
Built C files in :
/tmp/ltsmin16498499358913107354
[2023-03-15 22:27:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16498499358913107354
Running compilation step : cd /tmp/ltsmin16498499358913107354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin16498499358913107354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16498499358913107354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4365158371088028687.hoa' '--buchi-type=spotba'
LTSmin run took 962 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-07 finished in 8617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-15 22:27:58] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-15 22:27:58] [INFO ] Implicit Places using invariants in 146 ms returned [29, 37, 60, 137, 161, 164, 169]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 159 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 184/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2 0) (NEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1139 reset in 191 ms.
Product exploration explored 100000 steps with 1145 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 194 rows 184 cols
[2023-03-15 22:27:59] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:27:59] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-15 22:27:59] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-15 22:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:28:00] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-15 22:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:28:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2023-03-15 22:28:00] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-15 22:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:28:00] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-15 22:28:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:28:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2023-03-15 22:28:00] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:28:03] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:28:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2344 ms
[2023-03-15 22:28:03] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-15 22:28:04] [INFO ] Added : 159 causal constraints over 32 iterations in 986 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 22:28:04] [INFO ] Invariant cache hit.
[2023-03-15 22:28:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 22:28:04] [INFO ] Invariant cache hit.
[2023-03-15 22:28:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:28:04] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2023-03-15 22:28:04] [INFO ] Invariant cache hit.
[2023-03-15 22:28:04] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 184/184 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-15 22:28:05] [INFO ] Invariant cache hit.
[2023-03-15 22:28:06] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-15 22:28:06] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-15 22:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:28:06] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-15 22:28:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:28:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-15 22:28:06] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:28:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:28:06] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-15 22:28:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:28:06] [INFO ] [Nat]Added 68 Read/Feed constraints in 24 ms returned sat
[2023-03-15 22:28:06] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
[2023-03-15 22:28:06] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 3 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:28:09] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:28:09] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:28:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2463 ms
[2023-03-15 22:28:09] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-15 22:28:10] [INFO ] Added : 184 causal constraints over 37 iterations in 1260 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1146 reset in 285 ms.
Product exploration explored 100000 steps with 1138 reset in 249 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 184 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 38 place count 184 transition count 196
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 184 transition count 196
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 175 transition count 186
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 175 transition count 186
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 113 place count 175 transition count 186
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 142 place count 146 transition count 157
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 171 place count 146 transition count 157
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 171 rules in 37 ms. Remains 146 /184 variables (removed 38) and now considering 157/194 (removed 37) transitions.
[2023-03-15 22:28:11] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 157 rows 146 cols
[2023-03-15 22:28:11] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:28:11] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/184 places, 157/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 146/184 places, 157/194 transitions.
Built C files in :
/tmp/ltsmin9711252872540306030
[2023-03-15 22:28:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9711252872540306030
Running compilation step : cd /tmp/ltsmin9711252872540306030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 624 ms.
Running link step : cd /tmp/ltsmin9711252872540306030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9711252872540306030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8143690646330412450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-15 22:28:26] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:28:27] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 22:28:27] [INFO ] Invariant cache hit.
[2023-03-15 22:28:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:28:27] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-15 22:28:27] [INFO ] Invariant cache hit.
[2023-03-15 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 184/184 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin5976796590963870686
[2023-03-15 22:28:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5976796590963870686
Running compilation step : cd /tmp/ltsmin5976796590963870686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 715 ms.
Running link step : cd /tmp/ltsmin5976796590963870686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5976796590963870686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2303385616551865059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 22:28:42] [INFO ] Flatten gal took : 16 ms
[2023-03-15 22:28:42] [INFO ] Flatten gal took : 15 ms
[2023-03-15 22:28:42] [INFO ] Time to serialize gal into /tmp/LTL3399755234379029984.gal : 5 ms
[2023-03-15 22:28:42] [INFO ] Time to serialize properties into /tmp/LTL1279856690847254629.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3399755234379029984.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3219171081471914985.hoa' '-atoms' '/tmp/LTL1279856690847254629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1279856690847254629.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3219171081471914985.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...442
Detected timeout of ITS tools.
[2023-03-15 22:28:57] [INFO ] Flatten gal took : 12 ms
[2023-03-15 22:28:57] [INFO ] Flatten gal took : 12 ms
[2023-03-15 22:28:57] [INFO ] Time to serialize gal into /tmp/LTL12992501748576127252.gal : 3 ms
[2023-03-15 22:28:57] [INFO ] Time to serialize properties into /tmp/LTL2059457211944825003.ltl : 2 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/LTL12992501748576127252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2059457211944825003.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((ch_CF_free!=0)&&(A2L_rot3_in!=1))")))))
Formula 0 simplified : XXG!"((ch_CF_free!=0)&&(A2L_rot3_in!=1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...442
Detected timeout of ITS tools.
[2023-03-15 22:29:12] [INFO ] Flatten gal took : 13 ms
[2023-03-15 22:29:12] [INFO ] Applying decomposition
[2023-03-15 22:29:12] [INFO ] Flatten gal took : 12 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/graph18131833056818008910.txt' '-o' '/tmp/graph18131833056818008910.bin' '-w' '/tmp/graph18131833056818008910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18131833056818008910.bin' '-l' '-1' '-v' '-w' '/tmp/graph18131833056818008910.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:29:13] [INFO ] Decomposing Gal with order
[2023-03-15 22:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:29:13] [INFO ] Removed a total of 48 redundant transitions.
[2023-03-15 22:29:13] [INFO ] Flatten gal took : 87 ms
[2023-03-15 22:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-15 22:29:13] [INFO ] Time to serialize gal into /tmp/LTL9280973891137169937.gal : 8 ms
[2023-03-15 22:29:13] [INFO ] Time to serialize properties into /tmp/LTL10672214250963487807.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/LTL9280973891137169937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10672214250963487807.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 : !((X(X(F("((i3.u0.ch_CF_free!=0)&&(i4.i1.u45.A2L_rot3_in!=1))")))))
Formula 0 simplified : XXG!"((i3.u0.ch_CF_free!=0)&&(i4.i1.u45.A2L_rot3_in!=1))"
Reverse transition relation is NOT exact ! Due to transitions t62, t118, i0.i0.u1.t10, i0.i0.u9.t6, i0.i1.u10.t14, i1.i0.u3.t22, i1.i0.u15.t34, i1.i0.u16.t...869
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
113 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.15911,47892,1,0,68595,163,3242,72942,141,347,211619
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-3-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-08 finished in 76362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((G(p0)||F(p1))) U p2))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 193 transition count 175
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 172 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 170 transition count 173
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 46 place count 170 transition count 156
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 80 place count 153 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 151 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 151 transition count 154
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 172 place count 107 transition count 110
Applied a total of 172 rules in 26 ms. Remains 107 /193 variables (removed 86) and now considering 110/196 (removed 86) transitions.
// Phase 1: matrix 110 rows 107 cols
[2023-03-15 22:29:14] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-15 22:29:14] [INFO ] Implicit Places using invariants in 182 ms returned [23, 35, 75, 89, 92, 97]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 185 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/193 places, 110/196 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 94 transition count 103
Applied a total of 14 rules in 6 ms. Remains 94 /101 variables (removed 7) and now considering 103/110 (removed 7) transitions.
// Phase 1: matrix 103 rows 94 cols
[2023-03-15 22:29:14] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-15 22:29:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 22:29:14] [INFO ] Invariant cache hit.
[2023-03-15 22:29:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:29:15] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/193 places, 103/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 599 ms. Remains : 94/193 places, 103/196 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=1 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s57 0) (EQ s9 1)), p0:(EQ s17 1), p1:(EQ s78 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 855 reset in 327 ms.
Product exploration explored 100000 steps with 830 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 10 factoid took 1219 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 434 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Finished random walk after 157 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 10 factoid took 1803 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 432 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 426 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-15 22:29:20] [INFO ] Invariant cache hit.
[2023-03-15 22:29:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-15 22:29:20] [INFO ] Invariant cache hit.
[2023-03-15 22:29:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:29:21] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-15 22:29:21] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 22:29:21] [INFO ] Invariant cache hit.
[2023-03-15 22:29:21] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 94/94 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p2), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X p2)), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0))))]
Knowledge based reduction with 10 factoid took 1431 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 163 steps, including 0 resets, run visited all 8 properties in 10 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p2), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), true, (X (X p2)), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 1806 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 422 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 428 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 841 reset in 273 ms.
Product exploration explored 100000 steps with 865 reset in 303 ms.
Built C files in :
/tmp/ltsmin3467176638597493734
[2023-03-15 22:29:26] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2023-03-15 22:29:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:29:26] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2023-03-15 22:29:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:29:26] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2023-03-15 22:29:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:29:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3467176638597493734
Running compilation step : cd /tmp/ltsmin3467176638597493734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin3467176638597493734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3467176638597493734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12740780867804140644.hoa' '--buchi-type=spotba'
LTSmin run took 10294 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-11 finished in 23196 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))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 195
Applied a total of 2 rules in 4 ms. Remains 192 /193 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 192 cols
[2023-03-15 22:29:37] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-15 22:29:37] [INFO ] Implicit Places using invariants in 160 ms returned [29, 37, 60, 138, 162, 165, 170]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 162 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 195/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 185/193 places, 195/196 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s87 0) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-13 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((p1 U F(X(X(p1)))) U (X(p2) U p3))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 5 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-15 22:29:38] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-15 22:29:38] [INFO ] Implicit Places using invariants in 179 ms returned [29, 60, 137, 161, 169]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 180 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 186/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (EQ s160 0) (EQ s53 1)), p0:(EQ s137 1), p2:(OR (EQ s177 0) (EQ s12 1)), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35121 reset in 437 ms.
Product exploration explored 100000 steps with 35178 reset in 481 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (X p2)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 637 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:29:40] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:29:40] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:29:40] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-15 22:29:40] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (X p2)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p3) p0)), (F p3), (F (NOT (AND (NOT p3) (NOT p0))))]
Knowledge based reduction with 10 factoid took 910 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2023-03-15 22:29:41] [INFO ] Invariant cache hit.
[2023-03-15 22:29:42] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:29:42] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-15 22:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:29:42] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-15 22:29:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:29:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-15 22:29:42] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-15 22:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:29:42] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-15 22:29:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:29:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 36 ms returned sat
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 3 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:29:43] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 5 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:29:44] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 14 ms to minimize.
[2023-03-15 22:29:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2654 ms
[2023-03-15 22:29:45] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 22:29:46] [INFO ] Added : 186 causal constraints over 38 iterations in 1288 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 22:29:46] [INFO ] Invariant cache hit.
[2023-03-15 22:29:47] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-15 22:29:47] [INFO ] Invariant cache hit.
[2023-03-15 22:29:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:29:47] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-15 22:29:47] [INFO ] Invariant cache hit.
[2023-03-15 22:29:47] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1055 ms. Remains : 186/186 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (X p2)), (X (X (NOT (AND (NOT p3) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 623 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0))), (X (X p2)), (X (X (NOT (AND (NOT p3) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (NOT p1)), (F (NOT p2)), (F (AND p0 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 8 factoid took 776 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2023-03-15 22:29:49] [INFO ] Invariant cache hit.
[2023-03-15 22:29:50] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 22:29:50] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-15 22:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:29:50] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-15 22:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:29:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 22:29:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:29:50] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-15 22:29:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:29:50] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2023-03-15 22:29:50] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-15 22:29:50] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 6 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:29:51] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-15 22:29:52] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:29:53] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:29:53] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:29:53] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-15 22:29:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2427 ms
[2023-03-15 22:29:53] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 22:29:54] [INFO ] Added : 186 causal constraints over 38 iterations in 1280 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 35177 reset in 429 ms.
Product exploration explored 100000 steps with 35017 reset in 388 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 194
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 24 place count 186 transition count 195
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 42 place count 186 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 181 transition count 190
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 181 transition count 190
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 89 place count 181 transition count 190
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 163 transition count 172
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 163 transition count 172
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 125 rules in 19 ms. Remains 163 /186 variables (removed 23) and now considering 172/194 (removed 22) transitions.
[2023-03-15 22:29:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 172 rows 163 cols
[2023-03-15 22:29:55] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:29:55] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/186 places, 172/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 163/186 places, 172/194 transitions.
Built C files in :
/tmp/ltsmin8761772930436257629
[2023-03-15 22:29:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8761772930436257629
Running compilation step : cd /tmp/ltsmin8761772930436257629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 687 ms.
Running link step : cd /tmp/ltsmin8761772930436257629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8761772930436257629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15190167331502684503.hoa' '--buchi-type=spotba'
LTSmin run took 7402 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-14 finished in 25981 ms.
All properties solved by simple procedures.
Total runtime 154771 ms.
BK_STOP 1678919405122
--------------------
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="ParamProductionCell-PT-3"
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 ParamProductionCell-PT-3, 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 r261-smll-167863536300387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ;