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.r225-tall-167856407200137.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 JoinFreeModules-PT-0003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407200137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.4K 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 JoinFreeModules-PT-0003-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678608098610

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=JoinFreeModules-PT-0003
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: JoinFreeModules_PT_0003
(NrP: 16 NrTr: 25 NrArc: 71)

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

net check time: 0m 0.000sec

init dd package: 0m 2.919sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 55 (5.5e+01) #states 35,937 (4)



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

checking: AF [AX [3<=p8]]
normalized: ~ [EG [EX [~ [3<=p8]]]]

abstracting: (3<=p8)
states: 3,267 (3)
.
EG iterations: 0
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [p2<=0] & AX [p5<=0]]
normalized: [~ [EX [~ [p5<=0]]] & ~ [EG [~ [p2<=0]]]]

abstracting: (p2<=0)
states: 13,068 (4)
.
EG iterations: 1
abstracting: (p5<=0)
states: 23,958 (4)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [p10<=p5]
normalized: EX [p10<=p5]

abstracting: (p10<=p5)
states: 27,159 (4)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EF [~ [p3<=p11]]]
normalized: E [true U E [true U ~ [p3<=p11]]]

abstracting: (p3<=p11)
states: 28,809 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[AF [EG [p5<=2]] | EF [p5<=0]]]
normalized: EX [[E [true U p5<=0] | ~ [EG [~ [EG [p5<=2]]]]]]

abstracting: (p5<=2)
states: 32,670 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p5<=0)
states: 23,958 (4)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AF [[AG [[AX [2<=p10] & ~ [p13<=3]]] | AF [~ [1<=p13]]]]]
normalized: ~ [E [true U EG [~ [[~ [E [true U ~ [[~ [p13<=3] & ~ [EX [~ [2<=p10]]]]]]] | ~ [EG [1<=p13]]]]]]]

abstracting: (1<=p13)
states: 20,691 (4)
.
EG iterations: 1
abstracting: (2<=p10)
states: 3,267 (3)
.abstracting: (p13<=3)
states: 35,937 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [~ [EX [[[p<=2 | ~ [3<=p7]] | [AG [p8<=3] & 1<=p2]]]]]
normalized: EX [~ [EX [[[~ [E [true U ~ [p8<=3]]] & 1<=p2] | [p<=2 | ~ [3<=p7]]]]]]

abstracting: (3<=p7)
states: 4,356 (3)
abstracting: (p<=2)
states: 35,937 (4)
abstracting: (1<=p2)
states: 22,869 (4)
abstracting: (p8<=3)
states: 35,937 (4)
..-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AG [A [~ [EX [1<=p11]] U EF [p11<=3]]] & AG [p<=p8]]]
normalized: EX [[~ [E [true U ~ [p<=p8]]] & ~ [E [true U ~ [[~ [EG [~ [E [true U p11<=3]]]] & ~ [E [~ [E [true U p11<=3]] U [EX [1<=p11] & ~ [E [true U p11<=3]]]]]]]]]]]

abstracting: (p11<=3)
states: 29,403 (4)
abstracting: (1<=p11)
states: 27,225 (4)
.abstracting: (p11<=3)
states: 29,403 (4)
abstracting: (p11<=3)
states: 29,403 (4)
.
EG iterations: 1
abstracting: (p<=p8)
states: 20,691 (4)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [EG [[~ [[EG [p1<=p1] & [3<=p11 | p1<=0]]] | 1<=p9]]]]
normalized: ~ [E [true U EG [[~ [[[3<=p11 | p1<=0] & EG [p1<=p1]]] | 1<=p9]]]]

abstracting: (1<=p9)
states: 18,513 (4)
abstracting: (p1<=p1)
states: 35,937 (4)

EG iterations: 0
abstracting: (p1<=0)
states: 8,712 (3)
abstracting: (3<=p11)
states: 13,068 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [EX [[[p1<=2 | [EX [p14<=3] & [p<=p8 & p15<=0]]] | ~ [p7<=p13]]]] | AX [EX [p5<=3]]]
normalized: [~ [EX [~ [EX [p5<=3]]]] | ~ [EG [~ [EX [[~ [p7<=p13] | [[[p<=p8 & p15<=0] & EX [p14<=3]] | p1<=2]]]]]]]

abstracting: (p1<=2)
states: 22,869 (4)
abstracting: (p14<=3)
states: 32,670 (4)
.abstracting: (p15<=0)
states: 23,958 (4)
abstracting: (p<=p8)
states: 20,691 (4)
abstracting: (p7<=p13)
states: 21,846 (4)
..
EG iterations: 1
abstracting: (p5<=3)
states: 32,670 (4)
..-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [E [EX [[E [p11<=p10 U p1<=p1] & p15<=p4]] U [p5<=3 & AF [EG [p11<=p5]]]]]
normalized: EG [E [EX [[E [p11<=p10 U p1<=p1] & p15<=p4]] U [~ [EG [~ [EG [p11<=p5]]]] & p5<=3]]]

abstracting: (p5<=3)
states: 32,670 (4)
abstracting: (p11<=p5)
states: 12,507 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p15<=p4)
states: 28,446 (4)
abstracting: (p1<=p1)
states: 35,937 (4)
abstracting: (p11<=p10)
states: 12,507 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [AG [[~ [p<=p9] & [[p12<=p5 & [~ [p7<=p9] | AG [3<=p13]]] & AF [[p5<=2 & 2<=p14]]]]]]
normalized: E [true U ~ [[[~ [EG [~ [[p5<=2 & 2<=p14]]]] & [[~ [E [true U ~ [3<=p13]]] | ~ [p7<=p9]] & p12<=p5]] & ~ [p<=p9]]]]

abstracting: (p<=p9)
states: 18,513 (4)
abstracting: (p12<=p5)
states: 18,051 (4)
abstracting: (p7<=p9)
states: 22,869 (4)
abstracting: (3<=p13)
states: 3,267 (3)
abstracting: (2<=p14)
states: 13,068 (4)
abstracting: (p5<=2)
states: 32,670 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[[EF [EX [[p2<=1 | 3<=p6]]] & A [[p9<=3 | [AF [p15<=1] | EX [p13<=p8]]] U AG [p1<=1]]] & [~ [p6<=p15] & p8<=3]]]
normalized: ~ [EG [~ [[[~ [p6<=p15] & p8<=3] & [[~ [EG [E [true U ~ [p1<=1]]]] & ~ [E [E [true U ~ [p1<=1]] U [~ [[[EX [p13<=p8] | ~ [EG [~ [p15<=1]]]] | p9<=3]] & E [true U ~ [p1<=1]]]]]] & E [true U EX [[p2<=1 | 3<=p6]]]]]]]]

abstracting: (3<=p6)
states: 13,068 (4)
abstracting: (p2<=1)
states: 25,047 (4)
.abstracting: (p1<=1)
states: 14,157 (4)
abstracting: (p9<=3)
states: 32,670 (4)
abstracting: (p15<=1)
states: 32,670 (4)
.
EG iterations: 1
abstracting: (p13<=p8)
states: 23,760 (4)
.abstracting: (p1<=1)
states: 14,157 (4)
abstracting: (p1<=1)
states: 14,157 (4)

EG iterations: 0
abstracting: (p8<=3)
states: 35,937 (4)
abstracting: (p6<=p15)
states: 12,507 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AG [AG [~ [E [[1<=p14 | p3<=p14] U AG [3<=p5]]]]] & ~ [[AF [AG [~ [p7<=2]]] | [EX [~ [AG [p<=2]]] & [AF [p5<=p2] | [EG [EF [p14<=2]] | AF [~ [2<=p4]]]]]]]]
normalized: [~ [[[[[~ [EG [2<=p4]] | EG [E [true U p14<=2]]] | ~ [EG [~ [p5<=p2]]]] & EX [E [true U ~ [p<=2]]]] | ~ [EG [E [true U p7<=2]]]]] & ~ [E [true U E [true U E [[1<=p14 | p3<=p14] U ~ [E [true U ~ [3<=p5]]]]]]]]

abstracting: (3<=p5)
states: 3,267 (3)
abstracting: (p3<=p14)
states: 24,585 (4)
abstracting: (1<=p14)
states: 18,513 (4)
abstracting: (p7<=2)
states: 31,581 (4)

EG iterations: 0
abstracting: (p<=2)
states: 35,937 (4)
.abstracting: (p5<=p2)
states: 28,314 (4)
.
EG iterations: 1
abstracting: (p14<=2)
states: 22,869 (4)

EG iterations: 0
abstracting: (2<=p4)
states: 13,068 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [A [~ [EF [[[E [p9<=p15 U 1<=p5] | ~ [p7<=2]] & [[1<=p2 & p3<=3] & p6<=p7]]]] U [[[3<=p11 | p2<=3] & p10<=1] | EX [[[p11<=1 | [p6<=p8 | p10<=p13]] | EF [2<=p8]]]]]]
normalized: ~ [[~ [EG [~ [[EX [[E [true U 2<=p8] | [[p6<=p8 | p10<=p13] | p11<=1]]] | [[3<=p11 | p2<=3] & p10<=1]]]]] & ~ [E [~ [[EX [[E [true U 2<=p8] | [[p6<=p8 | p10<=p13] | p11<=1]]] | [[3<=p11 | p2<=3] & p10<=1]]] U [E [true U [[[1<=p2 & p3<=3] & p6<=p7] & [~ [p7<=2] | E [p9<=p15 U 1<=p5]]]] & ~ [[EX [[E [true U 2<=p8] | [[p6<=p8 | p10<=p13] | p11<=1]]] | [[3<=p11 | p2<=3] & p10<=1]]]]]]]]

abstracting: (p10<=1)
states: 32,670 (4)
abstracting: (p2<=3)
states: 34,848 (4)
abstracting: (3<=p11)
states: 13,068 (4)
abstracting: (p11<=1)
states: 14,157 (4)
abstracting: (p10<=p13)
states: 28,974 (4)
abstracting: (p6<=p8)
states: 14,157 (4)
abstracting: (2<=p8)
states: 8,712 (3)
.abstracting: (1<=p5)
states: 11,979 (4)
abstracting: (p9<=p15)
states: 20,427 (4)
abstracting: (p7<=2)
states: 31,581 (4)
abstracting: (p6<=p7)
states: 16,335 (4)
abstracting: (p3<=3)
states: 35,937 (4)
abstracting: (1<=p2)
states: 22,869 (4)
abstracting: (p10<=1)
states: 32,670 (4)
abstracting: (p2<=3)
states: 34,848 (4)
abstracting: (3<=p11)
states: 13,068 (4)
abstracting: (p11<=1)
states: 14,157 (4)
abstracting: (p10<=p13)
states: 28,974 (4)
abstracting: (p6<=p8)
states: 14,157 (4)
abstracting: (2<=p8)
states: 8,712 (3)
.abstracting: (p10<=1)
states: 32,670 (4)
abstracting: (p2<=3)
states: 34,848 (4)
abstracting: (3<=p11)
states: 13,068 (4)
abstracting: (p11<=1)
states: 14,157 (4)
abstracting: (p10<=p13)
states: 28,974 (4)
abstracting: (p6<=p8)
states: 14,157 (4)
abstracting: (2<=p8)
states: 8,712 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [[A [2<=p2 U EG [~ [2<=p]]] | [[[~ [AF [2<=p5]] & [[2<=p & E [1<=p11 U p3<=1]] | [EG [p6<=1] & [p3<=3 | p10<=1]]]] | [1<=p11 & E [~ [p9<=0] U E [p12<=p4 U p3<=p6]]]] & [[E [[3<=p9 | p11<=2] U E [1<=p14 U p7<=p6]] & p12<=0] & [3<=p8 | [[p2<=p2 & EX [p14<=p2]] & [p7<=p12 & 2<=p2]]]]]] U p15<=p8]
normalized: [~ [EG [~ [p15<=p8]]] & ~ [E [~ [p15<=p8] U [~ [[[[[3<=p8 | [[p7<=p12 & 2<=p2] & [p2<=p2 & EX [p14<=p2]]]] & [p12<=0 & E [[3<=p9 | p11<=2] U E [1<=p14 U p7<=p6]]]] & [[1<=p11 & E [~ [p9<=0] U E [p12<=p4 U p3<=p6]]] | [[[[p3<=3 | p10<=1] & EG [p6<=1]] | [2<=p & E [1<=p11 U p3<=1]]] & EG [~ [2<=p5]]]]] | [~ [EG [~ [EG [~ [2<=p]]]]] & ~ [E [~ [EG [~ [2<=p]]] U [~ [2<=p2] & ~ [EG [~ [2<=p]]]]]]]]] & ~ [p15<=p8]]]]]

abstracting: (p15<=p8)
states: 28,974 (4)
abstracting: (2<=p)
states: 0

EG iterations: 0
abstracting: (2<=p2)
states: 10,890 (4)
abstracting: (2<=p)
states: 0

EG iterations: 0
abstracting: (2<=p)
states: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (2<=p5)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (p3<=1)
states: 27,225 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (2<=p)
states: 0
abstracting: (p6<=1)
states: 14,157 (4)
.
EG iterations: 1
abstracting: (p10<=1)
states: 32,670 (4)
abstracting: (p3<=3)
states: 35,937 (4)
abstracting: (p3<=p6)
states: 28,809 (4)
abstracting: (p12<=p4)
states: 22,902 (4)
abstracting: (p9<=0)
states: 17,424 (4)
abstracting: (1<=p11)
states: 27,225 (4)
abstracting: (p7<=p6)
states: 27,225 (4)
abstracting: (1<=p14)
states: 18,513 (4)
abstracting: (p11<=2)
states: 22,869 (4)
abstracting: (3<=p9)
states: 13,068 (4)
abstracting: (p12<=0)
states: 13,068 (4)
abstracting: (p14<=p2)
states: 22,176 (4)
.abstracting: (p2<=p2)
states: 35,937 (4)
abstracting: (2<=p2)
states: 10,890 (4)
abstracting: (p7<=p12)
states: 23,100 (4)
abstracting: (3<=p8)
states: 3,267 (3)
abstracting: (p15<=p8)
states: 28,974 (4)
abstracting: (p15<=p8)
states: 28,974 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 23093 (2.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 32486 34605 67091
used/not used/entry size/cache size: 50420 67058444 16 1024MB
basic ops cache: hits/miss/sum: 22027 19876 41903
used/not used/entry size/cache size: 39030 16738186 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: 1884 1498 3382
used/not used/entry size/cache size: 1498 8387110 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 67087306
1 20764
2 580
3 60
4 53
5 25
6 27
7 9
8 10
9 7
>= 10 23

Total processing time: 0m 4.615sec


BK_STOP 1678608103274

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

check for maximal unmarked siphon
ok
check for constant places
p
found 1 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:116 (4), effective:36 (1)

initing FirstDep: 0m 0.000sec


iterations count:121 (4), effective:33 (1)

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

iterations count:44 (1), effective:5 (0)

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

iterations count:51 (2), effective:6 (0)

iterations count:39 (1), effective:5 (0)

iterations count:39 (1), effective:5 (0)

iterations count:39 (1), effective:5 (0)

iterations count:28 (1), effective:3 (0)

iterations count:53 (2), effective:9 (0)

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

iterations count:77 (3), effective:16 (0)

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

iterations count:58 (2), effective:12 (0)

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

iterations count:43 (1), effective:8 (0)

iterations count:43 (1), effective:8 (0)

iterations count:43 (1), effective:8 (0)

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

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

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

iterations count:59 (2), effective:12 (0)

iterations count:46 (1), effective:8 (0)

iterations count:100 (4), effective:26 (1)

iterations count:59 (2), effective:12 (0)

iterations count:59 (2), effective:12 (0)

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

iterations count:28 (1), effective:3 (0)

iterations count:28 (1), effective:3 (0)

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

iterations count:38 (1), effective:4 (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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r225-tall-167856407200137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 ;