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-3254
Executing tool marcie
Input is DLCround-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951400201
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495822018737

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6

parse successfull
net created successfully

Net: DLCround_PT_03a
(NrP: 113 NrTr: 617 NrArc: 2269)

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

net check time: 0m 0.000sec

init dd package: 0m 1.388sec


RS generation: 0m 0.181sec


-> reachability set: #nodes 2683 (2.7e+03) #states 24,010,001 (7)



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

checking: [AF [EF [2<=p89]] | 2<=p80]
normalized: [2<=p80 | ~ [EG [~ [E [true U 2<=p89]]]]]

abstracting: (2<=p89)
states: 0

EG iterations: 0
abstracting: (2<=p80)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [p39<=p91]
normalized: ~ [E [true U ~ [p39<=p91]]]

abstracting: (p39<=p91)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p64<=p32]
normalized: ~ [E [true U ~ [p64<=p32]]]

abstracting: (p64<=p32)
states: 21,849,101 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

checking: AG [~ [AG [p77<=p4]]]
normalized: ~ [E [true U ~ [E [true U ~ [p77<=p4]]]]]

abstracting: (p77<=p4)
states: 3,430,001 (6)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: E [~ [p96<=p11] U EF [2<=p54]]
normalized: E [~ [p96<=p11] U E [true U 2<=p54]]

abstracting: (2<=p54)
states: 0
abstracting: (p96<=p11)
states: 3,430,001 (6)
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [AG [[p103<=p106 & 1<=p75]]]
normalized: ~ [EX [E [true U ~ [[p103<=p106 & 1<=p75]]]]]

abstracting: (1<=p75)
states: 24,010,000 (7)
abstracting: (p103<=p106)
states: 24,010,001 (7)
.-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [E [2<=p32 U p88<=p96]]
normalized: ~ [E [true U ~ [E [2<=p32 U p88<=p96]]]]

abstracting: (p88<=p96)
states: 24,010,001 (7)
abstracting: (2<=p32)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AF [[AG [p105<=p112] | AG [p44<=p36]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [p44<=p36]]] | ~ [E [true U ~ [p105<=p112]]]]]]]

abstracting: (p105<=p112)
states: 24,010,001 (7)
abstracting: (p44<=p36)
states: 21,849,101 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: EF [[[~ [3<=p37] & ~ [p24<=p52]] & EX [1<=p32]]]
normalized: E [true U [[~ [p24<=p52] & ~ [3<=p37]] & EX [1<=p32]]]

abstracting: (1<=p32)
states: 2,401,000 (6)
.abstracting: (3<=p37)
states: 0
abstracting: (p24<=p52)
states: 20,923,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

checking: AG [[EG [p62<=p70] & p6<=p109]]
normalized: ~ [E [true U ~ [[p6<=p109 & EG [p62<=p70]]]]]

abstracting: (p62<=p70)
states: 24,010,001 (7)

EG iterations: 0
abstracting: (p6<=p109)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EF [[~ [p62<=p65] & [3<=p25 | 2<=p78]]] & [EG [~ [1<=p79]] | EF [1<=p45]]]
normalized: [E [true U [[3<=p25 | 2<=p78] & ~ [p62<=p65]]] & [EG [~ [1<=p79]] | E [true U 1<=p45]]]

abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (1<=p79)
states: 24,010,000 (7)
..
EG iterations: 2
abstracting: (p62<=p65)
states: 21,609,001 (7)
abstracting: (2<=p78)
states: 0
abstracting: (3<=p25)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AG [[[[3<=p29 & 1<=p52] | p92<=p45] | EF [p93<=p1]]]
normalized: ~ [E [true U ~ [[[p92<=p45 | [3<=p29 & 1<=p52]] | E [true U p93<=p1]]]]]

abstracting: (p93<=p1)
states: 3,430,001 (6)
abstracting: (1<=p52)
states: 2,401,000 (6)
abstracting: (3<=p29)
states: 0
abstracting: (p92<=p45)
states: 2,401,001 (6)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[[3<=p97 & ~ [1<=p24]] & ~ [[p22<=p84 | p100<=p94]]]]
normalized: E [true U [~ [[p22<=p84 | p100<=p94]] & [~ [1<=p24] & 3<=p97]]]

abstracting: (3<=p97)
states: 0
abstracting: (1<=p24)
states: 3,430,000 (6)
abstracting: (p100<=p94)
states: 24,010,001 (7)
abstracting: (p22<=p84)
states: 24,010,001 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[~ [EX [1<=p111]] | AG [[p87<=p52 & p32<=p79]]] | EF [3<=p58]]
normalized: [E [true U 3<=p58] | [~ [E [true U ~ [[p87<=p52 & p32<=p79]]]] | ~ [EX [1<=p111]]]]

abstracting: (1<=p111)
states: 24,010,000 (7)
.abstracting: (p32<=p79)
states: 24,010,001 (7)
abstracting: (p87<=p52)
states: 2,401,001 (6)
abstracting: (3<=p58)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [[[[p36<=p78 | p86<=p71] | [p15<=p56 & 2<=p8]] & AG [p66<=p101]]]
normalized: EG [[[[p15<=p56 & 2<=p8] | [p36<=p78 | p86<=p71]] & ~ [E [true U ~ [p66<=p101]]]]]

abstracting: (p66<=p101)
states: 24,010,001 (7)
abstracting: (p86<=p71)
states: 24,010,001 (7)
abstracting: (p36<=p78)
states: 24,010,001 (7)
abstracting: (2<=p8)
states: 0
abstracting: (p15<=p56)
states: 20,923,001 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [[E [3<=p22 U p61<=p12] & E [p98<=p75 U 3<=p83]] | [2<=p107 & [~ [~ [1<=p74]] | AG [p103<=p91]]]]
normalized: [[E [3<=p22 U p61<=p12] & E [p98<=p75 U 3<=p83]] | [[1<=p74 | ~ [E [true U ~ [p103<=p91]]]] & 2<=p107]]

abstracting: (2<=p107)
states: 0
abstracting: (p103<=p91)
states: 24,010,001 (7)
abstracting: (1<=p74)
states: 24,010,000 (7)
abstracting: (3<=p83)
states: 0
abstracting: (p98<=p75)
states: 24,010,001 (7)
abstracting: (p61<=p12)
states: 21,952,001 (7)
abstracting: (3<=p22)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

totally nodes used: 834201(8.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 804177 2598890 3403067
used/not used/entry size/cache size: 2458782 64650082 16 1024MB
basic ops cache: hits/miss/sum: 464441 1507446 1971887
used/not used/entry size/cache size: 2613221 14163995 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 4287 11877 16164
used/not used/entry size/cache size: 11864 2085288 32 64MB
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 66277713
1 828106
2 3040
3 5
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.460sec


BK_STOP 1495822022225

--------------------
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.002sec


iterations count:10958 (17), effective:61 (0)

initing FirstDep: 0m 0.008sec


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

iterations count:1236 (2), effective:2 (0)

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

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

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

iterations count:2555 (4), effective:16 (0)

iterations count:1884 (3), effective:10 (0)

iterations count:709 (1), effective:6 (0)

iterations count:1255 (2), effective:2 (0)

iterations count:617 (1), effective:0 (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="DLCround-PT-03a"
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"

# 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/DLCround-PT-03a.tgz
mv DLCround-PT-03a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is DLCround-PT-03a, 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 r171-csrt-149580951400201"
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 ;