Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is DES-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026700057
=====================================================================

--------------------
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 DES-PT-05a-CTLCardinality-0
FORMULA_NAME DES-PT-05a-CTLCardinality-1
FORMULA_NAME DES-PT-05a-CTLCardinality-10
FORMULA_NAME DES-PT-05a-CTLCardinality-11
FORMULA_NAME DES-PT-05a-CTLCardinality-12
FORMULA_NAME DES-PT-05a-CTLCardinality-13
FORMULA_NAME DES-PT-05a-CTLCardinality-14
FORMULA_NAME DES-PT-05a-CTLCardinality-15
FORMULA_NAME DES-PT-05a-CTLCardinality-2
FORMULA_NAME DES-PT-05a-CTLCardinality-3
FORMULA_NAME DES-PT-05a-CTLCardinality-4
FORMULA_NAME DES-PT-05a-CTLCardinality-5
FORMULA_NAME DES-PT-05a-CTLCardinality-6
FORMULA_NAME DES-PT-05a-CTLCardinality-7
FORMULA_NAME DES-PT-05a-CTLCardinality-8
FORMULA_NAME DES-PT-05a-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464810768707


Marcie rev. 8535M (built: crohr on 2016-04-27)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: DES_PT_05a
(NrP: 135 NrTr: 92 NrArc: 457)

net check time: 0m 0.000sec

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

init dd package: 0m 3.670sec


RS generation: 0m 6.490sec


-> reachability set: #nodes 76402 (7.6e+04) #states 230,998,451,325 (11)



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

checking: EG [~ [AX [1<=p63]]]
normalized: EG [EX [~ [1<=p63]]]

abstracting: (1<=p63) states: 83,460,226,458 (10)
........................
before gc: list nodes free: 818686

after gc: idd nodes used:860371, unused:63139629; list nodes free:306379087
....................
before gc: list nodes free: 1037939

after gc: idd nodes used:831842, unused:63168158; list nodes free:306503503
....................................
before gc: list nodes free: 2063290

after gc: idd nodes used:830508, unused:63169492; list nodes free:306177073
................................................................................
before gc: list nodes free: 7139729

after gc: idd nodes used:286394, unused:63713606; list nodes free:309041100
...............
EG iterations: 174
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 12m56.766sec

checking: ~ [AG [EF [2<=p127]]]
normalized: E [true U ~ [E [true U 2<=p127]]]

abstracting: (2<=p127) states: 0
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.725sec

checking: AF [~ [AX [p134<=p39]]]
normalized: ~ [EG [~ [EX [~ [p134<=p39]]]]]

abstracting: (p134<=p39) states: 189,318,509,268 (11)
................................
before gc: list nodes free: 2957607

after gc: idd nodes used:893377, unused:63106623; list nodes free:305875281
....................................................................................................
EG iterations: 131
-> the formula is FALSE

FORMULA DES-PT-05a-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m20.203sec

checking: ~ [AG [AX [p91<=p51]]]
normalized: E [true U EX [~ [p91<=p51]]]

abstracting: (p91<=p51) states: 184,152,450,683 (11)
.-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.822sec

checking: ~ [E [p128<=p23 U [1<=p98 | 3<=p133]]]
normalized: ~ [E [p128<=p23 U [1<=p98 | 3<=p133]]]

abstracting: (3<=p133) states: 0
abstracting: (1<=p98) states: 76,339,686,627 (10)
abstracting: (p128<=p23) states: 202,553,921,821 (11)
-> the formula is FALSE

FORMULA DES-PT-05a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.791sec

checking: [EX [AG [1<=p90]] | A [~ [p76<=p66] U [2<=p77 & 1<=p63]]]
normalized: [[~ [EG [~ [[2<=p77 & 1<=p63]]]] & ~ [E [~ [[2<=p77 & 1<=p63]] U [p76<=p66 & ~ [[2<=p77 & 1<=p63]]]]]] | EX [~ [E [true U ~ [1<=p90]]]]]

abstracting: (1<=p90) states: 147,538,224,866 (11)
.abstracting: (1<=p63) states: 83,460,226,458 (10)
abstracting: (2<=p77) states: 0
abstracting: (p76<=p66) states: 179,343,962,437 (11)
abstracting: (1<=p63) states: 83,460,226,458 (10)
abstracting: (2<=p77) states: 0
abstracting: (1<=p63) states: 83,460,226,458 (10)
abstracting: (2<=p77) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-05a-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.254sec

checking: AG [~ [[[1<=p69 | 2<=p60] & [p52<=p6 & p59<=p46]]]]
normalized: ~ [E [true U [[1<=p69 | 2<=p60] & [p52<=p6 & p59<=p46]]]]

abstracting: (p59<=p46) states: 165,125,823,969 (11)
abstracting: (p52<=p6) states: 76,309,486,650 (10)
abstracting: (2<=p60) states: 0
abstracting: (1<=p69) states: 83,460,226,458 (10)
-> the formula is FALSE

FORMULA DES-PT-05a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.845sec

checking: [~ [[AX [1<=p106] & [~ [2<=p63] | [2<=p47 | 3<=p8]]]] & EG [[~ [3<=p55] | 2<=p133]]]
normalized: [EG [[2<=p133 | ~ [3<=p55]]] & ~ [[[[2<=p47 | 3<=p8] | ~ [2<=p63]] & ~ [EX [~ [1<=p106]]]]]]

abstracting: (1<=p106) states: 76,339,686,627 (10)

before gc: list nodes free: 6228303

after gc: idd nodes used:149884, unused:63850116; list nodes free:309697900
.abstracting: (2<=p63) states: 0
abstracting: (3<=p8) states: 0
abstracting: (2<=p47) states: 0
abstracting: (3<=p55) states: 0
abstracting: (2<=p133) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.367sec

checking: [EX [EG [p26<=p51]] | [EG [[p96<=p84 | 3<=p92]] & ~ [2<=p104]]]
normalized: [EX [EG [p26<=p51]] | [EG [[p96<=p84 | 3<=p92]] & ~ [2<=p104]]]

abstracting: (2<=p104) states: 0
abstracting: (3<=p92) states: 0
abstracting: (p96<=p84) states: 202,754,423,058 (11)
.
EG iterations: 1
abstracting: (p26<=p51) states: 188,328,626,103 (11)
.............................................................................................
EG iterations: 93
.-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 5.398sec

checking: AG [[[[1<=p17 | 1<=p20] | [3<=p133 | p78<=p61]] | ~ [2<=p23]]]
normalized: ~ [E [true U ~ [[~ [2<=p23] | [[3<=p133 | p78<=p61] | [1<=p17 | 1<=p20]]]]]]

abstracting: (1<=p20) states: 40,726,860,852 (10)
abstracting: (1<=p17) states: 39,865,629,700 (10)
abstracting: (p78<=p61) states: 135,114,715,347 (11)
abstracting: (3<=p133) states: 0
abstracting: (2<=p23) states: 0
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.328sec

checking: [EF [~ [[p69<=p120 | 1<=p34]]] | ~ [[p66<=p50 | EF [p78<=p119]]]]
normalized: [E [true U ~ [[p69<=p120 | 1<=p34]]] | ~ [[p66<=p50 | E [true U p78<=p119]]]]

abstracting: (p78<=p119) states: 113,905,793,344 (11)
abstracting: (p66<=p50) states: 166,280,978,135 (11)
abstracting: (1<=p34) states: 94,209,199,892 (10)
abstracting: (p69<=p120) states: 156,996,015,852 (11)
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.538sec

checking: [[[[p69<=p61 | 2<=p54] & 2<=p3] | EF [2<=p83]] | ~ [A [p12<=p78 U 3<=p120]]]
normalized: [~ [[~ [EG [~ [3<=p120]]] & ~ [E [~ [3<=p120] U [~ [p12<=p78] & ~ [3<=p120]]]]]] | [E [true U 2<=p83] | [2<=p3 & [p69<=p61 | 2<=p54]]]]

abstracting: (2<=p54) states: 0
abstracting: (p69<=p61) states: 179,343,962,437 (11)
abstracting: (2<=p3) states: 0
abstracting: (2<=p83) states: 0
abstracting: (3<=p120) states: 0
abstracting: (p12<=p78) states: 210,534,901,673 (11)
abstracting: (3<=p120) states: 0
abstracting: (3<=p120) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.986sec

checking: [[EG [[p128<=p35 | p26<=p60]] | 1<=p69] & [~ [3<=p21] | [EX [2<=p58] & EG [1<=p90]]]]
normalized: [[~ [3<=p21] | [EG [1<=p90] & EX [2<=p58]]] & [1<=p69 | EG [[p128<=p35 | p26<=p60]]]]

abstracting: (p26<=p60) states: 203,573,699,641 (11)
abstracting: (p128<=p35) states: 190,719,098,627 (11)
...........................
EG iterations: 27
abstracting: (1<=p69) states: 83,460,226,458 (10)
abstracting: (2<=p58) states: 0
.abstracting: (1<=p90) states: 147,538,224,866 (11)
.....
before gc: list nodes free: 6787056

after gc: idd nodes used:420754, unused:63579246; list nodes free:308445195
................
before gc: list nodes free: 1671504

after gc: idd nodes used:793812, unused:63206188; list nodes free:306741672
..........
before gc: list nodes free: 2815344

after gc: idd nodes used:2130759, unused:61869241; list nodes free:299699082
..................
before gc: list nodes free: 1735970

after gc: idd nodes used:912696, unused:63087304; list nodes free:306151944
.................................................................
EG iterations: 114
abstracting: (3<=p21) states: 0
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 18m30.347sec

checking: [[[AX [3<=p75] & [~ [1<=p125] | [p9<=p48 | p53<=p90]]] & EX [p0<=p32]] | EX [AF [2<=p76]]]
normalized: [EX [~ [EG [~ [2<=p76]]]] | [EX [p0<=p32] & [[[p9<=p48 | p53<=p90] | ~ [1<=p125]] & ~ [EX [~ [3<=p75]]]]]]

abstracting: (3<=p75) states: 0
.abstracting: (1<=p125) states: 37,344,743,829 (10)
abstracting: (p53<=p90) states: 204,338,662,371 (11)
abstracting: (p9<=p48) states: 224,091,388,541 (11)
abstracting: (p0<=p32) states: 230,998,451,324 (11)
.abstracting: (2<=p76) states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA DES-PT-05a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.070sec

checking: EG [[[3<=p35 & [1<=p56 & p75<=p133]] | [[p106<=p48 & p2<=p80] | [3<=p28 & 1<=p7]]]]
normalized: EG [[[[p106<=p48 & p2<=p80] | [3<=p28 & 1<=p7]] | [3<=p35 & [1<=p56 & p75<=p133]]]]

abstracting: (p75<=p133) states: 197,650,339,239 (11)
abstracting: (1<=p56) states: 217,591,009,693 (11)
abstracting: (3<=p35) states: 0
abstracting: (1<=p7) states: 76,009,808,907 (10)
abstracting: (3<=p28) states: 0
abstracting: (p2<=p80) states: 222,597,768,333 (11)
abstracting: (p106<=p48) states: 194,163,462,051 (11)
......
before gc: list nodes free: 3254814

after gc: idd nodes used:407675, unused:63592325; list nodes free:308516359
....................................................
before gc: list nodes free: 2141336

after gc: idd nodes used:585301, unused:63414699; list nodes free:307484839
................................
EG iterations: 90
-> the formula is TRUE

FORMULA DES-PT-05a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m26.060sec

checking: [[[~ [[1<=p85 | 2<=p47]] | [[p25<=p0 & p28<=p95] & [p56<=p28 | p83<=p114]]] & E [1<=p65 U p19<=p4]] & [[3<=p114 | [~ [3<=p15] & [3<=p64 & 3<=p132]]] | AF [~ [p61<=p118]]]]
normalized: [[~ [EG [p61<=p118]] | [3<=p114 | [[3<=p64 & 3<=p132] & ~ [3<=p15]]]] & [E [1<=p65 U p19<=p4] & [[[p56<=p28 | p83<=p114] & [p25<=p0 & p28<=p95]] | ~ [[1<=p85 | 2<=p47]]]]]

abstracting: (2<=p47) states: 0
abstracting: (1<=p85) states: 83,460,226,458 (10)
abstracting: (p28<=p95) states: 205,073,662,182 (11)
abstracting: (p25<=p0) states: 154,991,140,035 (11)
abstracting: (p83<=p114) states: 156,642,264,278 (11)
abstracting: (p56<=p28) states: 77,112,941,760 (10)
abstracting: (p19<=p4) states: 187,153,420,910 (11)
abstracting: (1<=p65) states: 83,460,226,458 (10)

BK_TIME_CONFINEMENT_REACHED

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

check for maximal unmarked siphon
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.001sec

9367 10176 10342 10341 10477 10580 12050 17321 22587 27525 32103 31365 33028 52954 57468 61261 60093 61633 64117 64736 70137 68711 69866 71154 72202 75576 74700 75306 75794
iterations count:29402 (319), effective:3633 (39)

initing FirstDep: 0m 0.000sec


iterations count:92 (1), effective:0 (0)
117462 123628 139572 128816 109460 109680 136194 153806 149780
iterations count:9759 (106), effective:1188 (12)
71265 74264 85804 97464 95678
iterations count:5035 (54), effective:596 (6)
75110 80232 85986 103831
iterations count:4837 (52), effective:558 (6)

iterations count:512 (5), effective:48 (0)
49436 53916 56923 92816 93705 100168 100707 98978
iterations count:8217 (89), effective:897 (9)
83460 88670 98568
iterations count:3125 (33), effective:270 (2)
78369 82130 96839
iterations count:3362 (36), effective:286 (3)
63120 63192 85030 86909 91794 96544 97801 114055 131673 132853 130052 128247 120173
iterations count:13249 (144), effective:1614 (17)

iterations count:847 (9), effective:41 (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="DES-PT-05a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05a.tgz
mv DES-PT-05a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is DES-PT-05a, 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 r221su-smll-146468026700057"
echo "====================================================================="
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
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 ;