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 JoinFreeModules-PT-0004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r191-blw7-149581061600016
=====================================================================

--------------------
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 JoinFreeModules-PT-0004-ReachabilityCardinality-0
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-1
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-15
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-2
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-3
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-4
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-5
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-6
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-7
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-8
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496737783300

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: JoinFreeModules_PT_0004
(NrP: 21 NrTr: 33 NrArc: 94)

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

net check time: 0m 0.000sec

init dd package: 0m 0.998sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0004
(NrP: 21 NrTr: 33 NrArc: 94)

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

net check time: 0m 0.000sec

init dd package: 0m 3.348sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 217 (2.2e+02) #states 14,776,336 (7)



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

checking: EF [2<=p]
normalized: E [true U 2<=p]

abstracting: (2<=p)
states: 0
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[3<=p4 | 2<=p1]]
normalized: ~ [E [true U ~ [[3<=p4 | 2<=p1]]]]

abstracting: (2<=p1)
states: 8,818,136 (6)
abstracting: (3<=p4)
states: 5,481,544 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[3<=p4 & [1<=p9 & p4<=p11]]]]
normalized: ~ [E [true U [3<=p4 & [1<=p9 & p4<=p11]]]]

abstracting: (p4<=p11)
states: 9,809,888 (6)
abstracting: (1<=p9)
states: 8,818,136 (6)
abstracting: (3<=p4)
states: 5,481,544 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [~ [~ [[p9<=p9 | p15<=p18]]]]
normalized: ~ [E [true U ~ [[p9<=p9 | p15<=p18]]]]

abstracting: (p15<=p18)
states: 10,717,072 (7)
abstracting: (p9<=p9)
states: 14,776,336 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[1<=p13 | 1<=p11] | p7<=p10]]
normalized: ~ [E [true U ~ [[[1<=p13 | 1<=p11] | p7<=p10]]]]

abstracting: (p7<=p10)
states: 7,626,496 (6)
abstracting: (1<=p11)
states: 10,724,760 (7)
abstracting: (1<=p13)
states: 8,818,136 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[~ [[p5<=p16 | p10<=p8]] & 1<=p14]]
normalized: E [true U [~ [[p5<=p16 | p10<=p8]] & 1<=p14]]

abstracting: (1<=p14)
states: 8,818,136 (6)
abstracting: (p10<=p8)
states: 10,248,104 (7)
abstracting: (p5<=p16)
states: 11,601,192 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [[[~ [1<=p19] | [p4<=p11 | 2<=p17]] & 3<=p15]]
normalized: E [true U [[[p4<=p11 | 2<=p17] | ~ [1<=p19]] & 3<=p15]]

abstracting: (3<=p15)
states: 2,144,952 (6)
abstracting: (1<=p19)
states: 8,818,136 (6)
abstracting: (2<=p17)
states: 5,004,888 (6)
abstracting: (p4<=p11)
states: 9,809,888 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [~ [[p10<=p3 | [p1<=p14 | 2<=p11]]]]
normalized: E [true U ~ [[p10<=p3 | [p1<=p14 | 2<=p11]]]]

abstracting: (2<=p11)
states: 8,818,136 (6)
abstracting: (p1<=p14)
states: 7,884,044 (6)
abstracting: (p10<=p3)
states: 10,717,072 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [[3<=p4 & [[1<=p19 & 3<=p6] | p3<=p15]]]
normalized: E [true U [3<=p4 & [p3<=p15 | [1<=p19 & 3<=p6]]]]

abstracting: (3<=p6)
states: 5,481,544 (6)
abstracting: (1<=p19)
states: 8,818,136 (6)
abstracting: (p3<=p15)
states: 8,610,560 (6)
abstracting: (3<=p4)
states: 5,481,544 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[[2<=p18 | 3<=p1] & ~ [1<=p6]] | ~ [[1<=p18 & 3<=p9]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p18 & 3<=p9]] | [~ [1<=p6] & [2<=p18 | 3<=p1]]]]]]

abstracting: (3<=p1)
states: 5,481,544 (6)
abstracting: (2<=p18)
states: 4,528,232 (6)
abstracting: (1<=p6)
states: 10,724,760 (7)
abstracting: (3<=p9)
states: 5,481,544 (6)
abstracting: (1<=p18)
states: 8,818,136 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[~ [p15<=p15] & ~ [2<=p9]] & p6<=p6]]
normalized: E [true U [p6<=p6 & [~ [2<=p9] & ~ [p15<=p15]]]]

abstracting: (p15<=p15)
states: 14,776,336 (7)
abstracting: (2<=p9)
states: 6,434,856 (6)
abstracting: (p6<=p6)
states: 14,776,336 (7)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[3<=p7 | 3<=p20] | ~ [2<=p16]] | ~ [[p13<=p7 & 2<=p]]]]
normalized: ~ [E [true U ~ [[~ [[p13<=p7 & 2<=p]] | [~ [2<=p16] | [3<=p7 | 3<=p20]]]]]]

abstracting: (3<=p20)
states: 2,144,952 (6)
abstracting: (3<=p7)
states: 2,383,280 (6)
abstracting: (2<=p16)
states: 8,818,136 (6)
abstracting: (2<=p)
states: 0
abstracting: (p13<=p7)
states: 9,852,172 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=p3 & p5<=p17] & [~ [p10<=p18] & ~ [p12<=p16]]]]
normalized: E [true U [[~ [p12<=p16] & ~ [p10<=p18]] & [3<=p3 & p5<=p17]]]

abstracting: (p5<=p17)
states: 10,943,868 (7)
abstracting: (3<=p3)
states: 1,906,624 (6)
abstracting: (p10<=p18)
states: 10,717,072 (7)
abstracting: (p12<=p16)
states: 10,786,264 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [~ [[[p3<=p11 | p20<=p14] & [3<=p5 & p4<=p12]]]]
normalized: ~ [E [true U [[3<=p5 & p4<=p12] & [p3<=p11 | p20<=p14]]]]

abstracting: (p20<=p14)
states: 10,932,336 (7)
abstracting: (p3<=p11)
states: 11,216,792 (7)
abstracting: (p4<=p12)
states: 8,452,956 (6)
abstracting: (3<=p5)
states: 2,144,952 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[[p1<=p7 | p4<=p7] & [~ [1<=p] & [3<=p15 | p12<=p7]]]]
normalized: E [true U [[~ [1<=p] & [3<=p15 | p12<=p7]] & [p1<=p7 | p4<=p7]]]

abstracting: (p4<=p7)
states: 8,452,956 (6)
abstracting: (p1<=p7)
states: 6,942,264 (6)
abstracting: (p12<=p7)
states: 9,333,232 (6)
abstracting: (3<=p15)
states: 2,144,952 (6)
abstracting: (1<=p)
states: 14,776,336 (7)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[2<=p13 | 1<=p3] | [3<=p6 | p<=p3]] | [p<=p13 | p13<=p9]]]
normalized: ~ [E [true U ~ [[[p<=p13 | p13<=p9] | [[3<=p6 | p<=p3] | [2<=p13 | 1<=p3]]]]]]

abstracting: (1<=p3)
states: 8,818,136 (6)
abstracting: (2<=p13)
states: 4,528,232 (6)
abstracting: (p<=p3)
states: 8,818,136 (6)
abstracting: (3<=p6)
states: 5,481,544 (6)
abstracting: (p13<=p9)
states: 10,205,820 (7)
abstracting: (p<=p13)
states: 8,818,136 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 139130 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 225402 193524 418926
used/not used/entry size/cache size: 299439 66809425 16 1024MB
basic ops cache: hits/miss/sum: 161961 131333 293294
used/not used/entry size/cache size: 279351 16497865 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 9968 7067 17035
used/not used/entry size/cache size: 7067 8381541 32 256MB
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 66975906
1 129454
2 2628
3 396
4 176
5 87
6 31
7 89
8 14
9 10
>= 10 73

Total processing time: 0m 6.218sec


BK_STOP 1496737789601

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

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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:337 (10), effective:68 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:130 (3), effective:28 (0)

iterations count:113 (3), effective:26 (0)

iterations count:312 (9), effective:73 (2)

iterations count:237 (7), effective:52 (1)

iterations count:193 (5), effective:53 (1)

iterations count:51 (1), effective:8 (0)

iterations count:129 (3), effective:27 (0)

iterations count:401 (12), effective:88 (2)

iterations count:130 (3), effective:34 (1)

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="JoinFreeModules-PT-0004"
export BK_EXAMINATION="ReachabilityCardinality"
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/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 JoinFreeModules-PT-0004, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r191-blw7-149581061600016"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;