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 S_HouseConstruction-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599200601
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494885329795

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: HouseConstruction_PT_002
(NrP: 26 NrTr: 18 NrArc: 51)

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

net check time: 0m 0.000sec

init dd package: 0m 1.167sec

parse successfull
net created successfully

Net: HouseConstruction_PT_002
(NrP: 26 NrTr: 18 NrArc: 51)

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

net check time: 0m 0.000sec

init dd package: 0m 3.649sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 258 (2.6e+02) #states 1,501 (3)



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

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

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

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[3<=p27 | 3<=p6]]]]
normalized: E [true U [3<=p27 | 3<=p6]]

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

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[p7<=p10 & 3<=p7]]
normalized: E [true U [p7<=p10 & 3<=p7]]

abstracting: (3<=p7)
states: 0
abstracting: (p7<=p10)
states: 1,110 (3)
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=p20 & 3<=p23] & 3<=p23]]
normalized: E [true U [[3<=p20 & 3<=p23] & 3<=p23]]

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

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[1<=p12 & 3<=p13]] & 3<=p20]]
normalized: E [true U [~ [[1<=p12 & 3<=p13]] & 3<=p20]]

abstracting: (3<=p20)
states: 0
abstracting: (3<=p13)
states: 0
abstracting: (1<=p12)
states: 580
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[3<=p3 | p10<=p10] | ~ [3<=p16]]]]
normalized: E [true U ~ [[~ [3<=p16] | [3<=p3 | p10<=p10]]]]

abstracting: (p10<=p10)
states: 1,501 (3)
abstracting: (3<=p3)
states: 0
abstracting: (3<=p16)
states: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[3<=p19 & 3<=p3] & [3<=p22 & 2<=p8]] & 2<=p8]]
normalized: E [true U [2<=p8 & [[3<=p22 & 2<=p8] & [3<=p19 & 3<=p3]]]]

abstracting: (3<=p3)
states: 0
abstracting: (3<=p19)
states: 0
abstracting: (2<=p8)
states: 45
abstracting: (3<=p22)
states: 0
abstracting: (2<=p8)
states: 45
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[3<=p25 | p9<=p7] | ~ [3<=p3]] & 3<=p22]]
normalized: E [true U [[[3<=p25 | p9<=p7] | ~ [3<=p3]] & 3<=p22]]

abstracting: (3<=p22)
states: 0
abstracting: (3<=p3)
states: 0
abstracting: (p9<=p7)
states: 1,306 (3)
abstracting: (3<=p25)
states: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[3<=p25 & 1<=p14]] & [3<=p13 & p16<=p14]]]
normalized: E [true U [[3<=p13 & p16<=p14] & ~ [[3<=p25 & 1<=p14]]]]

abstracting: (1<=p14)
states: 210
abstracting: (3<=p25)
states: 0
abstracting: (p16<=p14)
states: 1,110 (3)
abstracting: (3<=p13)
states: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [3<=p3] & [p2<=p19 & 2<=p1]] & ~ [~ [3<=p13]]]]
normalized: E [true U [[[p2<=p19 & 2<=p1] & ~ [3<=p3]] & 3<=p13]]

abstracting: (3<=p13)
states: 0
abstracting: (3<=p3)
states: 0
abstracting: (2<=p1)
states: 1
abstracting: (p2<=p19)
states: 1,445 (3)
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[2<=p9 & [[1<=p22 & p11<=p1] & [1<=p21 | 1<=p22]]]]
normalized: E [true U [[[1<=p21 | 1<=p22] & [1<=p22 & p11<=p1]] & 2<=p9]]

abstracting: (2<=p9)
states: 21
abstracting: (p11<=p1)
states: 1,067 (3)
abstracting: (1<=p22)
states: 375
abstracting: (1<=p22)
states: 375
abstracting: (1<=p21)
states: 540
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [p19<=p4] | ~ [3<=p5]] | [p15<=p6 | [3<=p15 | 1<=p27]]]]
normalized: ~ [E [true U ~ [[[[3<=p15 | 1<=p27] | p15<=p6] | [~ [3<=p5] | ~ [p19<=p4]]]]]]

abstracting: (p19<=p4)
states: 1,404 (3)
abstracting: (3<=p5)
states: 0
abstracting: (p15<=p6)
states: 1,078 (3)
abstracting: (1<=p27)
states: 555
abstracting: (3<=p15)
states: 0
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [p18<=p1] | ~ [p1<=p3]] & [2<=p13 & ~ [p25<=p1]]]]
normalized: E [true U [[~ [p25<=p1] & 2<=p13] & [~ [p1<=p3] | ~ [p18<=p1]]]]

abstracting: (p18<=p1)
states: 976
abstracting: (p1<=p3)
states: 1,436 (3)
abstracting: (2<=p13)
states: 56
abstracting: (p25<=p1)
states: 1,067 (3)
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[p4<=p2 & [2<=p22 | 3<=p4]] & [~ [2<=p2] | p1<=p22]]]
normalized: E [true U [[p1<=p22 | ~ [2<=p2]] & [p4<=p2 & [2<=p22 | 3<=p4]]]]

abstracting: (3<=p4)
states: 0
abstracting: (2<=p22)
states: 45
abstracting: (p4<=p2)
states: 369
abstracting: (2<=p2)
states: 1
abstracting: (p1<=p22)
states: 1,445 (3)
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[2<=p21 | 3<=p6] & ~ [p21<=p3]] | [[1<=p17 | p12<=p12] | 1<=p18]]]
normalized: ~ [E [true U ~ [[[[2<=p21 | 3<=p6] & ~ [p21<=p3]] | [[1<=p17 | p12<=p12] | 1<=p18]]]]]

abstracting: (1<=p18)
states: 540
abstracting: (p12<=p12)
states: 1,501 (3)
abstracting: (1<=p17)
states: 210
abstracting: (p21<=p3)
states: 976
abstracting: (3<=p6)
states: 0
abstracting: (2<=p21)
states: 90
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 3696 (3.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2072 6388 8460
used/not used/entry size/cache size: 7273 67101591 16 1024MB
basic ops cache: hits/miss/sum: 3074 9220 12294
used/not used/entry size/cache size: 14724 16762492 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: 894 1791 2685
used/not used/entry size/cache size: 1791 8386817 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 67105221
1 3610
2 13
3 20
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.468sec


BK_STOP 1494885336377

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

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

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


iterations count:77 (4), effective:18 (1)

initing FirstDep: 0m 0.000sec


iterations count:56 (3), effective:13 (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="S_HouseConstruction-PT-002"
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/S_HouseConstruction-PT-002.tgz
mv S_HouseConstruction-PT-002 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 S_HouseConstruction-PT-002, 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 r101-blw3-149441599200601"
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 ;