About the Execution of ITS-Tools for HypertorusGrid-PT-d3k3p2b06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.548 | 3600000.00 | 3584358.00 | 309456.50 | FTFF?FF?FTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820300051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HypertorusGrid-PT-d3k3p2b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820300051
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K Apr 30 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 09:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 09:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 522K May 10 09:34 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 HypertorusGrid-PT-d3k3p2b06-LTLCardinality-00
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-01
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-02
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-03
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-04
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-05
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-06
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-07
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-08
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-09
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652737708027
Running Version 202205111006
[2022-05-16 21:48:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 21:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 21:48:29] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-05-16 21:48:29] [INFO ] Transformed 513 places.
[2022-05-16 21:48:29] [INFO ] Transformed 972 transitions.
[2022-05-16 21:48:29] [INFO ] Parsed PT model containing 513 places and 972 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 58 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:29] [INFO ] Computed 190 place invariants in 47 ms
[2022-05-16 21:48:30] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:30] [INFO ] Computed 190 place invariants in 28 ms
[2022-05-16 21:48:30] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:30] [INFO ] Computed 190 place invariants in 16 ms
[2022-05-16 21:48:31] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Support contains 40 out of 513 places after structural reductions.
[2022-05-16 21:48:31] [INFO ] Flatten gal took : 106 ms
[2022-05-16 21:48:31] [INFO ] Flatten gal took : 68 ms
[2022-05-16 21:48:31] [INFO ] Input system was already deterministic with 972 transitions.
Support contains 38 out of 513 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:32] [INFO ] Computed 190 place invariants in 10 ms
[2022-05-16 21:48:32] [INFO ] [Real]Absence check using 189 positive place invariants in 27 ms returned sat
[2022-05-16 21:48:32] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 21:48:32] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-16 21:48:33] [INFO ] [Nat]Absence check using 189 positive place invariants in 40 ms returned sat
[2022-05-16 21:48:33] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-16 21:48:33] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-16 21:48:33] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-16 21:48:33] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 189 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&((G(p1)||p2) U p3)))'
Support contains 7 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 20 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:34] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:48:34] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:34] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:48:34] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:34] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 21:48:35] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p1), (NOT p3), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=0 dest: 3}, { cond=(OR p3 p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s498 s186), p2:(LEQ s158 s80), p1:(LEQ 2 s102), p0:(LEQ s485 s362)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 820 reset in 3410 ms.
Product exploration explored 100000 steps with 870 reset in 3474 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 p3 p2 p1 (NOT p0)), (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), true, (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 554 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 155 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p3 p2 p1 (NOT p0)), (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), true, (X (X (NOT (OR (AND (NOT p3) p2) (AND (NOT p3) p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 8 factoid took 395 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:43] [INFO ] Computed 190 place invariants in 13 ms
[2022-05-16 21:48:44] [INFO ] [Real]Absence check using 189 positive place invariants in 85 ms returned sat
[2022-05-16 21:48:44] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 178 ms returned sat
[2022-05-16 21:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:48:44] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2022-05-16 21:48:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:48:45] [INFO ] [Nat]Absence check using 189 positive place invariants in 95 ms returned sat
[2022-05-16 21:48:45] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 21:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:48:45] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-05-16 21:48:46] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-16 21:48:47] [INFO ] Added : 161 causal constraints over 33 iterations in 1717 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 51 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:47] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:48:47] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:47] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:48:48] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2022-05-16 21:48:48] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:48] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:48:48] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:48:49] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:48:49] [INFO ] [Real]Absence check using 189 positive place invariants in 86 ms returned sat
[2022-05-16 21:48:50] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 180 ms returned sat
[2022-05-16 21:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:48:50] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2022-05-16 21:48:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:48:51] [INFO ] [Nat]Absence check using 189 positive place invariants in 93 ms returned sat
[2022-05-16 21:48:51] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 5 ms returned sat
[2022-05-16 21:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:48:51] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2022-05-16 21:48:51] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-16 21:48:53] [INFO ] Added : 161 causal constraints over 33 iterations in 1670 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 865 reset in 3294 ms.
Product exploration explored 100000 steps with 844 reset in 3430 ms.
Built C files in :
/tmp/ltsmin7969018649955923238
[2022-05-16 21:49:00] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:49:00] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:49:00] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:49:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:49:00] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:49:00] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:49:00] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7969018649955923238
Running compilation step : cd /tmp/ltsmin7969018649955923238;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2736 ms.
Running link step : cd /tmp/ltsmin7969018649955923238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 341 ms.
Running LTSmin : cd /tmp/ltsmin7969018649955923238;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7890076004361253353.hoa' '--buchi-type=spotba'
LTSmin run took 9070 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-02 finished in 38720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!G(X(p0)) U !X(X((p1 U p0)))))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:12] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:49:12] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:12] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:49:13] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:13] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:49:13] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 471 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s61 s138), p0:(LEQ 2 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 47 reset in 3075 ms.
Product exploration explored 100000 steps with 43 reset in 3101 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[p0, p0, p0, p0, p0]
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, p0, p0]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:21] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:49:22] [INFO ] [Real]Absence check using 189 positive place invariants in 607 ms returned sat
[2022-05-16 21:49:22] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-16 21:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:49:22] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2022-05-16 21:49:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:49:23] [INFO ] [Nat]Absence check using 189 positive place invariants in 115 ms returned sat
[2022-05-16 21:49:23] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 21:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:49:23] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-05-16 21:49:23] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-16 21:49:25] [INFO ] Added : 160 causal constraints over 32 iterations in 1614 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:25] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:49:25] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:25] [INFO ] Computed 190 place invariants in 12 ms
[2022-05-16 21:49:26] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:26] [INFO ] Computed 190 place invariants in 12 ms
[2022-05-16 21:49:26] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 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 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, p0, p0]
Finished random walk after 240 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 247 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 175 ms :[p0, p0, p0, p0, p0]
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:27] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:49:28] [INFO ] [Real]Absence check using 189 positive place invariants in 586 ms returned sat
[2022-05-16 21:49:28] [INFO ] [Real]Absence check using 189 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 21:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:49:29] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2022-05-16 21:49:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:49:29] [INFO ] [Nat]Absence check using 189 positive place invariants in 112 ms returned sat
[2022-05-16 21:49:29] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 21:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:49:30] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-05-16 21:49:30] [INFO ] Computed and/alt/rep : 810/810/810 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-16 21:49:31] [INFO ] Added : 160 causal constraints over 32 iterations in 1572 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 1515 ms :[p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 60 reset in 2965 ms.
Product exploration explored 100000 steps with 59 reset in 3132 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 183 ms :[p0, p0, p0, p0, p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2022-05-16 21:49:39] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:39] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:49:40] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Product exploration explored 100000 steps with 45 reset in 2999 ms.
Product exploration explored 100000 steps with 16 reset in 3049 ms.
Built C files in :
/tmp/ltsmin4371921881531268968
[2022-05-16 21:49:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4371921881531268968
Running compilation step : cd /tmp/ltsmin4371921881531268968;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1630 ms.
Running link step : cd /tmp/ltsmin4371921881531268968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4371921881531268968;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2183648975347597340.hoa' '--buchi-type=spotba'
LTSmin run took 4320 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-03 finished in 39953 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(X(F((p0 U p1))))&&F(p0))))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 34 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:52] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:49:52] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:52] [INFO ] Computed 190 place invariants in 9 ms
[2022-05-16 21:49:53] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2022-05-16 21:49:53] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:49:53] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:49:53] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s280 s300), p1:(LEQ s119 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 231 reset in 3190 ms.
Product exploration explored 100000 steps with 193 reset in 3224 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 406 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 20 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:01] [INFO ] Computed 190 place invariants in 11 ms
[2022-05-16 21:50:01] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:01] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:50:02] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2022-05-16 21:50:02] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:02] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:50:02] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 512 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 194 reset in 3021 ms.
Product exploration explored 100000 steps with 284 reset in 3335 ms.
Built C files in :
/tmp/ltsmin9644819238591083790
[2022-05-16 21:50:09] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:50:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:09] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:50:09] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:10] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:50:10] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:10] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9644819238591083790
Running compilation step : cd /tmp/ltsmin9644819238591083790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2738 ms.
Running link step : cd /tmp/ltsmin9644819238591083790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9644819238591083790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15505293241832574331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:25] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:50:25] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:25] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:50:25] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2022-05-16 21:50:25] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:50:25] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:50:26] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin5420409782204119632
[2022-05-16 21:50:26] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:50:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:26] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:50:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:26] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:50:26] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:50:26] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5420409782204119632
Running compilation step : cd /tmp/ltsmin5420409782204119632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2684 ms.
Running link step : cd /tmp/ltsmin5420409782204119632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5420409782204119632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8106807360729608227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:50:41] [INFO ] Flatten gal took : 52 ms
[2022-05-16 21:50:41] [INFO ] Flatten gal took : 47 ms
[2022-05-16 21:50:41] [INFO ] Time to serialize gal into /tmp/LTL2119805272465578203.gal : 7 ms
[2022-05-16 21:50:41] [INFO ] Time to serialize properties into /tmp/LTL11734646425883193859.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2119805272465578203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11734646425883193859.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2119805...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G((X(X(F(("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")U("(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)")))))&&(F("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1...164
Formula 0 simplified : !FXG(XXF("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)" U "(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)") & F"(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")
Detected timeout of ITS tools.
[2022-05-16 21:50:56] [INFO ] Flatten gal took : 46 ms
[2022-05-16 21:50:56] [INFO ] Applying decomposition
[2022-05-16 21:50:56] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15927890093468309437.txt' '-o' '/tmp/graph15927890093468309437.bin' '-w' '/tmp/graph15927890093468309437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15927890093468309437.bin' '-l' '-1' '-v' '-w' '/tmp/graph15927890093468309437.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:50:56] [INFO ] Decomposing Gal with order
[2022-05-16 21:50:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:50:57] [INFO ] Removed a total of 1294 redundant transitions.
[2022-05-16 21:50:57] [INFO ] Flatten gal took : 130 ms
[2022-05-16 21:50:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 74 ms.
[2022-05-16 21:50:57] [INFO ] Time to serialize gal into /tmp/LTL9683095361695497342.gal : 7 ms
[2022-05-16 21:50:57] [INFO ] Time to serialize properties into /tmp/LTL8487437103666898719.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9683095361695497342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8487437103666898719.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9683095...266
Read 1 LTL properties
Checking formula 0 : !((F(X(G((X(X(F(("(gu71.pil_d1_n1_2_1_2<=gu71.pil_d2_n1_1_2_1)")U("(gu2.pb_d3_n1_2_1_3<=gu2.pb_d1_n1_2_2_1)")))))&&(F("(gu71.pil_d1_n1...192
Formula 0 simplified : !FXG(XXF("(gu71.pil_d1_n1_2_1_2<=gu71.pil_d2_n1_1_2_1)" U "(gu2.pb_d3_n1_2_1_3<=gu2.pb_d1_n1_2_2_1)") & F"(gu71.pil_d1_n1_2_1_2<=gu7...175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5700460267502921078
[2022-05-16 21:51:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5700460267502921078
Running compilation step : cd /tmp/ltsmin5700460267502921078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1651 ms.
Running link step : cd /tmp/ltsmin5700460267502921078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5700460267502921078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-04 finished in 95022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&G(p1))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:27] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:51:27] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:27] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:51:28] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:28] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:51:28] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s140 s125), p1:(GT 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-06 finished in 1387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(X(p0))&&F(p1)))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:28] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:51:29] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:29] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:51:29] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:29] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:51:30] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(LEQ s243 s350), p0:(LEQ 2 s54)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7709 reset in 2837 ms.
Product exploration explored 100000 steps with 9656 reset in 2981 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 p1 p0), (X p1), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 1133 steps, including 0 resets, run visited all 3 properties in 53 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 p0), (X p1), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 587 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:37] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:51:38] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:38] [INFO ] Computed 190 place invariants in 11 ms
[2022-05-16 21:51:38] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:38] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:51:38] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 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 p1 p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 320 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7283 reset in 2856 ms.
Product exploration explored 100000 steps with 8020 reset in 3003 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2022-05-16 21:51:46] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:51:46] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 21:51:46] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Product exploration explored 100000 steps with 9771 reset in 2893 ms.
Product exploration explored 100000 steps with 8915 reset in 3030 ms.
Built C files in :
/tmp/ltsmin13917655621079866692
[2022-05-16 21:51:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13917655621079866692
Running compilation step : cd /tmp/ltsmin13917655621079866692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1610 ms.
Running link step : cd /tmp/ltsmin13917655621079866692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13917655621079866692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2627000712317031556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:52:07] [INFO ] Computed 190 place invariants in 8 ms
[2022-05-16 21:52:08] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:52:08] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:52:08] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:52:08] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:52:09] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin13446878352891192181
[2022-05-16 21:52:09] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13446878352891192181
Running compilation step : cd /tmp/ltsmin13446878352891192181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1556 ms.
Running link step : cd /tmp/ltsmin13446878352891192181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13446878352891192181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12606350777625384779.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:52:24] [INFO ] Flatten gal took : 37 ms
[2022-05-16 21:52:24] [INFO ] Flatten gal took : 44 ms
[2022-05-16 21:52:24] [INFO ] Time to serialize gal into /tmp/LTL14048688191413784327.gal : 5 ms
[2022-05-16 21:52:24] [INFO ] Time to serialize properties into /tmp/LTL14890534706583241448.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14048688191413784327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14890534706583241448.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1404868...268
Read 1 LTL properties
Checking formula 0 : !((F(X((X(X("(pb_d2_n1_1_1_1>=2)")))&&(F("(pi_d3_n1_1_1_1<=pil_d3_n1_3_3_3)"))))))
Formula 0 simplified : !FX(XX"(pb_d2_n1_1_1_1>=2)" & F"(pi_d3_n1_1_1_1<=pil_d3_n1_3_3_3)")
Detected timeout of ITS tools.
[2022-05-16 21:52:39] [INFO ] Flatten gal took : 34 ms
[2022-05-16 21:52:39] [INFO ] Applying decomposition
[2022-05-16 21:52:39] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8672542279549708012.txt' '-o' '/tmp/graph8672542279549708012.bin' '-w' '/tmp/graph8672542279549708012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8672542279549708012.bin' '-l' '-1' '-v' '-w' '/tmp/graph8672542279549708012.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:52:39] [INFO ] Decomposing Gal with order
[2022-05-16 21:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:52:39] [INFO ] Removed a total of 1286 redundant transitions.
[2022-05-16 21:52:39] [INFO ] Flatten gal took : 141 ms
[2022-05-16 21:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 59 ms.
[2022-05-16 21:52:39] [INFO ] Time to serialize gal into /tmp/LTL14444650741324209795.gal : 9 ms
[2022-05-16 21:52:39] [INFO ] Time to serialize properties into /tmp/LTL630876436763161959.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14444650741324209795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL630876436763161959.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1444465...266
Read 1 LTL properties
Checking formula 0 : !((F(X((X(X("(gi0.gi0.gi2.gu6.pb_d2_n1_1_1_1>=2)")))&&(F("(gu46.pi_d3_n1_1_1_1<=gu46.pil_d3_n1_3_3_3)"))))))
Formula 0 simplified : !FX(XX"(gi0.gi0.gi2.gu6.pb_d2_n1_1_1_1>=2)" & F"(gu46.pi_d3_n1_1_1_1<=gu46.pil_d3_n1_3_3_3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13204881196282443390
[2022-05-16 21:52:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13204881196282443390
Running compilation step : cd /tmp/ltsmin13204881196282443390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1560 ms.
Running link step : cd /tmp/ltsmin13204881196282443390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13204881196282443390;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((X(X((LTLAPp0==true)))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-07 finished in 101356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:10] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:53:10] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:10] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:11] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:11] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:11] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s317 s476)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-08 finished in 1518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:11] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 21:53:12] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:12] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:12] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:12] [INFO ] Computed 190 place invariants in 11 ms
[2022-05-16 21:53:13] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s174 s369)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1581 ms.
Product exploration explored 100000 steps with 50000 reset in 1717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-10 finished in 4963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0 U X(p1))))||p2)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:16] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:16] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:16] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:17] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:17] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:18] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 1 s271), p0:(LEQ 3 s28), p1:(LEQ s403 s59)], 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 33346 reset in 2025 ms.
Product exploration explored 100000 steps with 33400 reset in 2117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 8 factoid took 623 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:23] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:53:23] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 21:53:23] [INFO ] [Nat]Absence check using 189 positive place invariants in 22 ms returned sat
[2022-05-16 21:53:23] [INFO ] [Nat]Absence check using 189 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-16 21:53:24] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 21:53:24] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-16 21:53:24] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 34 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 657 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:25] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:25] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:25] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:26] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:26] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:26] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 536 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 7192 steps, including 2 resets, run visited all 6 properties in 248 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p2), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 622 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33402 reset in 1972 ms.
Product exploration explored 100000 steps with 33547 reset in 2116 ms.
Built C files in :
/tmp/ltsmin861267671365147952
[2022-05-16 21:53:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin861267671365147952
Running compilation step : cd /tmp/ltsmin861267671365147952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1596 ms.
Running link step : cd /tmp/ltsmin861267671365147952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin861267671365147952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13348485308647245669.hoa' '--buchi-type=spotba'
LTSmin run took 7814 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-12 finished in 25559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((X(F(p0)) U G((p0 U G(p1))))))) U G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:42] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 21:53:42] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:42] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:43] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2022-05-16 21:53:43] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:43] [INFO ] Computed 190 place invariants in 5 ms
[2022-05-16 21:53:43] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p1)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s253), p1:(LEQ 3 s104)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 73274 steps with 0 reset in 1825 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-13 finished in 3268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(G((p0 U p1)))))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:45] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:45] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:45] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:46] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2022-05-16 21:53:46] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:46] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:46] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s385), p0:(LEQ s229 s296)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 328 reset in 3308 ms.
Product exploration explored 100000 steps with 346 reset in 3496 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 p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1783 steps, including 0 resets, run visited all 3 properties in 73 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p1 p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:54] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:55] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:55] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:53:55] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2022-05-16 21:53:55] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:53:55] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:53:56] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2888 steps, including 0 resets, run visited all 3 properties in 111 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 372 reset in 3331 ms.
Product exploration explored 100000 steps with 310 reset in 3446 ms.
Built C files in :
/tmp/ltsmin7357262376353696593
[2022-05-16 21:54:04] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:54:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:04] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:54:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:04] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:54:04] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:04] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7357262376353696593
Running compilation step : cd /tmp/ltsmin7357262376353696593;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2686 ms.
Running link step : cd /tmp/ltsmin7357262376353696593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7357262376353696593;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15101812868627656622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 972/972 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 972/972 (removed 0) transitions.
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:54:19] [INFO ] Computed 190 place invariants in 3 ms
[2022-05-16 21:54:19] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:54:19] [INFO ] Computed 190 place invariants in 4 ms
[2022-05-16 21:54:19] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2022-05-16 21:54:19] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 972 rows 513 cols
[2022-05-16 21:54:20] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 21:54:20] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 972/972 transitions.
Built C files in :
/tmp/ltsmin11961534873826319213
[2022-05-16 21:54:20] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:54:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:20] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:54:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:20] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:54:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:54:20] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11961534873826319213
Running compilation step : cd /tmp/ltsmin11961534873826319213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2763 ms.
Running link step : cd /tmp/ltsmin11961534873826319213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11961534873826319213;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11347351693607916916.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:54:35] [INFO ] Flatten gal took : 33 ms
[2022-05-16 21:54:35] [INFO ] Flatten gal took : 36 ms
[2022-05-16 21:54:35] [INFO ] Time to serialize gal into /tmp/LTL4244213648225446502.gal : 6 ms
[2022-05-16 21:54:35] [INFO ] Time to serialize properties into /tmp/LTL5645167414665101997.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4244213648225446502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5645167414665101997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4244213...266
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(G(("(pi_d2_n1_2_2_2<=pil_d1_n1_3_3_3)")U("(po_d2_n1_1_3_2<1)"))))))))
Formula 0 simplified : !FXGXG("(pi_d2_n1_2_2_2<=pil_d1_n1_3_3_3)" U "(po_d2_n1_1_3_2<1)")
Detected timeout of ITS tools.
[2022-05-16 21:54:50] [INFO ] Flatten gal took : 37 ms
[2022-05-16 21:54:50] [INFO ] Applying decomposition
[2022-05-16 21:54:50] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3090305439639744742.txt' '-o' '/tmp/graph3090305439639744742.bin' '-w' '/tmp/graph3090305439639744742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3090305439639744742.bin' '-l' '-1' '-v' '-w' '/tmp/graph3090305439639744742.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:54:50] [INFO ] Decomposing Gal with order
[2022-05-16 21:54:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:54:50] [INFO ] Removed a total of 1286 redundant transitions.
[2022-05-16 21:54:50] [INFO ] Flatten gal took : 57 ms
[2022-05-16 21:54:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 27 ms.
[2022-05-16 21:54:50] [INFO ] Time to serialize gal into /tmp/LTL12728701977302791031.gal : 6 ms
[2022-05-16 21:54:50] [INFO ] Time to serialize properties into /tmp/LTL15799503984277536013.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12728701977302791031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15799503984277536013.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1272870...268
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(G(("(gu49.pi_d2_n1_2_2_2<=gu49.pil_d1_n1_3_3_3)")U("(gi2.gu163.po_d2_n1_1_3_2<1)"))))))))
Formula 0 simplified : !FXGXG("(gu49.pi_d2_n1_2_2_2<=gu49.pil_d1_n1_3_3_3)" U "(gi2.gu163.po_d2_n1_1_3_2<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7700603985077679438
[2022-05-16 21:55:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7700603985077679438
Running compilation step : cd /tmp/ltsmin7700603985077679438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1559 ms.
Running link step : cd /tmp/ltsmin7700603985077679438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7700603985077679438;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](X([](((LTLAPp0==true) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
LTSmin run took 5290 ms.
FORMULA HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HypertorusGrid-PT-d3k3p2b06-LTLCardinality-15 finished in 87286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(X(F((p0 U p1))))&&F(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(X(p0))&&F(p1)))))'
[2022-05-16 21:55:13] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9700190353826124320
[2022-05-16 21:55:13] [INFO ] Computing symmetric may disable matrix : 972 transitions.
[2022-05-16 21:55:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:55:13] [INFO ] Computing symmetric may enable matrix : 972 transitions.
[2022-05-16 21:55:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:55:13] [INFO ] Applying decomposition
[2022-05-16 21:55:13] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8632277870476446869.txt' '-o' '/tmp/graph8632277870476446869.bin' '-w' '/tmp/graph8632277870476446869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8632277870476446869.bin' '-l' '-1' '-v' '-w' '/tmp/graph8632277870476446869.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:55:13] [INFO ] Decomposing Gal with order
[2022-05-16 21:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:55:13] [INFO ] Computing Do-Not-Accords matrix : 972 transitions.
[2022-05-16 21:55:13] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:55:13] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9700190353826124320
Running compilation step : cd /tmp/ltsmin9700190353826124320;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 21:55:13] [INFO ] Removed a total of 1284 redundant transitions.
[2022-05-16 21:55:13] [INFO ] Flatten gal took : 54 ms
[2022-05-16 21:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 16 ms.
[2022-05-16 21:55:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality10065188400832128141.gal : 5 ms
[2022-05-16 21:55:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality3672902358724878509.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10065188400832128141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3672902358724878509.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((F(X(G((X(X(F(("(gu75.pil_d1_n1_2_1_2<=gu75.pil_d2_n1_1_2_1)")U("(gu2.pb_d3_n1_2_1_3<=gu2.pb_d1_n1_2_2_1)")))))&&(F("(gu75.pil_d1_n1...192
Formula 0 simplified : !FXG(XXF("(gu75.pil_d1_n1_2_1_2<=gu75.pil_d2_n1_1_2_1)" U "(gu2.pb_d3_n1_2_1_3<=gu2.pb_d1_n1_2_2_1)") & F"(gu75.pil_d1_n1_2_1_2<=gu7...175
Compilation finished in 2618 ms.
Running link step : cd /tmp/ltsmin9700190353826124320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9700190353826124320;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.073: LTL layer: formula: <>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))
pins2lts-mc-linux64( 1/ 8), 0.073: "<>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.074: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.183: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.275: DFS-FIFO for weak LTL, using special progress label 977
pins2lts-mc-linux64( 0/ 8), 0.275: There are 978 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.275: State length is 514, there are 977 groups
pins2lts-mc-linux64( 0/ 8), 0.275: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.275: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.275: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.275: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.962: ~1 levels ~960 states ~161152 transitions
pins2lts-mc-linux64( 1/ 8), 2.794: ~1 levels ~1920 states ~324416 transitions
pins2lts-mc-linux64( 1/ 8), 3.852: ~1 levels ~3840 states ~649728 transitions
pins2lts-mc-linux64( 3/ 8), 5.764: ~56 levels ~7680 states ~1325936 transitions
pins2lts-mc-linux64( 1/ 8), 9.657: ~1206 levels ~15360 states ~3071424 transitions
pins2lts-mc-linux64( 6/ 8), 16.377: ~3642 levels ~30720 states ~5777080 transitions
pins2lts-mc-linux64( 1/ 8), 23.236: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 28.834:
pins2lts-mc-linux64( 0/ 8), 28.834: mean standard work distribution: 5.6% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 28.834:
pins2lts-mc-linux64( 0/ 8), 28.834: Explored 35504 states 6889145 transitions, fanout: 194.039
pins2lts-mc-linux64( 0/ 8), 28.834: Total exploration time 28.520 sec (24.050 sec minimum, 25.641 sec on average)
pins2lts-mc-linux64( 0/ 8), 28.834: States per second: 1245, Transitions per second: 241555
pins2lts-mc-linux64( 0/ 8), 28.834:
pins2lts-mc-linux64( 0/ 8), 28.834: Progress states detected: 246336
pins2lts-mc-linux64( 0/ 8), 28.834: Redundant explorations: -99.4774
pins2lts-mc-linux64( 0/ 8), 28.834:
pins2lts-mc-linux64( 0/ 8), 28.834: Queue width: 8B, total height: 288012, memory: 2.20MB
pins2lts-mc-linux64( 0/ 8), 28.834: Tree memory: 307.8MB, 47.5 B/state, compr.: 2.3%
pins2lts-mc-linux64( 0/ 8), 28.834: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 28.834: Stored 982 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 28.834: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 28.834: Est. total memory use: 310.0MB (~1026.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9700190353826124320;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9700190353826124320;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((X(X(<>(((LTLAPp0==true) U (LTLAPp1==true)))))&&<>((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 22:17:29] [INFO ] Flatten gal took : 413 ms
[2022-05-16 22:17:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality6971123318322169009.gal : 50 ms
[2022-05-16 22:17:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality3900010130824368002.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6971123318322169009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3900010130824368002.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((F(X(G((X(X(F(("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")U("(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)")))))&&(F("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1...164
Formula 0 simplified : !FXG(XXF("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)" U "(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)") & F"(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")
Detected timeout of ITS tools.
[2022-05-16 22:40:04] [INFO ] Flatten gal took : 414 ms
[2022-05-16 22:40:05] [INFO ] Input system was already deterministic with 972 transitions.
[2022-05-16 22:40:05] [INFO ] Transformed 513 places.
[2022-05-16 22:40:06] [INFO ] Transformed 972 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 22:40:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality7802602513782589.gal : 16 ms
[2022-05-16 22:40:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality15225315672189886301.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7802602513782589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15225315672189886301.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...331
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(G((X(X(F(("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")U("(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)")))))&&(F("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1...164
Formula 0 simplified : !FXG(XXF("(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)" U "(pb_d3_n1_2_1_3<=pb_d1_n1_2_2_1)") & F"(pil_d1_n1_2_1_2<=pil_d2_n1_1_2_1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d3k3p2b06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HypertorusGrid-PT-d3k3p2b06, 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 r132-tall-165271820300051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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 ;