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_Raft-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128000151
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464560804777


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: Raft_PT_03
(NrP: 53 NrTr: 98 NrArc: 328)

net check time: 0m 0.000sec

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

init dd package: 0m 4.034sec


RS generation: 0m 0.301sec


-> reachability set: #nodes 204 (2.0e+02) #states 33,819,621 (7)



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

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

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

FORMULA Raft-PT-03-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-03-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[3<=p26 | ~ [2<=p42]]]
normalized: ~ [E [true U ~ [[3<=p26 | ~ [2<=p42]]]]]

abstracting: (2<=p42) states: 0
abstracting: (3<=p26) states: 0
-> the formula is TRUE

FORMULA Raft-PT-03-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p36 & 3<=p15]]
normalized: E [true U [2<=p36 & 3<=p15]]

abstracting: (3<=p15) states: 0
abstracting: (2<=p36) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=p28 | 1<=p36]]
normalized: E [true U [3<=p28 | 1<=p36]]

abstracting: (1<=p36) states: 6,501,780 (6)
abstracting: (3<=p28) states: 0
-> the formula is TRUE

FORMULA Raft-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

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

abstracting: (p19<=p16) states: 27,317,841 (7)
abstracting: (3<=p32) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[1<=p48 | [3<=p36 & p45<=p34]]]
normalized: E [true U [1<=p48 | [3<=p36 & p45<=p34]]]

abstracting: (p45<=p34) states: 27,569,621 (7)
abstracting: (3<=p36) states: 0
abstracting: (1<=p48) states: 6,763,924 (6)
-> the formula is TRUE

FORMULA Raft-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: EF [[3<=p29 & [1<=p30 & [p33<=p1 & 3<=p17]]]]
normalized: E [true U [3<=p29 & [1<=p30 & [p33<=p1 & 3<=p17]]]]

abstracting: (3<=p17) states: 0
abstracting: (p33<=p1) states: 28,552,661 (7)
abstracting: (1<=p30) states: 7,812,500 (6)
abstracting: (3<=p29) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[2<=p31 & 3<=p28] & [3<=p47 & 3<=p51]] & 1<=p13]]
normalized: E [true U [1<=p13 & [[3<=p47 & 3<=p51] & [2<=p31 & 3<=p28]]]]

abstracting: (3<=p28) states: 0
abstracting: (2<=p31) states: 0
abstracting: (3<=p51) states: 0
abstracting: (3<=p47) states: 0
abstracting: (1<=p13) states: 6,501,780 (6)
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[p17<=p33 & 2<=p41] & [2<=p42 | 2<=p42]]]]
normalized: ~ [E [true U [[2<=p42 | 2<=p42] & [p17<=p33 & 2<=p41]]]]

abstracting: (2<=p41) states: 0
abstracting: (p17<=p33) states: 28,552,661 (7)
abstracting: (2<=p42) states: 0
abstracting: (2<=p42) states: 0
-> the formula is TRUE

FORMULA Raft-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[1<=p32 | 3<=p31] & [3<=p49 | 3<=p52]] & [~ [2<=p14] | 2<=p26]]]
normalized: E [true U [[2<=p26 | ~ [2<=p14]] & [[3<=p49 | 3<=p52] & [1<=p32 | 3<=p31]]]]

abstracting: (3<=p31) states: 0
abstracting: (1<=p32) states: 6,501,780 (6)
abstracting: (3<=p52) states: 0
abstracting: (3<=p49) states: 0
abstracting: (2<=p14) states: 0
abstracting: (2<=p26) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[p39<=p36 & 1<=p45] | ~ [p43<=p52]] & 2<=p24]]
normalized: E [true U [2<=p24 & [[p39<=p36 & 1<=p45] | ~ [p43<=p52]]]]

abstracting: (p43<=p52) states: 28,943,286 (7)
abstracting: (1<=p45) states: 7,812,500 (6)
abstracting: (p39<=p36) states: 27,317,841 (7)
abstracting: (2<=p24) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[p30<=p36 | 1<=p44] | ~ [3<=p31]] | [~ [p44<=p3] | [3<=p52 & 1<=p7]]]]
normalized: ~ [E [true U ~ [[[[3<=p52 & 1<=p7] | ~ [p44<=p3]] | [~ [3<=p31] | [p30<=p36 | 1<=p44]]]]]]

abstracting: (1<=p44) states: 6,501,780 (6)
abstracting: (p30<=p36) states: 27,569,621 (7)
abstracting: (3<=p31) states: 0
abstracting: (p44<=p3) states: 28,552,661 (7)
abstracting: (1<=p7) states: 6,501,780 (6)
abstracting: (3<=p52) states: 0
-> the formula is TRUE

FORMULA Raft-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[p41<=p49 | [p40<=p10 & 1<=p13]] | [~ [p2<=p26] & ~ [p36<=p42]]]]
normalized: ~ [E [true U ~ [[[~ [p36<=p42] & ~ [p2<=p26]] | [p41<=p49 | [p40<=p10 & 1<=p13]]]]]]

abstracting: (1<=p13) states: 6,501,780 (6)
abstracting: (p40<=p10) states: 27,569,621 (7)
abstracting: (p41<=p49) states: 28,618,197 (7)
abstracting: (p2<=p26) states: 28,552,661 (7)
abstracting: (p36<=p42) states: 28,552,661 (7)
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [[[[p2<=p9 | p52<=p49] & 3<=p49] & [[1<=p10 | 2<=p40] & [1<=p37 & 1<=p37]]]]
normalized: E [true U [[3<=p49 & [p2<=p9 | p52<=p49]] & [[1<=p10 | 2<=p40] & [1<=p37 & 1<=p37]]]]

abstracting: (1<=p37) states: 6,501,780 (6)
abstracting: (1<=p37) states: 6,501,780 (6)
abstracting: (2<=p40) states: 0
abstracting: (1<=p10) states: 7,812,500 (6)
abstracting: (p52<=p49) states: 27,055,697 (7)
abstracting: (p2<=p9) states: 28,552,661 (7)
abstracting: (3<=p49) states: 0
-> the formula is FALSE

FORMULA Raft-PT-03-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 5.860sec


BK_STOP 1464560810676

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

125 169 155 208 240 205 213 242 256 264 293 296 316 225 351 403 268 277 360 345 337 276 377 239 264 345 251 342 379 245 398 354
iterations count:32805 (334), effective:894 (9)

initing FirstDep: 0m 0.000sec


iterations count:489 (4), effective:19 (0)

iterations count:698 (7), effective:29 (0)

iterations count:760 (7), effective:31 (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_Raft-PT-03"
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_Raft-PT-03.tgz
mv S_Raft-PT-03 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_Raft-PT-03, 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 r185kn-smll-146444128000151"
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 ;