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.r385-oct2-167903709800201.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903709800201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.5K Feb 25 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 34K 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 ShieldIIPt-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-002B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679042495163

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=ShieldIIPt-PT-002B
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: ShieldIIPt_PT_002B
(NrP: 143 NrTr: 133 NrArc: 330)

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

net check time: 0m 0.000sec

init dd package: 0m 2.934sec


RS generation: 0m 2.435sec


-> reachability set: #nodes 61982 (6.2e+04) #states 3,407,669,456,341 (12)



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

checking: ~ [AF [1<=p102]]
normalized: EG [~ [1<=p102]]

abstracting: (1<=p102)
states: 346,360,680,558 (11)
......................................................................................................................
EG iterations: 118
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.168sec

checking: [AF [~ [p86<=p104]] | ~ [EX [AX [p7<=1]]]]
normalized: [~ [EG [p86<=p104]] | ~ [EX [~ [EX [~ [p7<=1]]]]]]

abstracting: (p7<=1)
states: 3,407,669,456,341 (12)
..abstracting: (p86<=p104)
states: 3,033,529,384,867 (12)
.....................................................................................................................
EG iterations: 117
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.244sec

checking: AG [AG [[EG [p116<=p49] | EF [EF [p125<=0]]]]]
normalized: ~ [E [true U E [true U ~ [[E [true U E [true U p125<=0]] | EG [p116<=p49]]]]]]

abstracting: (p116<=p49)
states: 2,952,219,055,489 (12)
.......................................................................................................................................................................
EG iterations: 167
abstracting: (p125<=0)
states: 3,022,673,178,223 (12)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.440sec

checking: AG [E [p31<=0 U [p132<=1 & ~ [1<=p4]]]]
normalized: ~ [E [true U ~ [E [p31<=0 U [p132<=1 & ~ [1<=p4]]]]]]

abstracting: (1<=p4)
states: 1,142,237,776,392 (12)
abstracting: (p132<=1)
states: 3,407,669,456,341 (12)
abstracting: (p31<=0)
states: 3,032,597,387,209 (12)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.936sec

checking: EF [EX [[[~ [EF [p95<=p37]] & [~ [p20<=1] & EF [1<=p131]]] & EG [~ [1<=p79]]]]]
normalized: E [true U EX [[EG [~ [1<=p79]] & [[E [true U 1<=p131] & ~ [p20<=1]] & ~ [E [true U p95<=p37]]]]]]

abstracting: (p95<=p37)
states: 2,395,726,164,877 (12)
abstracting: (p20<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p131)
states: 292,734 (5)
abstracting: (1<=p79)
states: 160,128 (5)
..........
before gc: list nodes free: 1458322

after gc: idd nodes used:201573, unused:63798427; list nodes free:292707267
.........................
EG iterations: 35
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.038sec

checking: ~ [EG [[p118<=1 | [EG [[EG [p73<=p116] | p86<=0]] | EF [p79<=1]]]]]
normalized: ~ [EG [[p118<=1 | [E [true U p79<=1] | EG [[p86<=0 | EG [p73<=p116]]]]]]]

abstracting: (p73<=p116)
states: 3,407,552,504,990 (12)
.............................................
EG iterations: 45
abstracting: (p86<=0)
states: 2,986,556,973,085 (12)
.
EG iterations: 1
abstracting: (p79<=1)
states: 3,407,669,456,341 (12)
abstracting: (p118<=1)
states: 3,407,669,456,341 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.168sec

checking: A [EX [~ [p28<=0]] U EG [[p20<=p21 & [AX [p25<=p53] | 1<=p57]]]]
normalized: [~ [EG [~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]]]] & ~ [E [~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]] U [~ [EX [~ [p28<=0]]] & ~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]]]]]]

abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
.............................................................................
before gc: list nodes free: 839017

after gc: idd nodes used:1315956, unused:62684044; list nodes free:291730484
...................................................................
EG iterations: 144
abstracting: (p28<=0)
states: 2,271,852,076,135 (12)
.abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
............................................
before gc: list nodes free: 1062935

after gc: idd nodes used:1241324, unused:62758676; list nodes free:292028348
....................................................................................................
EG iterations: 144

before gc: list nodes free: 1384462

after gc: idd nodes used:363646, unused:63636354; list nodes free:296163971
abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
...................................................MC time: 5m50.012sec

checking: AF [EX [~ [EX [[[p55<=p124 | p40<=p4] | [p65<=1 | p129<=0]]]]]]
normalized: ~ [EG [~ [EX [~ [EX [[[p65<=1 | p129<=0] | [p55<=p124 | p40<=p4]]]]]]]]

abstracting: (p40<=p4)
states: 3,391,536,772,555 (12)
abstracting: (p55<=p124)
states: 3,065,392,747,249 (12)
abstracting: (p129<=0)
states: 3,022,649,584,195 (12)
abstracting: (p65<=1)
states: 3,407,669,456,341 (12)
...........................................................................................................................
EG iterations: 121
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.538sec

checking: EF [~ [EX [~ [[[AG [p25<=p13] | 1<=p79] & [EG [p37<=p18] & AX [p12<=p33]]]]]]]
normalized: E [true U ~ [EX [~ [[[~ [EX [~ [p12<=p33]]] & EG [p37<=p18]] & [1<=p79 | ~ [E [true U ~ [p25<=p13]]]]]]]]]

abstracting: (p25<=p13)
states: 2,635,476,675,691 (12)

before gc: list nodes free: 2302268

after gc: idd nodes used:394349, unused:63605651; list nodes free:296024055
abstracting: (1<=p79)
states: 160,128 (5)
abstracting: (p37<=p18)
states: 3,086,441,087,143 (12)
.......................................................................................................................................
EG iterations: 135
abstracting: (p12<=p33)
states: 3,351,809,831,221 (12)
..-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m20.264sec

checking: EG [[AX [E [[A [1<=p100 U p36<=1] & 1<=p100] U [[p2<=1 | 1<=p9] & [p139<=0 | 1<=p79]]]] | EF [EG [[p79<=p99 | [1<=p131 & p93<=1]]]]]]
normalized: EG [[E [true U EG [[p79<=p99 | [1<=p131 & p93<=1]]]] | ~ [EX [~ [E [[1<=p100 & [~ [EG [~ [p36<=1]]] & ~ [E [~ [p36<=1] U [~ [1<=p100] & ~ [p36<=1]]]]]] U [[p139<=0 | 1<=p79] & [p2<=1 | 1<=p9]]]]]]]]

abstracting: (1<=p9)
states: 13,226,640 (7)
abstracting: (p2<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p79)
states: 160,128 (5)
abstracting: (p139<=0)
states: 3,020,488,807,384 (12)
abstracting: (p36<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p100)
states: 346,360,680,558 (11)
abstracting: (p36<=1)
states: 3,407,669,456,341 (12)
abstracting: (p36<=1)
states: 3,407,669,456,341 (12)
.
EG iterations: 1
abstracting: (1<=p100)
states: 346,360,680,558 (11)
.abstracting: (p93<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p131)
states: 292,734 (5)
abstracting: (p79<=p99)
states: 3,407,669,296,213 (12)
.............................
EG iterations: 29

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.531sec

checking: A [[[AX [1<=p24] | EG [EF [[p99<=0 | p36<=p106]]]] & EX [[[AF [p78<=0] & ~ [p27<=0]] & ~ [[~ [1<=p46] | EF [p116<=0]]]]]] U AF [EG [EG [E [p42<=p30 U 1<=p47]]]]]
normalized: [~ [EG [EG [~ [EG [EG [E [p42<=p30 U 1<=p47]]]]]]] & ~ [E [EG [~ [EG [EG [E [p42<=p30 U 1<=p47]]]]] U [~ [[EX [[~ [[E [true U p116<=0] | ~ [1<=p46]]] & [~ [p27<=0] & ~ [EG [~ [p78<=0]]]]]] & [EG [E [true U [p99<=0 | p36<=p106]]] | ~ [EX [~ [1<=p24]]]]]] & EG [~ [EG [EG [E [p42<=p30 U 1<=p47]]]]]]]]]

abstracting: (1<=p47)
states: 463,309,226,676 (11)
abstracting: (p42<=p30)
states: 2,993,581,272,865 (12)
...............................................................................................
EG iterations: 95
.
EG iterations: 1
.........................................
before gc: list nodes free: 3862866

after gc: idd nodes used:976211, unused:63023789; list nodes free:293351412
........................................................................
EG iterations: 113
abstracting: (1<=p24)
states: 1,108,371,489,552 (12)
.abstracting: (p36<=p106)
states: 3,070,256,129,041 (12)
abstracting: (p99<=0)
states: 3,084,636,662,419 (12)

EG iterations: 0
abstracting: (p78<=0)
states: 3,407,669,416,309 (12)
..............................
EG iterations: 30
abstracting: (p27<=0)
states: 2,271,851,742,901 (12)
abstracting: (1<=p46)
states: 463,309,226,676 (11)
abstracting: (p116<=0)
states: 2,945,428,819,621 (12)
.abstracting: (1<=p47)
states: 463,309,226,676 (11)
abstracting: (p42<=p30)
states: 2,993,581,272,865 (12)
...............................................................................................
EG iterations: 95
.
EG iterations: 1
.................................................................................................................
EG iterations: 113
abstracting: (1<=p47)
states: 463,309,226,676 (11)
abstracting: (p42<=p30)
states: 2,993,581,272,865 (12)
...............................................................................................
EG iterations: 95
.
EG iterations: 1
.................................................................................................................
EG iterations: 113
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m40.053sec

checking: ~ [[EX [[p123<=0 | p101<=p120]] & EG [[[[AF [1<=p78] | E [1<=p26 U 1<=p31]] | A [p75<=p139 U p11<=0]] & A [~ [1<=p77] U [1<=p75 | p107<=p114]]]]]]
normalized: ~ [[EG [[[~ [EG [~ [[1<=p75 | p107<=p114]]]] & ~ [E [~ [[1<=p75 | p107<=p114]] U [1<=p77 & ~ [[1<=p75 | p107<=p114]]]]]] & [[~ [EG [~ [p11<=0]]] & ~ [E [~ [p11<=0] U [~ [p75<=p139] & ~ [p11<=0]]]]] | [E [1<=p26 U 1<=p31] | ~ [EG [~ [1<=p78]]]]]]] & EX [[p123<=0 | p101<=p120]]]]

abstracting: (p101<=p120)
states: 3,061,308,775,783 (12)
abstracting: (p123<=0)
states: 3,023,061,605,833 (12)
.abstracting: (1<=p78)
states: 40,032 (4)
...............................
EG iterations: 31
abstracting: (1<=p31)
states: 375,072,069,132 (11)
abstracting: (1<=p26)
states: 1,135,963,269,504 (12)
abstracting: (p11<=0)
states: 3,406,006,533,493 (12)
abstracting: (p75<=p139)
states: 3,407,669,455,507 (12)
abstracting: (p11<=0)
states: 3,406,006,533,493 (12)
abstracting: (p11<=0)
states: 3,406,006,533,493 (12)
..............................................................
EG iterations: 62
abstracting: (p107<=p114)
states: 3,105,805,488,763 (12)
abstracting: (1<=p75)
states: 834
abstracting: (1<=p77)
states: 10,008 (4)
abstracting: (p107<=p114)
states: 3,105,805,488,763 (12)
abstracting: (1<=p75)
states: 834
abstracting: (p107<=p114)
states: 3,105,805,488,763 (12)
abstracting: (1<=p75)
states: 834
.....................................................................................................................
EG iterations: 117
.................
before gc: list nodes free: 3924205

after gc: idd nodes used:865077, unused:63134923; list nodes free:293835237
.........................................................................................................
EG iterations: 122
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.712sec

checking: ~ [[EX [[[[1<=p3 & AX [p123<=p56]] | [[EF [p132<=p3] | AF [p82<=p49]] & [AF [1<=p2] & EG [1<=p120]]]] & E [p140<=0 U [[p99<=p98 & p30<=1] | [1<=p137 | p92<=0]]]]] | AG [p86<=1]]]
normalized: ~ [[~ [E [true U ~ [p86<=1]]] | EX [[E [p140<=0 U [[1<=p137 | p92<=0] | [p99<=p98 & p30<=1]]] & [[[EG [1<=p120] & ~ [EG [~ [1<=p2]]]] & [~ [EG [~ [p82<=p49]]] | E [true U p132<=p3]]] | [1<=p3 & ~ [EX [~ [p123<=p56]]]]]]]]]

abstracting: (p123<=p56)
states: 3,066,629,502,532 (12)
.abstracting: (1<=p3)
states: 1,124,901,180,612 (12)
abstracting: (p132<=p3)
states: 3,407,669,065,195 (12)
abstracting: (p82<=p49)
states: 2,296,342,281,892 (12)
.....................................................................
before gc: list nodes free: 2581656

after gc: idd nodes used:1047890, unused:62952110; list nodes free:293079618
..........................................................................................................................................
EG iterations: 207
abstracting: (1<=p2)
states: 1,140,530,223,781 (12)
................................................................
before gc: list nodes free: 1712285

after gc: idd nodes used:2157253, unused:61842747; list nodes free:287864321
......................................
before gc: list nodes free: 744664

after gc: idd nodes used:3815648, unused:60184352; list nodes free:280200839
..........................
before gc: list nodes free: 552509

after gc: idd nodes used:2605274, unused:61394726; list nodes free:285592528
...................MC time: 9m32.034sec

checking: AG [~ [[[AX [[p97<=p29 | p50<=p95]] & [EG [p116<=0] | [~ [p87<=1] & E [p48<=p122 U 1<=p82]]]] | E [[[1<=p18 & p78<=1] | [p38<=0 & p96<=0]] U ~ [[p10<=p50 | p14<=1]]]]]]
normalized: ~ [E [true U [E [[[p38<=0 & p96<=0] | [1<=p18 & p78<=1]] U ~ [[p10<=p50 | p14<=1]]] | [[[E [p48<=p122 U 1<=p82] & ~ [p87<=1]] | EG [p116<=0]] & ~ [EX [~ [[p97<=p29 | p50<=p95]]]]]]]]

abstracting: (p50<=p95)
states: 3,374,324,922,193 (12)
abstracting: (p97<=p29)
states: 2,280,899,735,749 (12)
.abstracting: (p116<=0)
states: 2,945,428,819,621 (12)
.............................
before gc: list nodes free: 1324975

after gc: idd nodes used:1156026, unused:62843974; list nodes free:292572155
..........................................................................................................................................
EG iterations: 167
abstracting: (p87<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p82)
states: 1,127,885,472,957 (12)
abstracting: (p48<=p122)
states: 2,979,668,464,687 (12)
abstracting: (p14<=1)
states: 3,407,669,456,341 (12)
abstracting: (p10<=p50)
states: 3,407,629,776,421 (12)
abstracting: (p78<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p18)
states: 469,020,882,816 (11)
abstracting: (p96<=0)
states: 2,271,780,002,575 (12)
abstracting: (p38<=0)
states: 3,032,089,572,265 (12)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.396sec

checking: ~ [E [[AG [~ [[p85<=0 | AF [p117<=0]]]] & A [[[p55<=0 & p3<=0] & AF [1<=p57]] U [AG [p76<=p110] | [[1<=p133 | p124<=p130] | EF [p42<=0]]]]] U E [EG [A [1<=p26 U p141<=p36]] U AG [[p100<=0 | [1<=p133 & 1<=p78]]]]]]
normalized: ~ [E [[[~ [EG [~ [[[E [true U p42<=0] | [1<=p133 | p124<=p130]] | ~ [E [true U ~ [p76<=p110]]]]]]] & ~ [E [~ [[[E [true U p42<=0] | [1<=p133 | p124<=p130]] | ~ [E [true U ~ [p76<=p110]]]]] U [~ [[~ [EG [~ [1<=p57]]] & [p55<=0 & p3<=0]]] & ~ [[[E [true U p42<=0] | [1<=p133 | p124<=p130]] | ~ [E [true U ~ [p76<=p110]]]]]]]]] & ~ [E [true U [p85<=0 | ~ [EG [~ [p117<=0]]]]]]] U E [EG [[~ [EG [~ [p141<=p36]]] & ~ [E [~ [p141<=p36] U [~ [1<=p26] & ~ [p141<=p36]]]]]] U ~ [E [true U ~ [[p100<=0 | [1<=p133 & 1<=p78]]]]]]]]

abstracting: (1<=p78)
states: 40,032 (4)
abstracting: (1<=p133)
states: 333,669,015,996 (11)
abstracting: (p100<=0)
states: 3,061,308,775,783 (12)
abstracting: (p141<=p36)
states: 3,062,670,927,406 (12)
abstracting: (1<=p26)
states: 1,135,963,269,504 (12)
abstracting: (p141<=p36)
states: 3,062,670,927,406 (12)
abstracting: (p141<=p36)
states: 3,062,670,927,406 (12)
.............................
before gc: list nodes free: 4810381

after gc: idd nodes used:1743838, unused:62256162; list nodes free:289844659
......................................
before gc: list nodes free: 3179622

after gc: idd nodes used:2132775, unused:61867225; list nodes free:288121367
..............................................................................
before gc: list nodes free: 3309506

after gc: idd nodes used:1405994, unused:62594006; list nodes free:291437545
......................................................................................
EG iterations: 231
............................................................................................................................
EG iterations: 124

before gc: list nodes free: 3646917

after gc: idd nodes used:787672, unused:63212328; list nodes free:294260990
MC time: 9m 3.038sec

checking: [AF [E [AX [1<=p116] U [[[p57<=1 & [1<=p37 | 1<=p45]] & [A [1<=p14 U 1<=p55] & p115<=1]] | [AF [p57<=1] | [p25<=p113 & [p137<=p95 & p59<=p75]]]]]] & A [p114<=p136 U [E [~ [A [p99<=p116 U p37<=p65]] U EG [[1<=p69 & p102<=1]]] & EX [p140<=p127]]]]
normalized: [~ [EG [~ [E [~ [EX [~ [1<=p116]]] U [[[p57<=1 & [1<=p37 | 1<=p45]] & [p115<=1 & [~ [EG [~ [1<=p55]]] & ~ [E [~ [1<=p55] U [~ [1<=p14] & ~ [1<=p55]]]]]]] | [~ [EG [~ [p57<=1]]] | [p25<=p113 & [p137<=p95 & p59<=p75]]]]]]]] & [~ [EG [~ [[EX [p140<=p127] & E [~ [[~ [EG [~ [p37<=p65]]] & ~ [E [~ [p37<=p65] U [~ [p37<=p65] & ~ [p99<=p116]]]]]] U EG [[1<=p69 & p102<=1]]]]]]] & ~ [E [~ [[EX [p140<=p127] & E [~ [[~ [EG [~ [p37<=p65]]] & ~ [E [~ [p37<=p65] U [~ [p37<=p65] & ~ [p99<=p116]]]]]] U EG [[1<=p69 & p102<=1]]]]] U [~ [[EX [p140<=p127] & E [~ [[~ [EG [~ [p37<=p65]]] & ~ [E [~ [p37<=p65] U [~ [p37<=p65] & ~ [p99<=p116]]]]]] U EG [[1<=p69 & p102<=1]]]]] & ~ [p114<=p136]]]]]]

abstracting: (p114<=p136)
states: 2,997,659,849,206 (12)
abstracting: (p102<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p69)
states: 385,576,705,152 (11)
.................................................................................................................................
before gc: list nodes free: 2549872

after gc: idd nodes used:1555022, unused:62444978; list nodes free:290749031
..........................................................................................
EG iterations: 219
abstracting: (p99<=p116)
states: 3,130,510,936,549 (12)
abstracting: (p37<=p65)
states: 3,078,048,984,781 (12)
abstracting: (p37<=p65)
states: 3,078,048,984,781 (12)
abstracting: (p37<=p65)
states: 3,078,048,984,781 (12)
.............................................................................................
EG iterations: 93
abstracting: (p140<=p127)
states: 3,068,319,837,841 (12)
.abstracting: (p102<=1)
states: 3,407,669,456,341 (12)
abstracting: (1<=p69)
states: 385,576,705,152 (11)
....................................................
before gc: list nodes free: 3628554

after gc: idd nodes used:1292434, unused:62707566; list nodes free:291936714
...............................................................................MC time: 6m47.003sec

checking: A [EX [~ [p28<=0]] U EG [[p20<=p21 & [AX [p25<=p53] | 1<=p57]]]]
normalized: [~ [EG [~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]]]] & ~ [E [~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]] U [~ [EX [~ [p28<=0]]] & ~ [EG [[p20<=p21 & [1<=p57 | ~ [EX [~ [p25<=p53]]]]]]]]]]]

abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
..................
before gc: list nodes free: 1824264

after gc: idd nodes used:1108015, unused:62891985; list nodes free:292772969
...........................................................................
before gc: list nodes free: 1011564

after gc: idd nodes used:2248183, unused:61751817; list nodes free:287425457
...................................................
EG iterations: 144
abstracting: (p28<=0)
states: 2,271,852,076,135 (12)
.abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
...........................................................
before gc: list nodes free: 999103

after gc: idd nodes used:1660980, unused:62339020; list nodes free:290227959
.....................................................................................
EG iterations: 144
abstracting: (p25<=p53)
states: 2,380,469,989,927 (12)
.abstracting: (1<=p57)
states: 385,871,274,018 (11)
abstracting: (p20<=p21)
states: 2,952,842,724,445 (12)
........
before gc: list nodes free: 1472772

after gc: idd nodes used:1151529, unused:62848471; list nodes free:292541379
..................................................................................
before gc: list nodes free: 933517

after gc: idd nodes used:1562149, unused:62437851; list nodes free:290688661
......................................................
EG iterations: 144
..................................................................
before gc: list nodes free: 1265455

after gc: idd nodes used:1624494, unused:62375506; list nodes free:290316065
.............................................................................
EG iterations: 143
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 13m20.045sec

checking: ~ [[EX [[[[1<=p3 & AX [p123<=p56]] | [[EF [p132<=p3] | AF [p82<=p49]] & [AF [1<=p2] & EG [1<=p120]]]] & E [p140<=0 U [[p99<=p98 & p30<=1] | [1<=p137 | p92<=0]]]]] | AG [p86<=1]]]
normalized: ~ [[~ [E [true U ~ [p86<=1]]] | EX [[E [p140<=0 U [[1<=p137 | p92<=0] | [p99<=p98 & p30<=1]]] & [[[EG [1<=p120] & ~ [EG [~ [1<=p2]]]] & [~ [EG [~ [p82<=p49]]] | E [true U p132<=p3]]] | [1<=p3 & ~ [EX [~ [p123<=p56]]]]]]]]]

abstracting: (p123<=p56)
states: 3,066,629,502,532 (12)
.abstracting: (1<=p3)
states: 1,124,901,180,612 (12)
abstracting: (p132<=p3)
states: 3,407,669,065,195 (12)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393932 kB
MemFree: 6125168 kB
After kill :
MemTotal: 16393932 kB
MemFree: 16179588 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:22404 (168), effective:3106 (23)

initing FirstDep: 0m 0.000sec


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

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

iterations count:2241 (16), effective:212 (1)

iterations count:7697 (57), effective:1040 (7)

iterations count:1257 (9), effective:128 (0)

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

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

iterations count:3655 (27), effective:416 (3)

net_ddint.h:600: Timeout: after 349 sec


iterations count:3228 (24), effective:305 (2)

iterations count:15965 (120), effective:1835 (13)

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

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

iterations count:3065 (23), effective:302 (2)

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

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

iterations count:3065 (23), effective:302 (2)

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

iterations count:3065 (23), effective:302 (2)

iterations count:1662 (12), effective:147 (1)

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

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

ctl_mc.icc:221: Timeout: after 571 sec


iterations count:1816 (13), effective:186 (1)

iterations count:1049 (7), effective:96 (0)

iterations count:3758 (28), effective:375 (2)

iterations count:572 (4), effective:34 (0)

sat_reach.icc:155: Timeout: after 542 sec


iterations count:1655 (12), effective:185 (1)

iterations count:1056 (7), effective:107 (0)

net_ddint.h:600: Timeout: after 406 sec


iterations count:3655 (27), effective:416 (3)

iterations count:135 (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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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 r385-oct2-167903709800201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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