About the Execution of Marcie for HexagonalGrid-PT-110
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5453.359 | 5506.00 | 5070.00 | 0.00 | FFFTTFFTFFFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r193-smll-167840340600369.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is HexagonalGrid-PT-110, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r193-smll-167840340600369
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 29K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679876167318
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-110
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: HexagonalGrid_PT_110
(NrP: 31 NrTr: 42 NrArc: 168)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.372sec
RS generation: 0m 0.022sec
-> reachability set: #nodes 679 (6.8e+02) #states 40,193 (4)
starting MCC model checker
--------------------------
checking: ~ [AX [AG [AG [EF [pol4_1_1<=1]]]]]
normalized: EX [E [true U E [true U ~ [E [true U pol4_1_1<=1]]]]]
abstracting: (pol4_1_1<=1)
states: 40,193 (4)
.-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EX [EF [AG [AF [~ [pb4_1_1<=0]]]]]
normalized: EX [E [true U ~ [E [true U EG [pb4_1_1<=0]]]]]
abstracting: (pb4_1_1<=0)
states: 26,351 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: ~ [AF [~ [AF [EX [~ [pbl_1_1<=1]]]]]]
normalized: EG [~ [EG [~ [EX [~ [pbl_1_1<=1]]]]]]
abstracting: (pbl_1_1<=1)
states: 3,486 (3)
....
EG iterations: 3
EG iterations: 0
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [pi2_1_1<=1]
normalized: E [true U pi2_1_1<=1]
abstracting: (pi2_1_1<=1)
states: 40,193 (4)
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [EF [AX [~ [1<=po2_1_1]]]]]
normalized: ~ [E [true U E [true U ~ [EX [1<=po2_1_1]]]]]
abstracting: (1<=po2_1_1)
states: 10,625 (4)
.-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EF [~ [EF [AG [EG [pbl_1_1<=pol4_1_1]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U ~ [EG [pbl_1_1<=pol4_1_1]]]]]]]
abstracting: (pbl_1_1<=pol4_1_1)
states: 3,234 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EF [AG [EX [A [~ [pi6_1_1<=pbl_1_1] U 1<=pi2_1_1]]]]
normalized: E [true U ~ [E [true U ~ [EX [[~ [EG [~ [1<=pi2_1_1]]] & ~ [E [~ [1<=pi2_1_1] U [~ [1<=pi2_1_1] & pi6_1_1<=pbl_1_1]]]]]]]]]
abstracting: (pi6_1_1<=pbl_1_1)
states: 40,193 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
...
EG iterations: 3
.-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: ~ [AF [E [po2_1_1<=1 U AG [[[pi5_1_1<=0 & 1<=pi4_1_1] & ~ [pol1_1_1<=pi1_1_1]]]]]]
normalized: EG [~ [E [po2_1_1<=1 U ~ [E [true U ~ [[~ [pol1_1_1<=pi1_1_1] & [pi5_1_1<=0 & 1<=pi4_1_1]]]]]]]]
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pi5_1_1<=0)
states: 29,568 (4)
abstracting: (pol1_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (po2_1_1<=1)
states: 40,193 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[AG [~ [EG [~ [1<=pbl_1_1]]]] | ~ [[EX [pol3_1_1<=pol5_1_1] | ~ [[1<=po2_1_1 | EG [pb4_1_1<=po6_1_1]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[1<=po2_1_1 | EG [pb4_1_1<=po6_1_1]]] | EX [pol3_1_1<=pol5_1_1]]] | ~ [E [true U EG [~ [1<=pbl_1_1]]]]]]]]
abstracting: (1<=pbl_1_1)
states: 39,731 (4)
..
EG iterations: 2
abstracting: (pol3_1_1<=pol5_1_1)
states: 32,129 (4)
.abstracting: (pb4_1_1<=po6_1_1)
states: 28,786 (4)
.
EG iterations: 1
abstracting: (1<=po2_1_1)
states: 10,625 (4)
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [pb6_1_1<=1 U A [AG [~ [[~ [1<=po5_1_1] & ~ [pb4_1_1<=1]]]] U [EF [~ [AX [1<=pi6_1_1]]] | [[pi3_1_1<=0 & 1<=pi5_1_1] | AX [~ [1<=pi3_1_1]]]]]]
normalized: E [pb6_1_1<=1 U [~ [EG [~ [[[~ [EX [1<=pi3_1_1]] | [pi3_1_1<=0 & 1<=pi5_1_1]] | E [true U EX [~ [1<=pi6_1_1]]]]]]] & ~ [E [~ [[[~ [EX [1<=pi3_1_1]] | [pi3_1_1<=0 & 1<=pi5_1_1]] | E [true U EX [~ [1<=pi6_1_1]]]]] U [E [true U [~ [pb4_1_1<=1] & ~ [1<=po5_1_1]]] & ~ [[[~ [EX [1<=pi3_1_1]] | [pi3_1_1<=0 & 1<=pi5_1_1]] | E [true U EX [~ [1<=pi6_1_1]]]]]]]]]]
abstracting: (1<=pi6_1_1)
states: 10,625 (4)
.abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pi3_1_1<=0)
states: 29,568 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
.abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (pb4_1_1<=1)
states: 36,194 (4)
abstracting: (1<=pi6_1_1)
states: 10,625 (4)
.abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pi3_1_1<=0)
states: 29,568 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
.abstracting: (1<=pi6_1_1)
states: 10,625 (4)
.abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pi3_1_1<=0)
states: 29,568 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
..
EG iterations: 1
abstracting: (pb6_1_1<=1)
states: 36,194 (4)
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EF [AG [[[~ [1<=po5_1_1] | ~ [EX [pil3_1_1<=0]]] & [[A [pol1_1_1<=pb1_1_1 U pb5_1_1<=pol1_1_1] | AG [pol5_1_1<=pi4_1_1]] | AG [[1<=pil5_1_1 | pb3_1_1<=1]]]]]]
normalized: E [true U ~ [E [true U ~ [[[~ [E [true U ~ [[1<=pil5_1_1 | pb3_1_1<=1]]]] | [~ [E [true U ~ [pol5_1_1<=pi4_1_1]]] | [~ [EG [~ [pb5_1_1<=pol1_1_1]]] & ~ [E [~ [pb5_1_1<=pol1_1_1] U [~ [pol1_1_1<=pb1_1_1] & ~ [pb5_1_1<=pol1_1_1]]]]]]] & [~ [EX [pil3_1_1<=0]] | ~ [1<=po5_1_1]]]]]]]
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (pil3_1_1<=0)
states: 10,625 (4)
.abstracting: (pb5_1_1<=pol1_1_1)
states: 33,759 (4)
abstracting: (pol1_1_1<=pb1_1_1)
states: 21,250 (4)
abstracting: (pb5_1_1<=pol1_1_1)
states: 33,759 (4)
abstracting: (pb5_1_1<=pol1_1_1)
states: 33,759 (4)
..
EG iterations: 2
abstracting: (pol5_1_1<=pi4_1_1)
states: 18,689 (4)
abstracting: (pb3_1_1<=1)
states: 36,194 (4)
abstracting: (1<=pil5_1_1)
states: 29,568 (4)
-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: A [AX [A [[EX [po5_1_1<=1] | po4_1_1<=po5_1_1] U AX [[1<=pb4_1_1 & 1<=pol4_1_1]]]] U EF [[~ [[pb1_1_1<=0 & ~ [[1<=po5_1_1 | pi1_1_1<=0]]]] & AX [AG [pil3_1_1<=pil2_1_1]]]]]
normalized: [~ [EG [~ [E [true U [~ [EX [E [true U ~ [pil3_1_1<=pil2_1_1]]]] & ~ [[pb1_1_1<=0 & ~ [[1<=po5_1_1 | pi1_1_1<=0]]]]]]]]] & ~ [E [~ [E [true U [~ [EX [E [true U ~ [pil3_1_1<=pil2_1_1]]]] & ~ [[pb1_1_1<=0 & ~ [[1<=po5_1_1 | pi1_1_1<=0]]]]]]] U [EX [~ [[~ [EG [EX [~ [[1<=pb4_1_1 & 1<=pol4_1_1]]]]] & ~ [E [EX [~ [[1<=pb4_1_1 & 1<=pol4_1_1]]] U [~ [[po4_1_1<=po5_1_1 | EX [po5_1_1<=1]]] & EX [~ [[1<=pb4_1_1 & 1<=pol4_1_1]]]]]]]]] & ~ [E [true U [~ [EX [E [true U ~ [pil3_1_1<=pil2_1_1]]]] & ~ [[pb1_1_1<=0 & ~ [[1<=po5_1_1 | pi1_1_1<=0]]]]]]]]]]]
abstracting: (pi1_1_1<=0)
states: 29,568 (4)
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (pb1_1_1<=0)
states: 26,351 (4)
abstracting: (pil3_1_1<=pil2_1_1)
states: 32,129 (4)
.abstracting: (1<=pol4_1_1)
states: 29,568 (4)
abstracting: (1<=pb4_1_1)
states: 13,842 (4)
.abstracting: (po5_1_1<=1)
states: 40,193 (4)
.abstracting: (po4_1_1<=po5_1_1)
states: 32,129 (4)
abstracting: (1<=pol4_1_1)
states: 29,568 (4)
abstracting: (1<=pb4_1_1)
states: 13,842 (4)
.abstracting: (1<=pol4_1_1)
states: 29,568 (4)
abstracting: (1<=pb4_1_1)
states: 13,842 (4)
...
EG iterations: 2
.abstracting: (pi1_1_1<=0)
states: 29,568 (4)
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (pb1_1_1<=0)
states: 26,351 (4)
abstracting: (pil3_1_1<=pil2_1_1)
states: 32,129 (4)
.abstracting: (pi1_1_1<=0)
states: 29,568 (4)
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (pb1_1_1<=0)
states: 26,351 (4)
abstracting: (pil3_1_1<=pil2_1_1)
states: 32,129 (4)
.
EG iterations: 0
-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [EX [[[[EX [pb2_1_1<=pil5_1_1] & [po1_1_1<=0 & ~ [pol2_1_1<=pi1_1_1]]] & EG [~ [1<=pil1_1_1]]] & [EF [A [pb3_1_1<=0 U pb5_1_1<=1]] & EG [[1<=pil5_1_1 | po5_1_1<=1]]]]]]
normalized: E [true U EX [[[[[po1_1_1<=0 & ~ [pol2_1_1<=pi1_1_1]] & EX [pb2_1_1<=pil5_1_1]] & EG [~ [1<=pil1_1_1]]] & [E [true U [~ [EG [~ [pb5_1_1<=1]]] & ~ [E [~ [pb5_1_1<=1] U [~ [pb3_1_1<=0] & ~ [pb5_1_1<=1]]]]]] & EG [[1<=pil5_1_1 | po5_1_1<=1]]]]]]
abstracting: (po5_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pil5_1_1)
states: 29,568 (4)
EG iterations: 0
abstracting: (pb5_1_1<=1)
states: 36,194 (4)
abstracting: (pb3_1_1<=0)
states: 26,351 (4)
abstracting: (pb5_1_1<=1)
states: 36,194 (4)
abstracting: (pb5_1_1<=1)
states: 36,194 (4)
.
EG iterations: 1
abstracting: (1<=pil1_1_1)
states: 29,568 (4)
...
EG iterations: 3
abstracting: (pb2_1_1<=pil5_1_1)
states: 33,759 (4)
.abstracting: (pol2_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (po1_1_1<=0)
states: 29,568 (4)
.-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: [EF [AG [AF [pi1_1_1<=pil1_1_1]]] | ~ [[~ [A [A [[1<=pol1_1_1 & 1<=po5_1_1] U [pb3_1_1<=pb1_1_1 | pil2_1_1<=pi1_1_1]] U AG [A [1<=pi5_1_1 U pb2_1_1<=pol4_1_1]]]] | EG [EX [~ [AX [pb5_1_1<=pil4_1_1]]]]]]]
normalized: [~ [[EG [EX [EX [~ [pb5_1_1<=pil4_1_1]]]] | ~ [[~ [EG [E [true U ~ [[~ [EG [~ [pb2_1_1<=pol4_1_1]]] & ~ [E [~ [pb2_1_1<=pol4_1_1] U [~ [1<=pi5_1_1] & ~ [pb2_1_1<=pol4_1_1]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [pb2_1_1<=pol4_1_1]]] & ~ [E [~ [pb2_1_1<=pol4_1_1] U [~ [1<=pi5_1_1] & ~ [pb2_1_1<=pol4_1_1]]]]]]] U [~ [[~ [EG [~ [[pb3_1_1<=pb1_1_1 | pil2_1_1<=pi1_1_1]]]] & ~ [E [~ [[pb3_1_1<=pb1_1_1 | pil2_1_1<=pi1_1_1]] U [~ [[1<=pol1_1_1 & 1<=po5_1_1]] & ~ [[pb3_1_1<=pb1_1_1 | pil2_1_1<=pi1_1_1]]]]]]] & E [true U ~ [[~ [EG [~ [pb2_1_1<=pol4_1_1]]] & ~ [E [~ [pb2_1_1<=pol4_1_1] U [~ [1<=pi5_1_1] & ~ [pb2_1_1<=pol4_1_1]]]]]]]]]]]]]] | E [true U ~ [E [true U EG [~ [pi1_1_1<=pil1_1_1]]]]]]
abstracting: (pi1_1_1<=pil1_1_1)
states: 29,568 (4)
...
EG iterations: 3
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
..
EG iterations: 2
abstracting: (pil2_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (pb3_1_1<=pb1_1_1)
states: 29,568 (4)
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (1<=pol1_1_1)
states: 29,568 (4)
abstracting: (pil2_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (pb3_1_1<=pb1_1_1)
states: 29,568 (4)
abstracting: (pil2_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (pb3_1_1<=pb1_1_1)
states: 29,568 (4)
...
EG iterations: 3
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
..
EG iterations: 2
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
abstracting: (pb2_1_1<=pol4_1_1)
states: 33,759 (4)
..
EG iterations: 2
EG iterations: 0
abstracting: (pb5_1_1<=pil4_1_1)
states: 33,759 (4)
...
EG iterations: 1
-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: [E [EG [[~ [AX [po5_1_1<=1]] & AX [AX [1<=pil4_1_1]]]] U ~ [[[E [pol5_1_1<=1 U EF [1<=pi1_1_1]] & ~ [E [pil1_1_1<=pb1_1_1 U 1<=pi2_1_1]]] & [~ [[po3_1_1<=1 | [pol3_1_1<=1 & pol3_1_1<=pol4_1_1]]] & 1<=pi3_1_1]]]] | AG [EG [~ [pb1_1_1<=pil6_1_1]]]]
normalized: [~ [E [true U ~ [EG [~ [pb1_1_1<=pil6_1_1]]]]] | E [EG [[~ [EX [EX [~ [1<=pil4_1_1]]]] & EX [~ [po5_1_1<=1]]]] U ~ [[[1<=pi3_1_1 & ~ [[po3_1_1<=1 | [pol3_1_1<=1 & pol3_1_1<=pol4_1_1]]]] & [~ [E [pil1_1_1<=pb1_1_1 U 1<=pi2_1_1]] & E [pol5_1_1<=1 U E [true U 1<=pi1_1_1]]]]]]]
abstracting: (1<=pi1_1_1)
states: 10,625 (4)
abstracting: (pol5_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (pil1_1_1<=pb1_1_1)
states: 21,250 (4)
abstracting: (pol3_1_1<=pol4_1_1)
states: 32,129 (4)
abstracting: (pol3_1_1<=1)
states: 40,193 (4)
abstracting: (po3_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
abstracting: (po5_1_1<=1)
states: 40,193 (4)
.abstracting: (1<=pil4_1_1)
states: 29,568 (4)
...
EG iterations: 1
abstracting: (pb1_1_1<=pil6_1_1)
states: 33,759 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA HexagonalGrid-PT-110-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: AF [[1<=po2_1_1 | [[[E [~ [pol1_1_1<=pi3_1_1] U E [pil3_1_1<=pil3_1_1 U 1<=pb2_1_1]] & A [~ [pol4_1_1<=1] U pil2_1_1<=0]] & A [po1_1_1<=0 U [[pi4_1_1<=0 & po3_1_1<=0] | ~ [po6_1_1<=0]]]] | EX [A [AX [pi6_1_1<=pi2_1_1] U A [1<=pi4_1_1 U pil5_1_1<=pi2_1_1]]]]]]
normalized: ~ [EG [~ [[1<=po2_1_1 | [EX [[~ [EG [~ [[~ [EG [~ [pil5_1_1<=pi2_1_1]]] & ~ [E [~ [pil5_1_1<=pi2_1_1] U [~ [1<=pi4_1_1] & ~ [pil5_1_1<=pi2_1_1]]]]]]]] & ~ [E [~ [[~ [EG [~ [pil5_1_1<=pi2_1_1]]] & ~ [E [~ [pil5_1_1<=pi2_1_1] U [~ [1<=pi4_1_1] & ~ [pil5_1_1<=pi2_1_1]]]]]] U [EX [~ [pi6_1_1<=pi2_1_1]] & ~ [[~ [EG [~ [pil5_1_1<=pi2_1_1]]] & ~ [E [~ [pil5_1_1<=pi2_1_1] U [~ [1<=pi4_1_1] & ~ [pil5_1_1<=pi2_1_1]]]]]]]]]]] | [[~ [EG [~ [[~ [po6_1_1<=0] | [pi4_1_1<=0 & po3_1_1<=0]]]]] & ~ [E [~ [[~ [po6_1_1<=0] | [pi4_1_1<=0 & po3_1_1<=0]]] U [~ [po1_1_1<=0] & ~ [[~ [po6_1_1<=0] | [pi4_1_1<=0 & po3_1_1<=0]]]]]]] & [[~ [EG [~ [pil2_1_1<=0]]] & ~ [E [~ [pil2_1_1<=0] U [pol4_1_1<=1 & ~ [pil2_1_1<=0]]]]] & E [~ [pol1_1_1<=pi3_1_1] U E [pil3_1_1<=pil3_1_1 U 1<=pb2_1_1]]]]]]]]]
abstracting: (1<=pb2_1_1)
states: 13,842 (4)
abstracting: (pil3_1_1<=pil3_1_1)
states: 40,193 (4)
abstracting: (pol1_1_1<=pi3_1_1)
states: 18,689 (4)
abstracting: (pil2_1_1<=0)
states: 10,625 (4)
abstracting: (pol4_1_1<=1)
states: 40,193 (4)
abstracting: (pil2_1_1<=0)
states: 10,625 (4)
abstracting: (pil2_1_1<=0)
states: 10,625 (4)
...
EG iterations: 3
abstracting: (po3_1_1<=0)
states: 29,568 (4)
abstracting: (pi4_1_1<=0)
states: 29,568 (4)
abstracting: (po6_1_1<=0)
states: 29,568 (4)
abstracting: (po1_1_1<=0)
states: 29,568 (4)
abstracting: (po3_1_1<=0)
states: 29,568 (4)
abstracting: (pi4_1_1<=0)
states: 29,568 (4)
abstracting: (po6_1_1<=0)
states: 29,568 (4)
abstracting: (po3_1_1<=0)
states: 29,568 (4)
abstracting: (pi4_1_1<=0)
states: 29,568 (4)
abstracting: (po6_1_1<=0)
states: 29,568 (4)
...
EG iterations: 3
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
....
EG iterations: 4
abstracting: (pi6_1_1<=pi2_1_1)
states: 32,129 (4)
.abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
....
EG iterations: 4
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
abstracting: (pil5_1_1<=pi2_1_1)
states: 18,689 (4)
....
EG iterations: 4
....
EG iterations: 4
.abstracting: (1<=po2_1_1)
states: 10,625 (4)
...
EG iterations: 3
-> the formula is FALSE
FORMULA HexagonalGrid-PT-110-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
totally nodes used: 125608 (1.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 475670 830405 1306075
used/not used/entry size/cache size: 936989 66171875 16 1024MB
basic ops cache: hits/miss/sum: 67865 125667 193532
used/not used/entry size/cache size: 222603 16554613 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 6472 9193 15665
used/not used/entry size/cache size: 9190 8379418 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66986368
1 119769
2 2487
3 191
4 19
5 6
6 4
7 11
8 4
9 2
>= 10 3
Total processing time: 0m 5.438sec
BK_STOP 1679876172824
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:798 (19), effective:65 (1)
initing FirstDep: 0m 0.000sec
iterations count:42 (1), effective:0 (0)
iterations count:208 (4), effective:15 (0)
iterations count:42 (1), effective:0 (0)
iterations count:283 (6), effective:34 (0)
iterations count:42 (1), effective:0 (0)
iterations count:504 (12), effective:32 (0)
iterations count:42 (1), effective:0 (0)
iterations count:42 (1), effective:0 (0)
iterations count:112 (2), effective:18 (0)
iterations count:48 (1), effective:2 (0)
iterations count:49 (1), effective:1 (0)
iterations count:596 (14), effective:34 (0)
iterations count:49 (1), effective:1 (0)
iterations count:49 (1), effective:1 (0)
iterations count:42 (1), effective:0 (0)
iterations count:324 (7), effective:26 (0)
iterations count:83 (1), effective:3 (0)
iterations count:806 (19), effective:50 (1)
iterations count:606 (14), effective:42 (1)
iterations count:311 (7), effective:17 (0)
iterations count:311 (7), effective:17 (0)
iterations count:63 (1), effective:1 (0)
iterations count:311 (7), effective:17 (0)
iterations count:298 (7), effective:17 (0)
iterations count:327 (7), effective:12 (0)
iterations count:327 (7), effective:20 (0)
iterations count:71 (1), effective:1 (0)
iterations count:557 (13), effective:31 (0)
iterations count:346 (8), effective:22 (0)
iterations count:71 (1), effective:1 (0)
iterations count:557 (13), effective:31 (0)
iterations count:323 (7), effective:30 (0)
iterations count:71 (1), effective:1 (0)
iterations count:557 (13), effective:31 (0)
iterations count:321 (7), effective:17 (0)
iterations count:42 (1), effective:0 (0)
iterations count:311 (7), effective:17 (0)
iterations count:42 (1), effective:0 (0)
iterations count:64 (1), effective:12 (0)
iterations count:307 (7), effective:17 (0)
iterations count:42 (1), effective:0 (0)
iterations count:42 (1), effective:0 (0)
iterations count:267 (6), effective:14 (0)
iterations count:47 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:255 (6), effective:12 (0)
iterations count:47 (1), effective:1 (0)
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="HexagonalGrid-PT-110"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is HexagonalGrid-PT-110, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r193-smll-167840340600369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;