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-2979
Executing tool marcie
Input is S_HouseConstruction-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259700808
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464506478764


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m 3.665sec


RS generation: 0m 0.283sec


-> reachability set: #nodes 26071 (2.6e+04) #states 1,663,565,805 (9)



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

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

abstracting: (3<=p16) states: 400,947,690 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.829sec

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

abstracting: (2<=p20) states: 516,848,925 (8)
-> the formula is FALSE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.491sec

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

abstracting: (3<=p19) states: 250,628,601 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.444sec

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

abstracting: (3<=p22) states: 250,628,601 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.701sec

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

abstracting: (3<=p16) states: 400,947,690 (8)
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: EF [[2<=p23 & ~ [~ [1<=p15]]]]
normalized: E [true U [2<=p23 & 1<=p15]]

abstracting: (1<=p15) states: 1,086,886,944 (9)
abstracting: (2<=p23) states: 516,848,925 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.683sec

checking: EF [~ [[~ [2<=p14] | ~ [p18<=p17]]]]
normalized: E [true U ~ [[~ [p18<=p17] | ~ [2<=p14]]]]

abstracting: (2<=p14) states: 310,208,535 (8)
abstracting: (p18<=p17) states: 735,116,540 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.624sec

checking: EF [[1<=p19 & [3<=p7 & p5<=p25]]]
normalized: E [true U [1<=p19 & [3<=p7 & p5<=p25]]]

abstracting: (p5<=p25) states: 1,189,854,182 (9)
abstracting: (3<=p7) states: 400,947,690 (8)
abstracting: (1<=p19) states: 970,132,115 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.542sec

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

abstracting: (3<=p10) states: 119,407,818 (8)
abstracting: (p4<=p5) states: 99,048,235 (7)
abstracting: (2<=p10) states: 310,208,535 (8)
-> the formula is TRUE

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

MC time: 0m 0.306sec

checking: EF [~ [[~ [p4<=p27] | [p14<=p16 | p18<=p9]]]]
normalized: E [true U ~ [[[p14<=p16 | p18<=p9] | ~ [p4<=p27]]]]

abstracting: (p4<=p27) states: 233,883,091 (8)
abstracting: (p18<=p9) states: 815,307,920 (8)
abstracting: (p14<=p16) states: 1,309,261,690 (9)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.690sec

checking: AG [[2<=p17 | [[3<=p7 | p22<=p1] | ~ [p8<=p2]]]]
normalized: ~ [E [true U ~ [[2<=p17 | [~ [p8<=p2] | [3<=p7 | p22<=p1]]]]]]

abstracting: (p22<=p1) states: 850,694,900 (8)
abstracting: (3<=p7) states: 400,947,690 (8)
abstracting: (p8<=p2) states: 739,063,640 (8)
abstracting: (2<=p17) states: 310,208,535 (8)
-> the formula is FALSE

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

MC time: 0m 1.635sec

checking: EF [[[~ [p11<=p9] & [p6<=p11 & 2<=p8]] & [~ [2<=p20] & 3<=p22]]]
normalized: E [true U [[3<=p22 & ~ [2<=p20]] & [[p6<=p11 & 2<=p8] & ~ [p11<=p9]]]]

abstracting: (p11<=p9) states: 904,401,008 (8)
abstracting: (2<=p8) states: 620,583,225 (8)
abstracting: (p6<=p11) states: 1,313,618,330 (9)
abstracting: (2<=p20) states: 516,848,925 (8)
abstracting: (3<=p22) states: 250,628,601 (8)
-> the formula is TRUE

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

MC time: 0m 0.623sec

checking: EF [[2<=p18 & [[p2<=p8 & 1<=p18] | [1<=p20 | p5<=p12]]]]
normalized: E [true U [2<=p18 & [[1<=p20 | p5<=p12] | [p2<=p8 & 1<=p18]]]]

abstracting: (1<=p18) states: 1,196,773,710 (9)
abstracting: (p2<=p8) states: 1,438,194,792 (9)
abstracting: (p5<=p12) states: 1,458,777,757 (9)
abstracting: (1<=p20) states: 970,132,115 (8)
abstracting: (2<=p18) states: 783,069,249 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.005sec

checking: EF [[[~ [p26<=p11] & [p27<=p12 & p4<=p22]] & 2<=p12]]
normalized: E [true U [2<=p12 & [[p27<=p12 & p4<=p22] & ~ [p26<=p11]]]]

abstracting: (p26<=p11) states: 1,309,261,690 (9)
abstracting: (p4<=p22) states: 132,731,617 (8)
abstracting: (p27<=p12) states: 1,025,270,223 (9)
abstracting: (2<=p12) states: 966,126,117 (8)
-> the formula is TRUE

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

MC time: 0m 2.019sec

checking: AG [[~ [[p4<=p1 & p4<=p25]] | [[p25<=p20 | 3<=p11] | ~ [3<=p23]]]]
normalized: ~ [E [true U ~ [[[~ [3<=p23] | [p25<=p20 | 3<=p11]] | ~ [[p4<=p1 & p4<=p25]]]]]]

abstracting: (p4<=p25) states: 282,341,667 (8)
abstracting: (p4<=p1) states: 61,408,595 (7)
abstracting: (3<=p11) states: 400,947,690 (8)
abstracting: (p25<=p20) states: 938,350,435 (8)
abstracting: (3<=p23) states: 250,628,601 (8)
-> the formula is FALSE

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

MC time: 0m 0.958sec

checking: AG [[[[p18<=p4 | p5<=p22] & ~ [3<=p19]] & [[p22<=p1 | p13<=p2] | p10<=p14]]]
normalized: ~ [E [true U ~ [[[p10<=p14 | [p22<=p1 | p13<=p2]] & [~ [3<=p19] & [p18<=p4 | p5<=p22]]]]]]

abstracting: (p5<=p22) states: 1,105,826,931 (9)
abstracting: (p18<=p4) states: 1,547,489,063 (9)
abstracting: (3<=p19) states: 250,628,601 (8)
abstracting: (p13<=p2) states: 563,697,112 (8)
abstracting: (p22<=p1) states: 850,694,900 (8)
abstracting: (p10<=p14) states: 1,142,475,414 (9)
-> the formula is FALSE

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

MC time: 0m 4.134sec


Total processing time: 0m22.849sec


BK_STOP 1464506501661

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

check for maximal unmarked siphon
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.001sec


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

initing FirstDep: 0m 0.000sec


iterations count:50 (2), effective:7 (0)

iterations count:46 (2), effective:9 (0)

iterations count:46 (2), effective:9 (0)

iterations count:49 (2), effective:10 (0)

iterations count:50 (2), effective:7 (0)

iterations count:55 (3), effective:13 (0)

iterations count:45 (2), effective:8 (0)

iterations count:47 (2), effective:10 (0)

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

iterations count:78 (4), effective:17 (0)

iterations count:52 (2), effective:12 (0)

iterations count:52 (2), effective:12 (0)

iterations count:46 (2), effective:9 (0)

iterations count:87 (4), effective:21 (1)

iterations count:78 (4), effective:17 (0)

iterations count:77 (4), effective:16 (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-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-010.tgz
mv S_HouseConstruction-PT-010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_HouseConstruction-PT-010, 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 r149kn-smll-146416259700808"
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 ;