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.r257-smll-167863532200017.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 NQueens-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532200017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K 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 NQueens-PT-08-CTLCardinality-00
FORMULA_NAME NQueens-PT-08-CTLCardinality-01
FORMULA_NAME NQueens-PT-08-CTLCardinality-02
FORMULA_NAME NQueens-PT-08-CTLCardinality-03
FORMULA_NAME NQueens-PT-08-CTLCardinality-04
FORMULA_NAME NQueens-PT-08-CTLCardinality-05
FORMULA_NAME NQueens-PT-08-CTLCardinality-06
FORMULA_NAME NQueens-PT-08-CTLCardinality-07
FORMULA_NAME NQueens-PT-08-CTLCardinality-08
FORMULA_NAME NQueens-PT-08-CTLCardinality-09
FORMULA_NAME NQueens-PT-08-CTLCardinality-10
FORMULA_NAME NQueens-PT-08-CTLCardinality-11
FORMULA_NAME NQueens-PT-08-CTLCardinality-12
FORMULA_NAME NQueens-PT-08-CTLCardinality-13
FORMULA_NAME NQueens-PT-08-CTLCardinality-14
FORMULA_NAME NQueens-PT-08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678648507499

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=NQueens-PT-08
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: NQueens_PT_08
(NrP: 112 NrTr: 64 NrArc: 320)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 4.068sec


RS generation: 0m 5.737sec


-> reachability set: #nodes 343599 (3.4e+05) #states 118,969 (5)



starting MCC model checker
--------------------------

checking: EG [P_4_0<=0]
normalized: EG [P_4_0<=0]

abstracting: (P_4_0<=0)
states: 108,666 (5)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.925sec

checking: EG [EG [L_15<=L_11]]
normalized: EG [EG [L_15<=L_11]]

abstracting: (L_15<=L_11)
states: 80,699 (4)
.....
EG iterations: 5
.
EG iterations: 1
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.224sec

checking: AG [E [~ [EF [AF [cX_1<=R_7]]] U EX [cY_4<=cY_7]]]
normalized: ~ [E [true U ~ [E [~ [E [true U ~ [EG [~ [cX_1<=R_7]]]]] U EX [cY_4<=cY_7]]]]]

abstracting: (cY_4<=cY_7)
states: 83,853 (4)
.abstracting: (cX_1<=R_7)
states: 97,565 (4)
......
EG iterations: 6
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.319sec

checking: EG [~ [[AX [AG [E [P_5_4<=P_6_0 U P_4_7<=0]]] | ~ [P_7_7<=R_7]]]]
normalized: EG [~ [[~ [P_7_7<=R_7] | ~ [EX [E [true U ~ [E [P_5_4<=P_6_0 U P_4_7<=0]]]]]]]]

abstracting: (P_4_7<=0)
states: 108,666 (5)
abstracting: (P_5_4<=P_6_0)
states: 112,066 (5)
.abstracting: (P_7_7<=R_7)
states: 114,839 (5)
.........
EG iterations: 9
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.003sec

checking: A [EF [[[EX [L_15<=P_0_4] & ~ [AF [1<=L_10]]] | AF [[[1<=R_13 | 1<=P_5_2] | AF [P_6_4<=P_3_4]]]]] U ~ [AX [P_4_1<=1]]]
normalized: [~ [EG [~ [EX [~ [P_4_1<=1]]]]] & ~ [E [~ [EX [~ [P_4_1<=1]]] U [~ [E [true U [~ [EG [~ [[[1<=R_13 | 1<=P_5_2] | ~ [EG [~ [P_6_4<=P_3_4]]]]]]] | [EX [L_15<=P_0_4] & EG [~ [1<=L_10]]]]]] & ~ [EX [~ [P_4_1<=1]]]]]]]

abstracting: (P_4_1<=1)
states: 118,969 (5)
.abstracting: (1<=L_10)
states: 73,504 (4)
.
EG iterations: 1
abstracting: (L_15<=P_0_4)
states: 10,303 (4)
.abstracting: (P_6_4<=P_3_4)
states: 110,183 (5)
.
EG iterations: 1
abstracting: (1<=P_5_2)
states: 7,287 (3)
abstracting: (1<=R_13)
states: 89,936 (4)
.
EG iterations: 1
abstracting: (P_4_1<=1)
states: 118,969 (5)
.abstracting: (P_4_1<=1)
states: 118,969 (5)
.
EG iterations: 0
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.838sec

checking: ~ [[EG [AF [[[R_14<=P_4_5 | cX_5<=cY_7] | [1<=cX_1 | P_2_2<=1]]]] | AF [R_9<=P_0_4]]]
normalized: ~ [[~ [EG [~ [R_9<=P_0_4]]] | EG [~ [EG [~ [[[1<=cX_1 | P_2_2<=1] | [R_14<=P_4_5 | cX_5<=cY_7]]]]]]]]

abstracting: (cX_5<=cY_7)
states: 88,516 (4)
abstracting: (R_14<=P_4_5)
states: 25,512 (4)
abstracting: (P_2_2<=1)
states: 118,969 (5)
abstracting: (1<=cX_1)
states: 47,617 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (R_9<=P_0_4)
states: 63,944 (4)
......
EG iterations: 6
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.854sec

checking: ~ [EX [E [[R_1<=1 & [AX [P_7_1<=R_7] & ~ [P_2_7<=P_0_0]]] U [~ [P_1_1<=0] & EG [[R_9<=0 & 1<=P_5_3]]]]]]
normalized: ~ [EX [E [[R_1<=1 & [~ [P_2_7<=P_0_0] & ~ [EX [~ [P_7_1<=R_7]]]]] U [EG [[R_9<=0 & 1<=P_5_3]] & ~ [P_1_1<=0]]]]]

abstracting: (P_1_1<=0)
states: 110,280 (5)
abstracting: (1<=P_5_3)
states: 7,685 (3)
abstracting: (R_9<=0)
states: 58,485 (4)
.
EG iterations: 1
abstracting: (P_7_1<=R_7)
states: 114,587 (5)
.abstracting: (P_2_7<=P_0_0)
states: 109,618 (5)
abstracting: (R_1<=1)
states: 118,969 (5)
.-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.206sec

checking: AG [[E [A [E [P_3_5<=0 U 1<=R_9] U EG [R_6<=P_1_6]] U [AF [[R_14<=0 | P_5_7<=0]] & [~ [[P_3_5<=0 & P_5_7<=0]] | [EG [P_3_3<=0] | ~ [P_1_6<=0]]]]] | 1<=P_7_2]]
normalized: ~ [E [true U ~ [[1<=P_7_2 | E [[~ [EG [~ [EG [R_6<=P_1_6]]]] & ~ [E [~ [EG [R_6<=P_1_6]] U [~ [E [P_3_5<=0 U 1<=R_9]] & ~ [EG [R_6<=P_1_6]]]]]] U [[[~ [P_1_6<=0] | EG [P_3_3<=0]] | ~ [[P_3_5<=0 & P_5_7<=0]]] & ~ [EG [~ [[R_14<=0 | P_5_7<=0]]]]]]]]]]

abstracting: (P_5_7<=0)
states: 108,797 (5)
abstracting: (R_14<=0)
states: 18,738 (4)
....
EG iterations: 4
abstracting: (P_5_7<=0)
states: 108,797 (5)
abstracting: (P_3_5<=0)
states: 111,284 (5)
abstracting: (P_3_3<=0)
states: 112,256 (5)
....
EG iterations: 4
abstracting: (P_1_6<=0)
states: 110,280 (5)
abstracting: (R_6<=P_1_6)
states: 58,445 (4)
.
EG iterations: 1
abstracting: (1<=R_9)
states: 60,484 (4)
abstracting: (P_3_5<=0)
states: 111,284 (5)
abstracting: (R_6<=P_1_6)
states: 58,445 (4)
.
EG iterations: 1
abstracting: (R_6<=P_1_6)
states: 58,445 (4)
.
EG iterations: 1
.....
EG iterations: 5
abstracting: (1<=P_7_2)
states: 10,172 (4)
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.372sec

checking: AF [~ [[[EF [AF [1<=P_2_7]] | [[[[P_3_4<=1 | 1<=P_3_2] | [L_0<=1 | P_1_1<=cY_7]] & AG [1<=R_8]] & [~ [AX [P_7_0<=cY_2]] | A [P_4_0<=1 U 1<=R_6]]]] | ~ [P_6_7<=P_7_6]]]]
normalized: ~ [EG [[~ [P_6_7<=P_7_6] | [[[[~ [EG [~ [1<=R_6]]] & ~ [E [~ [1<=R_6] U [~ [P_4_0<=1] & ~ [1<=R_6]]]]] | EX [~ [P_7_0<=cY_2]]] & [~ [E [true U ~ [1<=R_8]]] & [[L_0<=1 | P_1_1<=cY_7] | [P_3_4<=1 | 1<=P_3_2]]]] | E [true U ~ [EG [~ [1<=P_2_7]]]]]]]]

abstracting: (1<=P_2_7)
states: 10,172 (4)
.....
EG iterations: 5
abstracting: (1<=P_3_2)
states: 7,685 (3)
abstracting: (P_3_4<=1)
states: 118,969 (5)
abstracting: (P_1_1<=cY_7)
states: 113,668 (5)
abstracting: (L_0<=1)
states: 118,969 (5)
abstracting: (1<=R_8)
states: 57,117 (4)
abstracting: (P_7_0<=cY_2)
states: 114,477 (5)
.abstracting: (1<=R_6)
states: 65,683 (4)
abstracting: (P_4_0<=1)
states: 118,969 (5)
abstracting: (1<=R_6)
states: 65,683 (4)
abstracting: (1<=R_6)
states: 65,683 (4)
.
EG iterations: 1
abstracting: (P_6_7<=P_7_6)
states: 109,600 (5)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.168sec

checking: AF [[[[[EG [~ [R_4<=0]] & AG [[P_3_3<=1 | cX_3<=cY_4]]] & ~ [R_3<=P_0_3]] & [[P_7_7<=L_9 & P_7_1<=1] | ~ [EX [~ [cY_3<=cY_6]]]]] | ~ [P_6_5<=P_7_4]]]
normalized: ~ [EG [~ [[[[~ [EX [~ [cY_3<=cY_6]]] | [P_7_7<=L_9 & P_7_1<=1]] & [~ [R_3<=P_0_3] & [~ [E [true U ~ [[P_3_3<=1 | cX_3<=cY_4]]]] & EG [~ [R_4<=0]]]]] | ~ [P_6_5<=P_7_4]]]]]

abstracting: (P_6_5<=P_7_4)
states: 110,137 (5)
abstracting: (R_4<=0)
states: 38,270 (4)
.....
EG iterations: 5
abstracting: (cX_3<=cY_4)
states: 91,190 (4)
abstracting: (P_3_3<=1)
states: 118,969 (5)
abstracting: (R_3<=P_0_3)
states: 37,062 (4)
abstracting: (P_7_1<=1)
states: 118,969 (5)
abstracting: (P_7_7<=L_9)
states: 115,058 (5)
abstracting: (cY_3<=cY_6)
states: 86,011 (4)
......
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.284sec

checking: ~ [A [E [AX [[A [P_5_4<=P_6_6 U P_4_7<=P_6_0] | ~ [L_10<=L_13]]] U EG [P_1_6<=cX_4]] U ~ [EF [[AF [R_14<=1] | [[1<=R_4 & cY_7<=R_0] | EF [P_1_6<=0]]]]]]]
normalized: ~ [[~ [EG [E [true U [[E [true U P_1_6<=0] | [1<=R_4 & cY_7<=R_0]] | ~ [EG [~ [R_14<=1]]]]]]] & ~ [E [E [true U [[E [true U P_1_6<=0] | [1<=R_4 & cY_7<=R_0]] | ~ [EG [~ [R_14<=1]]]]] U [~ [E [~ [EX [~ [[~ [L_10<=L_13] | [~ [EG [~ [P_4_7<=P_6_0]]] & ~ [E [~ [P_4_7<=P_6_0] U [~ [P_5_4<=P_6_6] & ~ [P_4_7<=P_6_0]]]]]]]]] U EG [P_1_6<=cX_4]]] & E [true U [[E [true U P_1_6<=0] | [1<=R_4 & cY_7<=R_0]] | ~ [EG [~ [R_14<=1]]]]]]]]]]

abstracting: (R_14<=1)
states: 118,969 (5)
.
EG iterations: 1
abstracting: (cY_7<=R_0)
states: 118,969 (5)
abstracting: (1<=R_4)
states: 80,699 (4)
abstracting: (P_1_6<=0)
states: 110,280 (5)
abstracting: (P_1_6<=cX_4)
states: 114,150 (5)
......
EG iterations: 6
abstracting: (P_4_7<=P_6_0)
states: 109,529 (5)
abstracting: (P_5_4<=P_6_6)
states: 112,156 (5)
abstracting: (P_4_7<=P_6_0)
states: 109,529 (5)
abstracting: (P_4_7<=P_6_0)
states: 109,529 (5)
.....
EG iterations: 5
abstracting: (L_10<=L_13)
states: 106,139 (5)
.abstracting: (R_14<=1)
states: 118,969 (5)
.
EG iterations: 1
abstracting: (cY_7<=R_0)
states: 118,969 (5)
abstracting: (1<=R_4)
states: 80,699 (4)
abstracting: (P_1_6<=0)
states: 110,280 (5)
abstracting: (R_14<=1)
states: 118,969 (5)
.
EG iterations: 1
abstracting: (cY_7<=R_0)
states: 118,969 (5)
abstracting: (1<=R_4)
states: 80,699 (4)
abstracting: (P_1_6<=0)
states: 110,280 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.669sec

checking: E [[R_13<=R_0 | ~ [1<=P_5_2]] U [[L_1<=cY_4 & EF [[EG [R_1<=cX_1] & [EG [P_0_3<=1] | [P_7_7<=1 & 1<=L_11]]]]] & EF [[EF [[P_1_3<=P_0_4 & 1<=P_6_2]] & [[A [1<=P_5_2 U P_2_3<=P_1_1] & ~ [P_7_5<=0]] | AF [cY_0<=1]]]]]]
normalized: E [[R_13<=R_0 | ~ [1<=P_5_2]] U [E [true U [[~ [EG [~ [cY_0<=1]]] | [~ [P_7_5<=0] & [~ [EG [~ [P_2_3<=P_1_1]]] & ~ [E [~ [P_2_3<=P_1_1] U [~ [1<=P_5_2] & ~ [P_2_3<=P_1_1]]]]]]] & E [true U [P_1_3<=P_0_4 & 1<=P_6_2]]]] & [L_1<=cY_4 & E [true U [[[P_7_7<=1 & 1<=L_11] | EG [P_0_3<=1]] & EG [R_1<=cX_1]]]]]]

abstracting: (R_1<=cX_1)
states: 52,599 (4)
......
EG iterations: 6
abstracting: (P_0_3<=1)
states: 118,969 (5)

EG iterations: 0
abstracting: (1<=L_11)
states: 80,699 (4)
abstracting: (P_7_7<=1)
states: 118,969 (5)
abstracting: (L_1<=cY_4)
states: 62,027 (4)
abstracting: (1<=P_6_2)
states: 8,832 (3)
abstracting: (P_1_3<=P_0_4)
states: 110,183 (5)
abstracting: (P_2_3<=P_1_1)
states: 112,156 (5)
abstracting: (1<=P_5_2)
states: 7,287 (3)
abstracting: (P_2_3<=P_1_1)
states: 112,156 (5)
abstracting: (P_2_3<=P_1_1)
states: 112,156 (5)
.....
EG iterations: 5
abstracting: (P_7_5<=0)
states: 108,797 (5)
abstracting: (cY_0<=1)
states: 118,969 (5)
.
EG iterations: 1
abstracting: (1<=P_5_2)
states: 7,287 (3)
abstracting: (R_13<=R_0)
states: 118,969 (5)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.567sec

checking: E [~ [[[[~ [AF [P_2_1<=0]] | ~ [EG [L_1<=1]]] | [[R_7<=0 & ~ [[P_4_3<=0 | 1<=cX_1]]] | [[[1<=P_4_5 | 1<=P_0_5] | 1<=P_4_7] | [EX [1<=P_3_7] | L_10<=0]]]] & [~ [A [1<=cY_0 U ~ [P_1_5<=L_1]]] & [P_5_7<=1 & EG [[cY_7<=L_10 | R_7<=1]]]]]] U EG [A [AG [[1<=L_10 & P_2_7<=P_4_0]] U EF [[1<=P_7_0 & 1<=P_6_6]]]]]
normalized: E [~ [[[[P_5_7<=1 & EG [[cY_7<=L_10 | R_7<=1]]] & ~ [[~ [EG [P_1_5<=L_1]] & ~ [E [P_1_5<=L_1 U [P_1_5<=L_1 & ~ [1<=cY_0]]]]]]] & [[[[L_10<=0 | EX [1<=P_3_7]] | [1<=P_4_7 | [1<=P_4_5 | 1<=P_0_5]]] | [R_7<=0 & ~ [[P_4_3<=0 | 1<=cX_1]]]] | [~ [EG [L_1<=1]] | EG [~ [P_2_1<=0]]]]]] U EG [[~ [EG [~ [E [true U [1<=P_7_0 & 1<=P_6_6]]]]] & ~ [E [~ [E [true U [1<=P_7_0 & 1<=P_6_6]]] U [E [true U ~ [[1<=L_10 & P_2_7<=P_4_0]]] & ~ [E [true U [1<=P_7_0 & 1<=P_6_6]]]]]]]]]

abstracting: (1<=P_6_6)
states: 8,689 (3)
abstracting: (1<=P_7_0)
states: 8,237 (3)
abstracting: (P_2_7<=P_4_0)
states: 109,758 (5)
abstracting: (1<=L_10)
states: 73,504 (4)
abstracting: (1<=P_6_6)
states: 8,689 (3)
abstracting: (1<=P_7_0)
states: 8,237 (3)
abstracting: (1<=P_6_6)
states: 8,689 (3)
abstracting: (1<=P_7_0)
states: 8,237 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P_2_1<=0)
states: 110,137 (5)
.
EG iterations: 1
abstracting: (L_1<=1)
states: 118,969 (5)

EG iterations: 0
abstracting: (1<=cX_1)
states: 47,617 (4)
abstracting: (P_4_3<=0)
states: 112,256 (5)
abstracting: (R_7<=0)
states: 58,485 (4)
abstracting: (1<=P_0_5)
states: 10,172 (4)
abstracting: (1<=P_4_5)
states: 7,685 (3)
abstracting: (1<=P_4_7)
states: 10,303 (4)
abstracting: (1<=P_3_7)
states: 10,303 (4)
.abstracting: (L_10<=0)
states: 45,465 (4)
abstracting: (1<=cY_0)
states: 42,807 (4)
abstracting: (P_1_5<=L_1)
states: 118,969 (5)
abstracting: (P_1_5<=L_1)
states: 118,969 (5)
abstracting: (P_1_5<=L_1)
states: 118,969 (5)

EG iterations: 0
abstracting: (R_7<=1)
states: 118,969 (5)
abstracting: (cY_7<=L_10)
states: 101,854 (5)

EG iterations: 0
abstracting: (P_5_7<=1)
states: 118,969 (5)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.873sec

checking: E [EF [[[AF [~ [1<=P_4_5]] | [[EG [cX_6<=1] & A [1<=cY_0 U 1<=R_12]] & [cX_4<=P_4_2 | [1<=cX_2 & P_7_0<=P_0_3]]]] & P_0_5<=0]] U AG [[AG [[~ [P_0_4<=P_2_4] & ~ [1<=P_4_2]]] & [[[[1<=P_3_6 & P_6_6<=1] & EX [L_15<=1]] & [[1<=cX_7 | cX_7<=cY_2] | E [1<=L_7 U P_3_7<=1]]] | 1<=P_5_2]]]]
normalized: E [E [true U [P_0_5<=0 & [[[cX_4<=P_4_2 | [1<=cX_2 & P_7_0<=P_0_3]] & [[~ [EG [~ [1<=R_12]]] & ~ [E [~ [1<=R_12] U [~ [1<=cY_0] & ~ [1<=R_12]]]]] & EG [cX_6<=1]]] | ~ [EG [1<=P_4_5]]]]] U ~ [E [true U ~ [[[1<=P_5_2 | [[E [1<=L_7 U P_3_7<=1] | [1<=cX_7 | cX_7<=cY_2]] & [EX [L_15<=1] & [1<=P_3_6 & P_6_6<=1]]]] & ~ [E [true U ~ [[~ [1<=P_4_2] & ~ [P_0_4<=P_2_4]]]]]]]]]]

abstracting: (P_0_4<=P_2_4)
states: 108,666 (5)
abstracting: (1<=P_4_2)
states: 7,685 (3)
abstracting: (P_6_6<=1)
states: 118,969 (5)
abstracting: (1<=P_3_6)
states: 8,786 (3)
abstracting: (L_15<=1)
states: 118,969 (5)
.abstracting: (cX_7<=cY_2)
states: 96,726 (4)
abstracting: (1<=cX_7)
states: 42,807 (4)
abstracting: (P_3_7<=1)
states: 118,969 (5)
abstracting: (1<=L_7)
states: 57,117 (4)
abstracting: (1<=P_5_2)
states: 7,287 (3)
abstracting: (1<=P_4_5)
states: 7,685 (3)
.
EG iterations: 1
abstracting: (cX_6<=1)
states: 118,969 (5)

EG iterations: 0
abstracting: (1<=R_12)
states: 80,699 (4)
abstracting: (1<=cY_0)
states: 42,807 (4)
abstracting: (1<=R_12)
states: 80,699 (4)
abstracting: (1<=R_12)
states: 80,699 (4)
.
EG iterations: 1
abstracting: (P_7_0<=P_0_3)
states: 111,627 (5)
abstracting: (1<=cX_2)
states: 51,017 (4)
abstracting: (cX_4<=P_4_2)
states: 66,974 (4)
abstracting: (P_0_5<=0)
states: 108,797 (5)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.897sec

checking: [EX [[[[AF [~ [P_4_5<=P_5_3]] & [~ [[L_10<=P_7_0 | L_10<=1]] & ~ [[L_2<=P_3_7 & 1<=P_3_2]]]] | A [L_0<=0 U [AX [cY_4<=cX_7] | 1<=cX_5]]] & [~ [AF [EX [R_3<=1]]] & EF [A [1<=P_0_1 U R_3<=0]]]]] | A [EG [EG [[A [P_6_2<=cX_4 U 1<=L_0] & [cX_5<=R_5 | 1<=P_6_2]]]] U EG [~ [EG [L_0<=1]]]]]
normalized: [[~ [EG [~ [EG [~ [EG [L_0<=1]]]]]] & ~ [E [~ [EG [~ [EG [L_0<=1]]]] U [~ [EG [EG [[[cX_5<=R_5 | 1<=P_6_2] & [~ [EG [~ [1<=L_0]]] & ~ [E [~ [1<=L_0] U [~ [P_6_2<=cX_4] & ~ [1<=L_0]]]]]]]]] & ~ [EG [~ [EG [L_0<=1]]]]]]]] | EX [[[E [true U [~ [EG [~ [R_3<=0]]] & ~ [E [~ [R_3<=0] U [~ [1<=P_0_1] & ~ [R_3<=0]]]]]] & EG [~ [EX [R_3<=1]]]] & [[~ [EG [~ [[1<=cX_5 | ~ [EX [~ [cY_4<=cX_7]]]]]]] & ~ [E [~ [[1<=cX_5 | ~ [EX [~ [cY_4<=cX_7]]]]] U [~ [L_0<=0] & ~ [[1<=cX_5 | ~ [EX [~ [cY_4<=cX_7]]]]]]]]] | [[~ [[L_2<=P_3_7 & 1<=P_3_2]] & ~ [[L_10<=P_7_0 | L_10<=1]]] & ~ [EG [P_4_5<=P_5_3]]]]]]]

abstracting: (P_4_5<=P_5_3)
states: 111,991 (5)
.....
EG iterations: 5
abstracting: (L_10<=1)
states: 118,969 (5)
abstracting: (L_10<=P_7_0)
states: 51,896 (4)
abstracting: (1<=P_3_2)
states: 7,685 (3)
abstracting: (L_2<=P_3_7)
states: 37,062 (4)
abstracting: (cY_4<=cX_7)
states: 87,794 (4)
.abstracting: (1<=cX_5)
states: 51,017 (4)
abstracting: (L_0<=0)
states: 8,237 (3)
abstracting: (cY_4<=cX_7)
states: 87,794 (4)
.abstracting: (1<=cX_5)
states: 51,017 (4)
abstracting: (cY_4<=cX_7)
states: 87,794 (4)
.abstracting: (1<=cX_5)
states: 51,017 (4)
.......
EG iterations: 7
abstracting: (R_3<=1)
states: 118,969 (5)
..
EG iterations: 1
abstracting: (R_3<=0)
states: 29,033 (4)
abstracting: (1<=P_0_1)
states: 9,369 (3)
abstracting: (R_3<=0)
states: 29,033 (4)
abstracting: (R_3<=0)
states: 29,033 (4)
.....
EG iterations: 5
.abstracting: (L_0<=1)
states: 118,969 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=L_0)
states: 110,732 (5)
abstracting: (P_6_2<=cX_4)
states: 114,483 (5)
abstracting: (1<=L_0)
states: 110,732 (5)
abstracting: (1<=L_0)
states: 110,732 (5)
.
EG iterations: 1
abstracting: (1<=P_6_2)
states: 8,832 (3)
abstracting: (cX_5<=R_5)
states: 99,128 (4)
.....
EG iterations: 5
.
EG iterations: 1
abstracting: (L_0<=1)
states: 118,969 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (L_0<=1)
states: 118,969 (5)

EG iterations: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.293sec

checking: AF [A [[[[[AF [cY_7<=1] & ~ [1<=P_0_5]] & [~ [L_2<=1] | AF [P_5_2<=0]]] & EF [AG [P_6_5<=0]]] & [AX [[P_0_2<=0 & P_1_6<=L_2]] & [[E [P_5_3<=1 U P_4_5<=1] | ~ [P_1_0<=P_4_3]] & [L_14<=0 | [P_3_1<=L_0 | P_6_3<=1]]]]] U [E [~ [AG [R_13<=P_3_5]] U [~ [1<=P_3_5] | [1<=P_6_4 | P_2_7<=L_0]]] & EG [E [L_2<=P_7_4 U R_6<=P_7_1]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[EG [E [L_2<=P_7_4 U R_6<=P_7_1]] & E [E [true U ~ [R_13<=P_3_5]] U [[1<=P_6_4 | P_2_7<=L_0] | ~ [1<=P_3_5]]]]]]] & ~ [E [~ [[EG [E [L_2<=P_7_4 U R_6<=P_7_1]] & E [E [true U ~ [R_13<=P_3_5]] U [[1<=P_6_4 | P_2_7<=L_0] | ~ [1<=P_3_5]]]]] U [~ [[[[[L_14<=0 | [P_3_1<=L_0 | P_6_3<=1]] & [~ [P_1_0<=P_4_3] | E [P_5_3<=1 U P_4_5<=1]]] & ~ [EX [~ [[P_0_2<=0 & P_1_6<=L_2]]]]] & [E [true U ~ [E [true U ~ [P_6_5<=0]]]] & [[~ [EG [~ [P_5_2<=0]]] | ~ [L_2<=1]] & [~ [1<=P_0_5] & ~ [EG [~ [cY_7<=1]]]]]]]] & ~ [[EG [E [L_2<=P_7_4 U R_6<=P_7_1]] & E [E [true U ~ [R_13<=P_3_5]] U [[1<=P_6_4 | P_2_7<=L_0] | ~ [1<=P_3_5]]]]]]]]]]]]

abstracting: (1<=P_3_5)
states: 7,685 (3)
abstracting: (P_2_7<=L_0)
states: 118,969 (5)
abstracting: (1<=P_6_4)
states: 8,786 (3)
abstracting: (R_13<=P_3_5)
states: 35,818 (4)
abstracting: (R_6<=P_7_1)
states: 58,593 (4)
abstracting: (L_2<=P_7_4)
states: 36,524 (4)
.
EG iterations: 1
abstracting: (cY_7<=1)
states: 118,969 (5)
.
EG iterations: 1
abstracting: (1<=P_0_5)
states: 10,172 (4)
abstracting: (L_2<=1)
states: 118,969 (5)
abstracting: (P_5_2<=0)
states: 111,682 (5)
.
EG iterations: 1
abstracting: (P_6_5<=0)
states: 110,137 (5)
abstracting: (P_1_6<=L_2)
states: 110,280 (5)
abstracting: (P_0_2<=0)
states: 108,797 (5)
.abstracting: (P_4_5<=1)
states: 118,969 (5)
abstracting: (P_5_3<=1)
states: 118,969 (5)
abstracting: (P_1_0<=P_4_3)
states: 109,600 (5)
abstracting: (P_6_3<=1)
states: 118,969 (5)
abstracting: (P_3_1<=L_0)
states: 118,320 (5)
abstracting: (L_14<=0)
states: 8,237 (3)
abstracting: (1<=P_3_5)
states: 7,685 (3)
abstracting: (P_2_7<=L_0)
states: 118,969 (5)
abstracting: (1<=P_6_4)
states: 8,786 (3)
abstracting: (R_13<=P_3_5)
states: 35,818 (4)
abstracting: (R_6<=P_7_1)
states: 58,593 (4)
abstracting: (L_2<=P_7_4)
states: 36,524 (4)
.
EG iterations: 1
abstracting: (1<=P_3_5)
states: 7,685 (3)
abstracting: (P_2_7<=L_0)
states: 118,969 (5)
abstracting: (1<=P_6_4)
states: 8,786 (3)
abstracting: (R_13<=P_3_5)
states: 35,818 (4)
abstracting: (R_6<=P_7_1)
states: 58,593 (4)
abstracting: (L_2<=P_7_4)
states: 36,524 (4)
.
EG iterations: 1
.....
EG iterations: 5
.....
EG iterations: 5
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.504sec

totally nodes used: 26980893 (2.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 19218841 233065125 252283966
used/not used/entry size/cache size: 65140829 1968035 16 1024MB
basic ops cache: hits/miss/sum: 2622330 39440365 42062695
used/not used/entry size/cache size: 15883740 893476 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: 323513 3332028 3655541
used/not used/entry size/cache size: 2746784 5641824 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 47243974
1 14343835
2 4219250
3 1053945
4 208502
5 34153
6 4558
7 579
8 63
9 5
>= 10 0

Total processing time: 4m 1.155sec


BK_STOP 1678648748748

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
L_15
R_0

The net has transition(s) that can never fire:


check for constant places
L_15
R_0
found 2 constant places
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:1974 (30), effective:64 (1)

initing FirstDep: 0m 0.000sec


iterations count:514 (8), effective:29 (0)

iterations count:64 (1), effective:0 (0)

iterations count:1974 (30), effective:64 (1)

iterations count:64 (1), effective:0 (0)

iterations count:90 (1), effective:1 (0)

iterations count:64 (1), effective:0 (0)

iterations count:152 (2), effective:2 (0)

iterations count:103 (1), effective:2 (0)

iterations count:64 (1), effective:0 (0)

iterations count:312 (4), effective:7 (0)

iterations count:599 (9), effective:23 (0)

iterations count:1013 (15), effective:31 (0)

iterations count:433 (6), effective:24 (0)

iterations count:342 (5), effective:8 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:107 (1), effective:1 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:397 (6), effective:22 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:65 (1), effective:1 (0)

iterations count:110 (1), effective:1 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:96 (1), effective:1 (0)

iterations count:181 (2), effective:2 (0)

iterations count:252 (3), effective:6 (0)

iterations count:181 (2), effective:2 (0)

iterations count:64 (1), effective:0 (0)

iterations count:181 (2), effective:2 (0)

iterations count:274 (4), effective:8 (0)

iterations count:64 (1), effective:0 (0)

iterations count:81 (1), effective:1 (0)

iterations count:64 (1), effective:0 (0)

iterations count:922 (14), effective:24 (0)

iterations count:274 (4), effective:8 (0)

iterations count:64 (1), effective:0 (0)

iterations count:197 (3), effective:6 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:85 (1), effective:4 (0)

iterations count:194 (3), effective:4 (0)

iterations count:493 (7), effective:29 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:249 (3), effective:7 (0)

iterations count:116 (1), effective:1 (0)

iterations count:896 (14), effective:23 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:249 (3), effective:7 (0)

iterations count:762 (11), effective:35 (0)

iterations count:64 (1), effective:0 (0)

iterations count:64 (1), effective:0 (0)

iterations count:249 (3), effective:7 (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="NQueens-PT-08"
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 NQueens-PT-08, 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 r257-smll-167863532200017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;