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 HouseConstruction-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767900223
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463665989967


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_005
(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.946sec


RS generation: 0m 0.025sec


-> reachability set: #nodes 3461 (3.5e+03) #states 1,187,984 (6)



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

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

abstracting: (2<=p26) states: 81,690 (4)
-> the formula is TRUE

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

MC time: 0m 0.063sec

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

abstracting: (p7<=p4) states: 1,187,984 (6)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[3<=p23 & ~ [1<=p8]]]
normalized: E [true U [3<=p23 & ~ [1<=p8]]]

abstracting: (1<=p8) states: 574,280 (5)
abstracting: (3<=p23) states: 45,500 (4)
-> the formula is TRUE

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

MC time: 0m 0.045sec

checking: EF [~ [[2<=p26 | ~ [3<=p11]]]]
normalized: E [true U ~ [[2<=p26 | ~ [3<=p11]]]]

abstracting: (3<=p11) states: 90,960 (4)
abstracting: (2<=p26) states: 81,690 (4)
-> the formula is TRUE

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

MC time: 0m 0.027sec

checking: AG [~ [[2<=p16 & [2<=p9 | 3<=p27]]]]
normalized: ~ [E [true U [2<=p16 & [2<=p9 | 3<=p27]]]]

abstracting: (3<=p27) states: 106,190 (5)
abstracting: (2<=p9) states: 121,986 (5)
abstracting: (2<=p16) states: 255,468 (5)
-> the formula is FALSE

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

MC time: 0m 0.081sec

checking: EF [[~ [[2<=p22 & 3<=p20]] & 2<=p25]]
normalized: E [true U [2<=p25 & ~ [[2<=p22 & 3<=p20]]]]

abstracting: (3<=p20) states: 45,500 (4)
abstracting: (2<=p22) states: 174,300 (5)
abstracting: (2<=p25) states: 255,468 (5)
-> the formula is TRUE

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

MC time: 0m 0.037sec

checking: EF [[~ [~ [p3<=p4]] & 2<=p25]]
normalized: E [true U [p3<=p4 & 2<=p25]]

abstracting: (2<=p25) states: 255,468 (5)
abstracting: (p3<=p4) states: 1,167,894 (6)
-> the formula is TRUE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [3<=p7] | [[1<=p14 & 3<=p2] | ~ [3<=p13]]]]
normalized: ~ [E [true U ~ [[[~ [3<=p13] | [1<=p14 & 3<=p2]] | ~ [3<=p7]]]]]

abstracting: (3<=p7) states: 90,960 (4)
abstracting: (3<=p2) states: 1,501 (3)
abstracting: (1<=p14) states: 341,880 (5)
abstracting: (3<=p13) states: 75,950 (4)
-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: EF [[~ [[p19<=p25 | 3<=p16]] & ~ [~ [3<=p26]]]]
normalized: E [true U [3<=p26 & ~ [[p19<=p25 | 3<=p16]]]]

abstracting: (3<=p16) states: 90,960 (4)
abstracting: (p19<=p25) states: 879,054 (5)
abstracting: (3<=p26) states: 15,155 (4)
-> the formula is TRUE

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

MC time: 0m 0.043sec

checking: EF [[[[2<=p23 & 3<=p10] & ~ [p22<=p1]] | 3<=p15]]
normalized: E [true U [3<=p15 | [~ [p22<=p1] & [2<=p23 & 3<=p10]]]]

abstracting: (3<=p10) states: 15,155 (4)
abstracting: (2<=p23) states: 174,300 (5)
abstracting: (p22<=p1) states: 727,124 (5)
abstracting: (3<=p15) states: 90,960 (4)
-> the formula is TRUE

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

MC time: 0m 0.019sec

checking: EF [[~ [p23<=p27] & [p12<=p3 | ~ [2<=p13]]]]
normalized: E [true U [[p12<=p3 | ~ [2<=p13]] & ~ [p23<=p27]]]

abstracting: (p23<=p27) states: 1,187,984 (6)
abstracting: (2<=p13) states: 267,911 (5)
abstracting: (p12<=p3) states: 479,199 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[[2<=p11 | p25<=p19] | [1<=p2 | 2<=p1]] | ~ [1<=p7]]]
normalized: ~ [E [true U ~ [[~ [1<=p7] | [[2<=p11 | p25<=p19] | [1<=p2 | 2<=p1]]]]]]

abstracting: (2<=p1) states: 19,406 (4)
abstracting: (1<=p2) states: 173,451 (5)
abstracting: (p25<=p19) states: 770,574 (5)
abstracting: (2<=p11) states: 255,468 (5)
abstracting: (1<=p7) states: 589,636 (5)
-> the formula is FALSE

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

MC time: 0m 0.033sec

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

abstracting: (3<=p25) states: 90,960 (4)
abstracting: (1<=p4) states: 1,125,696 (6)
abstracting: (p20<=p5) states: 807,160 (5)
abstracting: (p27<=p20) states: 653,408 (5)
-> the formula is FALSE

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

MC time: 0m 0.054sec

checking: EF [[[p19<=p25 | 3<=p23] & [[3<=p26 | 1<=p9] & ~ [p26<=p6]]]]
normalized: E [true U [[~ [p26<=p6] & [3<=p26 | 1<=p9]] & [p19<=p25 | 3<=p23]]]

abstracting: (3<=p23) states: 45,500 (4)
abstracting: (p19<=p25) states: 879,054 (5)
abstracting: (1<=p9) states: 441,406 (5)
abstracting: (3<=p26) states: 15,155 (4)
abstracting: (p26<=p6) states: 906,744 (5)
-> the formula is TRUE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: EF [[[[1<=p6 & p12<=p4] & 3<=p4] & [~ [p21<=p4] & ~ [p13<=p5]]]]
normalized: E [true U [[~ [p13<=p5] & ~ [p21<=p4]] & [3<=p4 & [1<=p6 & p12<=p4]]]]

abstracting: (p12<=p4) states: 1,066,306 (6)
abstracting: (1<=p6) states: 291,996 (5)
abstracting: (3<=p4) states: 679,306 (5)
abstracting: (p21<=p4) states: 1,084,478 (6)
abstracting: (p13<=p5) states: 666,757 (5)
-> the formula is TRUE

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

MC time: 0m 0.035sec

checking: AG [[[[1<=p20 | p2<=p16] & p18<=p27] | [[p11<=p7 | p14<=p19] | p23<=p2]]]
normalized: ~ [E [true U ~ [[[p23<=p2 | [p11<=p7 | p14<=p19]] | [p18<=p27 & [1<=p20 | p2<=p16]]]]]]

abstracting: (p2<=p16) states: 1,086,326 (6)
abstracting: (1<=p20) states: 509,460 (5)
abstracting: (p18<=p27) states: 823,529 (5)
abstracting: (p14<=p19) states: 953,491 (5)
abstracting: (p11<=p7) states: 783,184 (5)
abstracting: (p23<=p2) states: 727,124 (5)
-> the formula is FALSE

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

MC time: 0m 0.124sec


Total processing time: 0m 6.196sec


BK_STOP 1463665996199

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


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

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:76 (4), effective:15 (0)

iterations count:54 (3), effective:9 (0)

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

iterations count:37 (2), effective:5 (0)

iterations count:63 (3), effective:17 (0)

iterations count:35 (1), effective:6 (0)

iterations count:61 (3), effective:11 (0)

iterations count:60 (3), effective:14 (0)

iterations count:58 (3), effective:14 (0)

iterations count:74 (4), effective:14 (0)

iterations count:78 (4), effective:19 (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="HouseConstruction-PT-005"
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/HouseConstruction-PT-005.tgz
mv HouseConstruction-PT-005 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 HouseConstruction-PT-005, 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 r053kn-smll-146358767900223"
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 ;