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

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

=== Now, execution of the tool begins

BK_START 1496737771368

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_0003
(NrP: 16 NrTr: 25 NrArc: 71)

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

net check time: 0m 0.000sec

init dd package: 0m 0.994sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0003
(NrP: 16 NrTr: 25 NrArc: 71)

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

net check time: 0m 0.000sec

init dd package: 0m 3.292sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 55 (5.5e+01) #states 35,937 (4)



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

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

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

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [~ [~ [~ [p1<=p1]]]]
normalized: E [true U ~ [p1<=p1]]

abstracting: (p1<=p1)
states: 35,937 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p14<=p14)
states: 35,937 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p15<=p15)
states: 35,937 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p2<=p)
states: 25,047 (4)
abstracting: (2<=p2)
states: 10,890 (4)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[3<=p15 | 3<=p2]] & [1<=p8 & 2<=p15]]]
normalized: E [true U [~ [[3<=p15 | 3<=p2]] & [1<=p8 & 2<=p15]]]

abstracting: (2<=p15)
states: 3,267 (3)
abstracting: (1<=p8)
states: 20,691 (4)
abstracting: (3<=p2)
states: 4,356 (3)
abstracting: (3<=p15)
states: 3,267 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[~ [[3<=p13 & 3<=p1]] & [3<=p & [3<=p8 | 3<=p11]]]]
normalized: E [true U [~ [[3<=p13 & 3<=p1]] & [3<=p & [3<=p8 | 3<=p11]]]]

abstracting: (3<=p11)
states: 13,068 (4)
abstracting: (3<=p8)
states: 3,267 (3)
abstracting: (3<=p)
states: 0
abstracting: (3<=p1)
states: 13,068 (4)
abstracting: (3<=p13)
states: 3,267 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[p8<=p8 | ~ [[3<=p3 | p15<=p12]]]]
normalized: ~ [E [true U ~ [[p8<=p8 | ~ [[3<=p3 | p15<=p12]]]]]]

abstracting: (p15<=p12)
states: 28,314 (4)
abstracting: (3<=p3)
states: 3,267 (3)
abstracting: (p8<=p8)
states: 35,937 (4)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[~ [~ [p11<=p1]] & [~ [p8<=p14] & 3<=p14]]]
normalized: E [true U [[~ [p8<=p14] & 3<=p14] & p11<=p1]]

abstracting: (p11<=p1)
states: 21,417 (4)
abstracting: (3<=p14)
states: 13,068 (4)
abstracting: (p8<=p14)
states: 24,585 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[p14<=p12 & ~ [p14<=p11]] & 3<=p1]]
normalized: E [true U [3<=p1 & [p14<=p12 & ~ [p14<=p11]]]]

abstracting: (p14<=p11)
states: 22,869 (4)
abstracting: (p14<=p12)
states: 21,780 (4)
abstracting: (3<=p1)
states: 13,068 (4)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [p10<=p3] | [p4<=p | 3<=p11]] & 2<=p]]
normalized: E [true U [[[p4<=p | 3<=p11] | ~ [p10<=p3]] & 2<=p]]

abstracting: (2<=p)
states: 0
abstracting: (p10<=p3)
states: 28,974 (4)
abstracting: (3<=p11)
states: 13,068 (4)
abstracting: (p4<=p)
states: 22,869 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[2<=p5 & [[p12<=p10 & p7<=p8] & p8<=p15]]]
normalized: E [true U [[[p12<=p10 & p7<=p8] & p8<=p15] & 2<=p5]]

abstracting: (2<=p5)
states: 3,267 (3)
abstracting: (p8<=p15)
states: 20,031 (4)
abstracting: (p7<=p8)
states: 20,691 (4)
abstracting: (p12<=p10)
states: 18,051 (4)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[~ [[2<=p6 & p10<=p4]] & [[p5<=p8 & p12<=p3] & [3<=p5 & 2<=p4]]]]
normalized: E [true U [[[3<=p5 & 2<=p4] & [p5<=p8 & p12<=p3]] & ~ [[2<=p6 & p10<=p4]]]]

abstracting: (p10<=p4)
states: 28,446 (4)
abstracting: (2<=p6)
states: 21,780 (4)
abstracting: (p12<=p3)
states: 21,846 (4)
abstracting: (p5<=p8)
states: 28,974 (4)
abstracting: (2<=p4)
states: 13,068 (4)
abstracting: (3<=p5)
states: 3,267 (3)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0003-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[1<=p5 | 1<=p] | p1<=p14] | [p2<=p6 | [p3<=p1 | p12<=p15]]]]
normalized: ~ [E [true U ~ [[[[p3<=p1 | p12<=p15] | p2<=p6] | [[1<=p5 | 1<=p] | p1<=p14]]]]]

abstracting: (p1<=p14)
states: 17,457 (4)
abstracting: (1<=p)
states: 35,937 (4)
abstracting: (1<=p5)
states: 11,979 (4)
abstracting: (p2<=p6)
states: 27,489 (4)
abstracting: (p12<=p15)
states: 17,424 (4)
abstracting: (p3<=p1)
states: 28,314 (4)
-> the formula is TRUE

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

MC time: 0m 0.000sec

totally nodes used: 5884 (5.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5507 6879 12386
used/not used/entry size/cache size: 10226 67098638 16 1024MB
basic ops cache: hits/miss/sum: 6038 6670 12708
used/not used/entry size/cache size: 13980 16763236 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: 1317 1132 2449
used/not used/entry size/cache size: 1132 8387476 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 67103445
1 5289
2 55
3 16
4 7
5 11
6 18
7 3
8 3
9 4
>= 10 13

Total processing time: 0m 5.798sec


BK_STOP 1496737777297

--------------------
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:116 (4), effective:36 (1)

initing FirstDep: 0m 0.000sec


iterations count:88 (3), effective:20 (0)

iterations count:158 (6), effective:52 (2)

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-0003"
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-0003.tgz
mv JoinFreeModules-PT-0003 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-0003, 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-149581061600007"
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 ;