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-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951600273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823172504

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_07a
(NrP: 229 NrTr: 1597 NrArc: 6125)

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

net check time: 0m 0.001sec

init dd package: 0m 1.404sec


RS generation: 0m11.091sec


-> reachability set: #nodes 103406 (1.0e+05) #states 240,100,000,001 (11)



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

checking: ~ [AG [EF [3<=p138]]]
normalized: E [true U ~ [E [true U 3<=p138]]]

abstracting: (3<=p138)
states: 0
-> the formula is TRUE

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

MC time: 0m14.396sec

checking: E [EX [1<=p207] U EX [3<=p81]]
normalized: E [EX [1<=p207] U EX [3<=p81]]

abstracting: (3<=p81)
states: 0
.abstracting: (1<=p207)
states: 240,100,000,000 (11)

after gc: zbdd nodes used:646705, unused:18103295.-> the formula is FALSE

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

MC time: 0m28.567sec

checking: EF [[3<=p73 | AG [1<=p215]]]
normalized: E [true U [3<=p73 | ~ [E [true U ~ [1<=p215]]]]]

abstracting: (1<=p215)
states: 240,100,000,000 (11)
abstracting: (3<=p73)
states: 0
-> the formula is TRUE

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

MC time: 0m 8.884sec

checking: AG [EF [p111<=p216]]
normalized: ~ [E [true U ~ [E [true U p111<=p216]]]]

abstracting: (p111<=p216)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [AF [1<=p70] U EF [2<=p71]]
normalized: E [~ [EG [~ [1<=p70]]] U E [true U 2<=p71]]

abstracting: (2<=p71)
states: 0
abstracting: (1<=p70)
states: 24,010,000,000 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.523sec

checking: ~ [EG [AG [p47<=p168]]]
normalized: ~ [EG [~ [E [true U ~ [p47<=p168]]]]]

abstracting: (p47<=p168)
states: 240,100,000,001 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: EG [~ [AG [p40<=p173]]]
normalized: EG [E [true U ~ [p40<=p173]]]

abstracting: (p40<=p173)
states: 240,100,000,001 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [~ [[~ [3<=p139] | ~ [p61<=p81]]]]
normalized: E [true U ~ [[~ [p61<=p81] | ~ [3<=p139]]]]

abstracting: (3<=p139)
states: 0
abstracting: (p61<=p81)
states: 218,491,000,001 (11)
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [A [p163<=p40 U 3<=p130]]
normalized: E [true U [~ [E [~ [3<=p130] U [~ [p163<=p40] & ~ [3<=p130]]]] & ~ [EG [~ [3<=p130]]]]]

abstracting: (3<=p130)
states: 0

EG iterations: 0
abstracting: (3<=p130)
states: 0
abstracting: (p163<=p40)
states: 24,010,000,001 (10)
abstracting: (3<=p130)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-07a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.133sec

checking: E [EF [p136<=p186] U AG [3<=p91]]
normalized: E [E [true U p136<=p186] U ~ [E [true U ~ [3<=p91]]]]

abstracting: (3<=p91)
states: 0
abstracting: (p136<=p186)
states: 240,100,000,001 (11)
-> the formula is FALSE

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

MC time: 0m 0.056sec

checking: AG [[p140<=p151 | ~ [~ [p143<=p178]]]]
normalized: ~ [E [true U ~ [[p140<=p151 | p143<=p178]]]]

abstracting: (p143<=p178)
states: 240,100,000,001 (11)
abstracting: (p140<=p151)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [[AX [1<=p47] & [p5<=p212 | p106<=p152]]]
normalized: E [true U [~ [EX [~ [1<=p47]]] & [p5<=p212 | p106<=p152]]]

abstracting: (p106<=p152)
states: 240,100,000,001 (11)
abstracting: (p5<=p212)
states: 240,100,000,001 (11)
abstracting: (1<=p47)
states: 24,010,000,000 (10)

after gc: zbdd nodes used:251029, unused:37248971.-> the formula is FALSE

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

MC time: 0m26.578sec

checking: AG [[[p189<=p133 | [1<=p58 & p137<=p141]] & EG [p140<=p159]]]
normalized: ~ [E [true U ~ [[EG [p140<=p159] & [p189<=p133 | [1<=p58 & p137<=p141]]]]]]

abstracting: (p137<=p141)
states: 240,100,000,001 (11)
abstracting: (1<=p58)
states: 24,010,000,000 (10)
abstracting: (p189<=p133)
states: 240,100,000,001 (11)
abstracting: (p140<=p159)
states: 240,100,000,001 (11)

EG iterations: 0
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AG [[[~ [p83<=p59] | p185<=p139] | [2<=p65 | [p57<=p194 | 2<=p138]]]]
normalized: ~ [E [true U ~ [[[2<=p65 | [p57<=p194 | 2<=p138]] | [p185<=p139 | ~ [p83<=p59]]]]]]

abstracting: (p83<=p59)
states: 218,491,000,001 (11)
abstracting: (p185<=p139)
states: 240,100,000,001 (11)
abstracting: (2<=p138)
states: 0
abstracting: (p57<=p194)
states: 240,100,000,001 (11)
abstracting: (2<=p65)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-07a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AF [[[~ [p191<=p219] & [p221<=p102 | p114<=p131]] | AG [p89<=p201]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [p89<=p201]]] | [[p221<=p102 | p114<=p131] & ~ [p191<=p219]]]]]]

abstracting: (p191<=p219)
states: 240,100,000,001 (11)
abstracting: (p114<=p131)
states: 240,100,000,001 (11)
abstracting: (p221<=p102)
states: 24,010,000,001 (10)
abstracting: (p89<=p201)
states: 240,100,000,001 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.011sec

checking: [[AG [[p36<=p36 | p136<=p71]] & EX [[p105<=p54 & p54<=p130]]] | 1<=p189]
normalized: [1<=p189 | [EX [[p105<=p54 & p54<=p130]] & ~ [E [true U ~ [[p36<=p36 | p136<=p71]]]]]]

abstracting: (p136<=p71)
states: 24,010,000,001 (10)
abstracting: (p36<=p36)
states: 240,100,000,001 (11)
abstracting: (p54<=p130)
states: 240,100,000,001 (11)
abstracting: (p105<=p54)
states: 218,491,000,001 (11)
.abstracting: (1<=p189)
states: 240,100,000,000 (11)
-> the formula is TRUE

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

MC time: 0m22.709sec

totally nodes used: 45119888(4.5e+07)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 36087343 164573558 200660901
used/not used/entry size/cache size: 33749277 33359587 16 1024MB
basic ops cache: hits/miss/sum: 43751596 292351987 336103583
used/not used/entry size/cache size: 16752013 25203 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: 80196 342714 422910
used/not used/entry size/cache size: 104188 1992964 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 51362027
1 13775889
2 1806764
3 154070
4 9596
5 498
6 19
7 1
8 0
9 0
>= 10 0

Total processing time: 2m28.173sec


BK_STOP 1495823320709

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


iterations count:52246 (32), effective:97 (0)

initing FirstDep: 0m 0.017sec


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

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

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

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

iterations count:3176 (1), effective:2 (0)

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

iterations count:1597 (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-07a"
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-07a.tgz
mv DLCround-PT-07a 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-07a, 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-149580951600273"
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 ;