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-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026700039
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464800197979


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_02a
(NrP: 123 NrTr: 80 NrArc: 400)

net check time: 0m 0.000sec

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

init dd package: 0m 3.737sec


RS generation: 0m 4.679sec


-> reachability set: #nodes 46825 (4.7e+04) #states 4,953,223,116 (9)



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

checking: ~ [AF [AG [2<=p6]]]
normalized: EG [E [true U ~ [2<=p6]]]

abstracting: (2<=p6) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 1.757sec

checking: AG [p99<=p76]
normalized: ~ [E [true U ~ [p99<=p76]]]

abstracting: (p99<=p76) states: 4,943,777,740 (9)
-> the formula is FALSE

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

MC time: 0m 1.008sec

checking: [3<=p48 | AF [1<=p80]]
normalized: [3<=p48 | ~ [EG [~ [1<=p80]]]]

abstracting: (1<=p80) states: 1,598,167,746 (9)
.........................................................................
EG iterations: 73
abstracting: (3<=p48) states: 0
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.110sec

checking: EF [AG [~ [p13<=p62]]]
normalized: E [true U ~ [E [true U p13<=p62]]]

abstracting: (p13<=p62) states: 4,395,676,416 (9)
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.644sec

checking: EF [AG [p17<=p112]]
normalized: E [true U ~ [E [true U ~ [p17<=p112]]]]

abstracting: (p17<=p112) states: 1,341,429,134 (9)
-> the formula is TRUE

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

MC time: 0m11.450sec

checking: AF [~ [p4<=p0]]
normalized: ~ [EG [p4<=p0]]

abstracting: (p4<=p0) states: 4,446,003,589 (9)
............................
EG iterations: 28
-> the formula is TRUE

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

MC time: 0m 0.322sec

checking: [AF [EX [3<=p46]] | ~ [~ [~ [p115<=p2]]]]
normalized: [~ [EG [~ [EX [3<=p46]]]] | ~ [p115<=p2]]

abstracting: (p115<=p2) states: 4,168,082,765 (9)
abstracting: (3<=p46) states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [EF [[3<=p22 & p2<=p18]]]
normalized: ~ [EX [~ [E [true U [3<=p22 & p2<=p18]]]]]

abstracting: (p2<=p18) states: 4,117,586,116 (9)
abstracting: (3<=p22) states: 0
.-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: ~ [[AG [~ [p53<=p112]] | AF [[2<=p97 | 3<=p47]]]]
normalized: ~ [[~ [EG [~ [[2<=p97 | 3<=p47]]]] | ~ [E [true U p53<=p112]]]]

abstracting: (p53<=p112) states: 3,418,519,948 (9)
abstracting: (3<=p47) states: 0
abstracting: (2<=p97) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.467sec

checking: [EF [[3<=p111 & ~ [p95<=p16]]] | 3<=p96]
normalized: [3<=p96 | E [true U [3<=p111 & ~ [p95<=p16]]]]

abstracting: (p95<=p16) states: 2,372,240,749 (9)
abstracting: (3<=p111) states: 0
abstracting: (3<=p96) states: 0
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: ~ [AF [~ [[p40<=p84 | p41<=p9]]]]
normalized: EG [[p40<=p84 | p41<=p9]]

abstracting: (p41<=p9) states: 4,560,372,796 (9)
abstracting: (p40<=p84) states: 2,488,572,381 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-02a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

checking: [AG [~ [[p67<=p42 & 1<=p83]]] & AF [EG [3<=p10]]]
normalized: [~ [EG [~ [EG [3<=p10]]]] & ~ [E [true U [p67<=p42 & 1<=p83]]]]

abstracting: (1<=p83) states: 3,109,530,566 (9)
abstracting: (p67<=p42) states: 3,839,490,464 (9)
abstracting: (3<=p10) states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.148sec

checking: A [p48<=p78 U ~ [[p21<=p44 | 3<=p74]]]
normalized: [~ [EG [[p21<=p44 | 3<=p74]]] & ~ [E [[p21<=p44 | 3<=p74] U [~ [p48<=p78] & [p21<=p44 | 3<=p74]]]]]

abstracting: (3<=p74) states: 0
abstracting: (p21<=p44) states: 4,864,595,643 (9)
abstracting: (p48<=p78) states: 3,848,037,580 (9)
abstracting: (3<=p74) states: 0
abstracting: (p21<=p44) states: 4,864,595,643 (9)
abstracting: (3<=p74) states: 0
abstracting: (p21<=p44) states: 4,864,595,643 (9)
....................................................................................
EG iterations: 84
-> the formula is FALSE

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

MC time: 1m13.611sec

checking: [~ [~ [[[p73<=p73 | 2<=p100] | [3<=p106 & 3<=p61]]]] & ~ [EG [p75<=p56]]]
normalized: [[[3<=p106 & 3<=p61] | [p73<=p73 | 2<=p100]] & ~ [EG [p75<=p56]]]

abstracting: (p75<=p56) states: 4,340,790,490 (9)
.........................................................
EG iterations: 57
abstracting: (2<=p100) states: 0
abstracting: (p73<=p73) states: 4,953,223,116 (9)
abstracting: (3<=p61) states: 0
abstracting: (3<=p106) states: 0
-> the formula is FALSE

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

MC time: 0m15.085sec

checking: A [EF [p82<=p81] U [2<=p67 & [p40<=p68 | p104<=p72]]]
normalized: [~ [EG [~ [[2<=p67 & [p40<=p68 | p104<=p72]]]]] & ~ [E [~ [[2<=p67 & [p40<=p68 | p104<=p72]]] U [~ [[2<=p67 & [p40<=p68 | p104<=p72]]] & ~ [E [true U p82<=p81]]]]]]

abstracting: (p82<=p81) states: 4,400,523,018 (9)
abstracting: (p104<=p72) states: 4,381,725,426 (9)
abstracting: (p40<=p68) states: 3,679,147,830 (9)
abstracting: (2<=p67) states: 0
abstracting: (p104<=p72) states: 4,381,725,426 (9)
abstracting: (p40<=p68) states: 3,679,147,830 (9)
abstracting: (2<=p67) states: 0
abstracting: (p104<=p72) states: 4,381,725,426 (9)
abstracting: (p40<=p68) states: 3,679,147,830 (9)
abstracting: (2<=p67) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.737sec

checking: [AF [[[p82<=p61 | 1<=p52] & [1<=p36 | 3<=p80]]] & E [[2<=p40 | p112<=p16] U [3<=p80 & p26<=p96]]]
normalized: [~ [EG [~ [[[p82<=p61 | 1<=p52] & [1<=p36 | 3<=p80]]]]] & E [[2<=p40 | p112<=p16] U [3<=p80 & p26<=p96]]]

abstracting: (p26<=p96) states: 3,834,366,634 (9)
abstracting: (3<=p80) states: 0
abstracting: (p112<=p16) states: 4,445,305,107 (9)
abstracting: (2<=p40) states: 0
abstracting: (3<=p80) states: 0
abstracting: (1<=p36) states: 2,796,559,795 (9)
abstracting: (1<=p52) states: 3,235,604,953 (9)
abstracting: (p82<=p61) states: 3,907,755,468 (9)

before gc: list nodes free: 1437846

after gc: idd nodes used:148802, unused:63851198; list nodes free:292912319
...............................................................
EG iterations: 63
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.383sec


Total processing time: 3m12.414sec


BK_STOP 1464800390580

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

13038 22420 35546 46922
iterations count:4708 (58), effective:544 (6)

initing FirstDep: 0m 0.000sec


iterations count:80 (1), effective:0 (0)
32503
iterations count:1776 (22), effective:193 (2)

iterations count:195 (2), effective:17 (0)

iterations count:781 (9), effective:87 (1)
45925 91236 93421
iterations count:3419 (42), effective:400 (5)

iterations count:412 (5), effective:28 (0)
49530
iterations count:1528 (19), effective:184 (2)
76840 97730
iterations count:2117 (26), effective:241 (3)

iterations count:84 (1), effective:2 (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-02a"
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-02a.tgz
mv DES-PT-02a 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-02a, 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-146468026700039"
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 ;