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.r321-tall-167889192000305.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 Raft-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192000305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Raft-PT-04-CTLCardinality-00
FORMULA_NAME Raft-PT-04-CTLCardinality-01
FORMULA_NAME Raft-PT-04-CTLCardinality-02
FORMULA_NAME Raft-PT-04-CTLCardinality-03
FORMULA_NAME Raft-PT-04-CTLCardinality-04
FORMULA_NAME Raft-PT-04-CTLCardinality-05
FORMULA_NAME Raft-PT-04-CTLCardinality-06
FORMULA_NAME Raft-PT-04-CTLCardinality-07
FORMULA_NAME Raft-PT-04-CTLCardinality-08
FORMULA_NAME Raft-PT-04-CTLCardinality-09
FORMULA_NAME Raft-PT-04-CTLCardinality-10
FORMULA_NAME Raft-PT-04-CTLCardinality-11
FORMULA_NAME Raft-PT-04-CTLCardinality-12
FORMULA_NAME Raft-PT-04-CTLCardinality-13
FORMULA_NAME Raft-PT-04-CTLCardinality-14
FORMULA_NAME Raft-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678927239275

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=Raft-PT-04
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: Raft_PT_04
(NrP: 88 NrTr: 160 NrArc: 563)

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

net check time: 0m 0.000sec

init dd package: 0m 2.976sec


RS generation: 2m 7.885sec


-> reachability set: #nodes 1213420 (1.2e+06) #states 2,965,858,466,581 (12)



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

checking: EF [~ [p24<=1]]
normalized: E [true U ~ [p24<=1]]

abstracting: (p24<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [AG [AF [EF [[1<=p14 | AF [p58<=0]]]]]]
normalized: E [true U EG [~ [E [true U [1<=p14 | ~ [EG [~ [p58<=0]]]]]]]]

abstracting: (p58<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 588,876,726,020 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.172sec

checking: EX [EF [p3<=p29]]
normalized: EX [E [true U p3<=p29]]

abstracting: (p3<=p29)
states: 2,493,683,343,941 (12)
.-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.012sec

checking: AG [[AX [AF [~ [[1<=p64 | 1<=p3]]]] | p14<=p84]]
normalized: ~ [E [true U ~ [[p14<=p84 | ~ [EX [EG [[1<=p64 | 1<=p3]]]]]]]]

abstracting: (1<=p3)
states: 588,876,726,020 (11)
abstracting: (1<=p64)
states: 588,876,726,020 (11)
.
EG iterations: 1
.abstracting: (p14<=p84)
states: 2,494,757,085,765 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m52.248sec

checking: AX [EF [[E [AG [p12<=0] U ~ [EX [p39<=p71]]] & EF [~ [[p21<=1 | 1<=p43]]]]]]
normalized: ~ [EX [~ [E [true U [E [true U ~ [[p21<=1 | 1<=p43]]] & E [~ [E [true U ~ [p12<=0]]] U ~ [EX [p39<=p71]]]]]]]]

abstracting: (p39<=p71)
states: 2,493,683,343,941 (12)

before gc: list nodes free: 1516240

after gc: idd nodes used:4157956, unused:59842044; list nodes free:286964716
.abstracting: (p12<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p43)
states: 588,876,726,020 (11)
abstracting: (p21<=1)
states: 2,965,858,466,581 (12)
.-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.921sec

checking: AF [E [AG [p50<=1] U [[[AF [p6<=1] | AX [p66<=p24]] & ~ [E [1<=p51 U p1<=0]]] | 1<=p8]]]
normalized: ~ [EG [~ [E [~ [E [true U ~ [p50<=1]]] U [1<=p8 | [~ [E [1<=p51 U p1<=0]] & [~ [EX [~ [p66<=p24]]] | ~ [EG [~ [p6<=1]]]]]]]]]]

abstracting: (p6<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (p66<=p24)
states: 2,493,683,343,941 (12)
.abstracting: (p1<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p51)
states: 588,876,726,020 (11)
abstracting: (1<=p8)
states: 588,876,726,020 (11)
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.557sec

checking: E [[AX [[~ [AX [p44<=p47]] | EX [p75<=0]]] | p87<=1] U AX [[[1<=p68 & AG [p42<=0]] & 1<=p32]]]
normalized: E [[p87<=1 | ~ [EX [~ [[EX [p75<=0] | EX [~ [p44<=p47]]]]]]] U ~ [EX [~ [[1<=p32 & [1<=p68 & ~ [E [true U ~ [p42<=0]]]]]]]]]

abstracting: (p42<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p68)
states: 588,876,726,020 (11)
abstracting: (1<=p32)
states: 588,876,726,020 (11)
.abstracting: (p44<=p47)
states: 2,493,683,343,941 (12)
.abstracting: (p75<=0)
states: 2,355,506,904,081 (12)
..abstracting: (p87<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.898sec

checking: EX [EX [AX [[[[p78<=p41 | p81<=1] | [p54<=p23 | 1<=p37]] & AF [1<=p54]]]]]
normalized: EX [EX [~ [EX [~ [[~ [EG [~ [1<=p54]]] & [[p54<=p23 | 1<=p37] | [p78<=p41 | p81<=1]]]]]]]]

abstracting: (p81<=1)
states: 2,965,858,466,581 (12)
abstracting: (p78<=p41)
states: 2,493,683,343,941 (12)
abstracting: (1<=p37)
states: 588,876,726,020 (11)
abstracting: (p54<=p23)
states: 2,493,683,343,941 (12)
abstracting: (1<=p54)
states: 588,876,726,020 (11)
.
EG iterations: 1
...-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.480sec

checking: [E [p23<=1 U EF [AG [[~ [p51<=0] | 1<=p62]]]] & EF [[AF [~ [[[p41<=0 & p45<=0] & E [1<=p82 U p74<=p49]]]] | EG [AF [[p73<=0 | 1<=p79]]]]]]
normalized: [E [true U [EG [~ [EG [~ [[p73<=0 | 1<=p79]]]]] | ~ [EG [[E [1<=p82 U p74<=p49] & [p41<=0 & p45<=0]]]]]] & E [p23<=1 U E [true U ~ [E [true U ~ [[1<=p62 | ~ [p51<=0]]]]]]]]

abstracting: (p51<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p62)
states: 588,876,726,020 (11)
abstracting: (p23<=1)
states: 2,965,858,466,581 (12)
abstracting: (p45<=0)
states: 2,355,506,904,081 (12)
abstracting: (p41<=0)
states: 2,376,981,740,561 (12)
abstracting: (p74<=p49)
states: 2,493,683,343,941 (12)
abstracting: (1<=p82)
states: 593,171,693,316 (11)
..
EG iterations: 2
abstracting: (1<=p79)
states: 588,876,726,020 (11)
abstracting: (p73<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.639sec

checking: AG [[[1<=p79 | EX [AG [A [p50<=0 U p84<=p50]]]] | E [A [EG [p72<=p5] U AG [1<=p57]] U [~ [p71<=p62] & AF [[p29<=0 | 1<=p34]]]]]]
normalized: ~ [E [true U ~ [[E [[~ [EG [E [true U ~ [1<=p57]]]] & ~ [E [E [true U ~ [1<=p57]] U [~ [EG [p72<=p5]] & E [true U ~ [1<=p57]]]]]] U [~ [EG [~ [[p29<=0 | 1<=p34]]]] & ~ [p71<=p62]]] | [1<=p79 | EX [~ [E [true U ~ [[~ [EG [~ [p84<=p50]]] & ~ [E [~ [p84<=p50] U [~ [p50<=0] & ~ [p84<=p50]]]]]]]]]]]]]]

abstracting: (p84<=p50)
states: 2,494,757,085,765 (12)
abstracting: (p50<=0)
states: 2,355,506,904,081 (12)
abstracting: (p84<=p50)
states: 2,494,757,085,765 (12)
abstracting: (p84<=p50)
states: 2,494,757,085,765 (12)
.
EG iterations: 1

before gc: list nodes free: 3031390

after gc: idd nodes used:6705157, unused:57294843; list nodes free:275241981
.abstracting: (1<=p79)
states: 588,876,726,020 (11)
abstracting: (p71<=p62)
states: 2,493,683,343,941 (12)
abstracting: (1<=p34)
states: 588,876,726,020 (11)
abstracting: (p29<=0)
states: 2,376,981,740,561 (12)
.
EG iterations: 1
abstracting: (1<=p57)
states: 588,876,726,020 (11)
abstracting: (p72<=p5)
states: 2,499,052,053,061 (12)
.
EG iterations: 1
abstracting: (1<=p57)
states: 588,876,726,020 (11)

before gc: list nodes free: 2167035

after gc: idd nodes used:9004560, unused:54995440; list nodes free:264398108
abstracting: (1<=p57)
states: 588,876,726,020 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m25.220sec

checking: AG [AF [[EG [[[p81<=0 | 1<=p77] | ~ [p16<=p83]]] | [[[[p52<=p7 | 1<=p83] | [p50<=0 | p67<=1]] | 1<=p8] & p43<=1]]]]
normalized: ~ [E [true U EG [~ [[[p43<=1 & [1<=p8 | [[p50<=0 | p67<=1] | [p52<=p7 | 1<=p83]]]] | EG [[~ [p16<=p83] | [p81<=0 | 1<=p77]]]]]]]]

abstracting: (1<=p77)
states: 588,876,726,020 (11)
abstracting: (p81<=0)
states: 2,372,686,773,265 (12)
abstracting: (p16<=p83)
states: 2,494,757,085,765 (12)
..
EG iterations: 2
abstracting: (1<=p83)
states: 593,171,693,316 (11)
abstracting: (p52<=p7)
states: 2,493,683,343,941 (12)
abstracting: (p67<=1)
states: 2,965,858,466,581 (12)
abstracting: (p50<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p8)
states: 588,876,726,020 (11)
abstracting: (p43<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.796sec

checking: EG [[[~ [[~ [1<=p29] | ~ [p26<=p58]]] | AF [[1<=p84 & [A [p35<=p6 U p40<=p42] & AG [p6<=0]]]]] & [1<=p14 & 1<=p53]]]
normalized: EG [[[1<=p14 & 1<=p53] & [~ [EG [~ [[1<=p84 & [~ [E [true U ~ [p6<=0]]] & [~ [EG [~ [p40<=p42]]] & ~ [E [~ [p40<=p42] U [~ [p35<=p6] & ~ [p40<=p42]]]]]]]]]] | ~ [[~ [p26<=p58] | ~ [1<=p29]]]]]]

abstracting: (1<=p29)
states: 588,876,726,020 (11)
abstracting: (p26<=p58)
states: 2,493,683,343,941 (12)
abstracting: (p40<=p42)
states: 2,477,577,216,581 (12)
abstracting: (p35<=p6)
states: 2,477,577,216,581 (12)
abstracting: (p40<=p42)
states: 2,477,577,216,581 (12)
abstracting: (p40<=p42)
states: 2,477,577,216,581 (12)
.
EG iterations: 1
abstracting: (p6<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p84)
states: 593,171,693,316 (11)

EG iterations: 0
abstracting: (1<=p53)
states: 588,876,726,020 (11)
abstracting: (1<=p14)
states: 588,876,726,020 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.642sec

checking: EX [A [~ [p67<=p3] U [A [~ [[p33<=p63 | p30<=p77]] U [~ [p14<=1] | AX [1<=p35]]] & [~ [p64<=0] | p0<=p75]]]]
normalized: EX [[~ [EG [~ [[[p0<=p75 | ~ [p64<=0]] & [~ [EG [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]] & ~ [E [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]] U [[p33<=p63 | p30<=p77] & ~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]]]]]]]] & ~ [E [~ [[[p0<=p75 | ~ [p64<=0]] & [~ [EG [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]] & ~ [E [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]] U [[p33<=p63 | p30<=p77] & ~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]]]]]] U [p67<=p3 & ~ [[[p0<=p75 | ~ [p64<=0]] & [~ [EG [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]] & ~ [E [~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]] U [[p33<=p63 | p30<=p77] & ~ [[~ [EX [~ [1<=p35]]] | ~ [p14<=1]]]]]]]]]]]]]]

abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)

before gc: list nodes free: 253022

after gc: idd nodes used:12050057, unused:51949943; list nodes free:250399523
.abstracting: (p30<=p77)
states: 2,477,577,216,581 (12)
abstracting: (p33<=p63)
states: 2,493,683,343,941 (12)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
.abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
..
EG iterations: 1
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
abstracting: (p0<=p75)
states: 2,965,858,466,580 (12)
abstracting: (p67<=p3)
states: 2,493,683,343,941 (12)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
.abstracting: (p30<=p77)
states: 2,477,577,216,581 (12)
abstracting: (p33<=p63)
states: 2,493,683,343,941 (12)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
.abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
..
EG iterations: 1
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
abstracting: (p0<=p75)
states: 2,965,858,466,580 (12)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
.abstracting: (p30<=p77)
states: 2,477,577,216,581 (12)
abstracting: (p33<=p63)
states: 2,493,683,343,941 (12)
abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
.abstracting: (p14<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p35)
states: 610,351,562,500 (11)
..
EG iterations: 1
abstracting: (p64<=0)
states: 2,376,981,740,561 (12)
abstracting: (p0<=p75)
states: 2,965,858,466,580 (12)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Raft-PT-04-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m59.991sec

checking: [E [1<=p76 U ~ [[EX [~ [[1<=p9 | 1<=p10]]] & [p7<=0 & [AF [p37<=p33] | ~ [AX [1<=p62]]]]]]] & [EF [A [~ [p55<=1] U ~ [AF [1<=p1]]]] | AF [EG [~ [[AX [p50<=1] | [p18<=1 & p4<=p73]]]]]]]
normalized: [[~ [EG [~ [EG [~ [[[p18<=1 & p4<=p73] | ~ [EX [~ [p50<=1]]]]]]]]] | E [true U [~ [EG [~ [EG [~ [1<=p1]]]]] & ~ [E [~ [EG [~ [1<=p1]]] U [p55<=1 & ~ [EG [~ [1<=p1]]]]]]]]] & E [1<=p76 U ~ [[[p7<=0 & [EX [~ [1<=p62]] | ~ [EG [~ [p37<=p33]]]]] & EX [~ [[1<=p9 | 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 610,351,562,500 (11)
abstracting: (1<=p9)
states: 588,876,726,020 (11)
.abstracting: (p37<=p33)
states: 2,493,683,343,941 (12)
.
EG iterations: 1
abstracting: (1<=p62)
states: 588,876,726,020 (11)
.abstracting: (p7<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p76)
states: 588,876,726,020 (11)
abstracting: (1<=p1)
states: 588,876,726,020 (11)
.
EG iterations: 1
abstracting: (p55<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p1)
states: 588,876,726,020 (11)
.
EG iterations: 1
abstracting: (1<=p1)
states: 588,876,726,020 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p50<=1)
states: 2,965,858,466,581 (12)
.abstracting: (p4<=p73)
states: 2,493,683,343,941 (12)
abstracting: (p18<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m11.856sec

checking: EF [E [~ [p31<=p30] U [[[[~ [p13<=1] | EF [1<=p37]] | [AG [p35<=1] | p6<=p85]] | [[~ [p31<=p60] & [p43<=p77 & 1<=p7]] & [AX [p23<=p29] & ~ [1<=p19]]]] & EF [AG [p10<=1]]]]]
normalized: E [true U E [~ [p31<=p30] U [E [true U ~ [E [true U ~ [p10<=1]]]] & [[[~ [1<=p19] & ~ [EX [~ [p23<=p29]]]] & [[p43<=p77 & 1<=p7] & ~ [p31<=p60]]] | [[p6<=p85 | ~ [E [true U ~ [p35<=1]]]] | [E [true U 1<=p37] | ~ [p13<=1]]]]]]]

abstracting: (p13<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p37)
states: 588,876,726,020 (11)
abstracting: (p35<=1)
states: 2,965,858,466,581 (12)
abstracting: (p6<=p85)
states: 2,524,200,922,066 (12)
abstracting: (p31<=p60)
states: 2,499,052,053,061 (12)
abstracting: (1<=p7)
states: 588,876,726,020 (11)
abstracting: (p43<=p77)
states: 2,493,683,343,941 (12)
abstracting: (p23<=p29)
states: 2,493,683,343,941 (12)
.abstracting: (1<=p19)
states: 588,876,726,020 (11)
abstracting: (p10<=1)
states: 2,965,858,466,581 (12)
abstracting: (p31<=p30)
states: 2,499,052,053,061 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.151sec

checking: [E [[[p75<=1 | ~ [A [AX [1<=p6] U AX [p20<=1]]]] & ~ [[EG [[p21<=p76 | 1<=p84]] & p15<=p23]]] U E [[1<=p26 | p33<=1] U EX [AG [p7<=1]]]] | ~ [AX [~ [[~ [A [1<=p24 U p9<=1]] & AX [E [p54<=p39 U p38<=p40]]]]]]]
normalized: [EX [[~ [EX [~ [E [p54<=p39 U p38<=p40]]]] & ~ [[~ [EG [~ [p9<=1]]] & ~ [E [~ [p9<=1] U [~ [1<=p24] & ~ [p9<=1]]]]]]]] | E [[~ [[p15<=p23 & EG [[p21<=p76 | 1<=p84]]]] & [p75<=1 | ~ [[~ [EG [EX [~ [p20<=1]]]] & ~ [E [EX [~ [p20<=1]] U [EX [~ [1<=p6]] & EX [~ [p20<=1]]]]]]]]] U E [[1<=p26 | p33<=1] U EX [~ [E [true U ~ [p7<=1]]]]]]]

abstracting: (p7<=1)
states: 2,965,858,466,581 (12)
.abstracting: (p33<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p26)
states: 588,876,726,020 (11)
abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
.abstracting: (1<=p6)
states: 588,876,726,020 (11)

before gc: list nodes free: 2174332

after gc: idd nodes used:15174131, unused:48825869; list nodes free:235303811
.abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
.abstracting: (p20<=1)
states: 2,965,858,466,581 (12)
..
EG iterations: 1
abstracting: (p75<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p84)
states: 593,171,693,316 (11)
abstracting: (p21<=p76)
states: 2,493,683,343,941 (12)
.
EG iterations: 1
abstracting: (p15<=p23)
states: 2,477,577,216,581 (12)
abstracting: (p9<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p24)
states: 588,876,726,020 (11)
abstracting: (p9<=1)
states: 2,965,858,466,581 (12)
abstracting: (p9<=1)
states: 2,965,858,466,581 (12)
.
EG iterations: 1
abstracting: (p38<=p40)
states: 2,376,981,740,561 (12)
abstracting: (p54<=p39)
states: 2,493,683,343,941 (12)
..-> the formula is TRUE

FORMULA Raft-PT-04-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.301sec

totally nodes used: 310143687 (3.1e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 765292048 1917159119 2682451167
used/not used/entry size/cache size: 57599863 9509001 16 1024MB
basic ops cache: hits/miss/sum: 105052005 249508774 354560779
used/not used/entry size/cache size: 11556365 5220851 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: 10097899 24082244 34180143
used/not used/entry size/cache size: 2233324 6155284 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 39253054
1 20318853
2 5988635
3 1293251
4 220293
5 30646
6 3699
7 393
8 35
9 5
>= 10 0

Total processing time: 25m34.763sec


BK_STOP 1678928774115

--------------------
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

177612 1120563 1129342 1169487 1237728
iterations count:523821 (3273), effective:23901 (149)

initing FirstDep: 0m 0.000sec


iterations count:346 (2), effective:10 (0)

iterations count:1146 (7), effective:20 (0)

iterations count:2188 (13), effective:88 (0)

iterations count:955 (5), effective:18 (0)

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

iterations count:531 (3), effective:5 (0)

iterations count:695 (4), effective:22 (0)

iterations count:982 (6), effective:19 (0)

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

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

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

iterations count:540 (3), effective:11 (0)

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

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

iterations count:809 (5), effective:24 (0)

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

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

iterations count:488 (3), effective:19 (0)

iterations count:575 (3), effective:25 (0)

iterations count:641 (4), effective:18 (0)

iterations count:414 (2), effective:16 (0)

iterations count:414 (2), effective:16 (0)

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

iterations count:414 (2), effective:16 (0)

iterations count:450 (2), effective:13 (0)

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

iterations count:531 (3), effective:5 (0)

iterations count:1351 (8), effective:19 (0)

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

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

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

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

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

iterations count:495 (3), effective:5 (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="Raft-PT-04"
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 Raft-PT-04, 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 r321-tall-167889192000305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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