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-2265
Executing tool marcie
Input is HouseConstruction-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503600321
=====================================================================

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

Model: HouseConstruction-PT-002
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Plain order (as read)
--memory=6 --suppress --rs-algorithm=3 --place-order=1

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=1

parse successfull
net created successfully

(NrP: 26 NrTr: 18 NrArc: 51)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


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



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

checking: EF [[~ [[3<=p11 & 3<=p23]] & [2<=p17 & [1<=p9 & p21<=p8]]]]
normalized: E [true U [[2<=p17 & [1<=p9 & p21<=p8]] & ~ [[3<=p11 & 3<=p23]]]]

abstracting: (3<=p23) states: 0
abstracting: (3<=p11) states: 0
abstracting: (p21<=p8) states: 1,051 (3)
abstracting: (1<=p9) states: 266
abstracting: (2<=p17) states: 15
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [3<=p7] | [~ [p13<=p18] | [3<=p12 & p26<=p14]]]]
normalized: ~ [E [true U ~ [[[~ [p13<=p18] | [3<=p12 & p26<=p14]] | ~ [3<=p7]]]]]

abstracting: (3<=p7) states: 0
abstracting: (p26<=p14) states: 1,306 (3)
abstracting: (3<=p12) states: 0
abstracting: (p13<=p18) states: 1,150 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[[p27<=p10 & 2<=p25] & [3<=p5 | 2<=p4]]]]
normalized: ~ [E [true U [[p27<=p10 & 2<=p25] & [3<=p5 | 2<=p4]]]]

abstracting: (2<=p4) states: 522
abstracting: (3<=p5) states: 0
abstracting: (2<=p25) states: 75
abstracting: (p27<=p10) states: 991
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[[1<=p20 & 3<=p10] & 1<=p14]]]
normalized: ~ [E [true U [1<=p14 & [1<=p20 & 3<=p10]]]]

abstracting: (3<=p10) states: 0
abstracting: (1<=p20) states: 375
abstracting: (1<=p14) states: 210
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=p21) states: 0
abstracting: (p23<=p4) states: 1,404 (3)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[[2<=p13 | [2<=p19 & p20<=p27]] & 1<=p23]]
normalized: E [true U [1<=p23 & [2<=p13 | [2<=p19 & p20<=p27]]]]

abstracting: (p20<=p27) states: 1,201 (3)
abstracting: (2<=p19) states: 45
abstracting: (2<=p13) states: 56
abstracting: (1<=p23) states: 375
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[p10<=p13 | p8<=p5] | ~ [~ [p13<=p1]]]]
normalized: ~ [E [true U ~ [[p13<=p1 | [p10<=p13 | p8<=p5]]]]]

abstracting: (p8<=p5) states: 1,296 (3)
abstracting: (p10<=p13) states: 1,501 (3)
abstracting: (p13<=p1) states: 1,056 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[~ [[p10<=p16 | p27<=p4]] & [p25<=p3 | p11<=p21]]]
normalized: E [true U [[p25<=p3 | p11<=p21] & ~ [[p10<=p16 | p27<=p4]]]]

abstracting: (p27<=p4) states: 1,348 (3)
abstracting: (p10<=p16) states: 1,353 (3)
abstracting: (p11<=p21) states: 1,199 (3)
abstracting: (p25<=p3) states: 1,067 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[p6<=p27 & ~ [p18<=p16]] & [[p14<=p23 & 2<=p6] & p5<=p20]]]
normalized: E [true U [[p6<=p27 & ~ [p18<=p16]] & [p5<=p20 & [p14<=p23 & 2<=p6]]]]

abstracting: (2<=p6) states: 3
abstracting: (p14<=p23) states: 1,321 (3)
abstracting: (p5<=p20) states: 1,275 (3)
abstracting: (p18<=p16) states: 1,105 (3)
abstracting: (p6<=p27) states: 1,405 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[2<=p10 | [[p23<=p11 | 1<=p25] | ~ [2<=p11]]]]
normalized: ~ [E [true U ~ [[2<=p10 | [~ [2<=p11] | [p23<=p11 | 1<=p25]]]]]]

abstracting: (1<=p25) states: 446
abstracting: (p23<=p11) states: 1,231 (3)
abstracting: (2<=p11) states: 75
abstracting: (2<=p10) states: 15
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

abstracting: (1<=p1) states: 66
abstracting: (p1<=p3) states: 1,436 (3)
abstracting: (2<=p11) states: 75
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [[3<=p26 & [3<=p25 | p4<=p25]]]]
normalized: ~ [E [true U [3<=p26 & [3<=p25 | p4<=p25]]]]

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

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

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432538262314

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

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: 0m0sec


iterations count:140 (7), effective:36 (2)

initing FirstDep: 0m0sec


iterations count:72 (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="HouseConstruction-PT-002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/HouseConstruction-PT-002.tgz
mv HouseConstruction-PT-002 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is 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 r050kn-ebro-143236503600321"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;