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-2270
Executing tool marcie
Input is Solitaire-PT-SqrNC5x5, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r106kn-smll-143285115200203
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433082549875

Model: Solitaire-PT-SqrNC5x5
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --place-order=5

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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=2 --place-order=5

parse successfull
net created successfully

(NrP: 50 NrTr: 84 NrArc: 456)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m50sec


-> reachability set: #nodes 64614 (6.5e+04) #states 16,098,428 (7)



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

checking: [[[maxVal(F52)<=2 & [maxVal(F64)<=1 & maxVal(F55)<=2]] & maxVal(T64)<=3] & maxVal(F45)<=2]
normalized: [maxVal(F45)<=2 & [maxVal(T64)<=3 & [maxVal(F52)<=2 & [maxVal(F64)<=1 & maxVal(F55)<=2]]]]

abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(F44)<=2 & maxVal(F65)<=1]
normalized: [maxVal(F44)<=2 & maxVal(F65)<=1]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(T22)<=3 & maxVal(T26)<=3]
normalized: [maxVal(T22)<=3 & maxVal(T26)<=3]

abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(F52)<=3 & maxVal(F26)<=1] & maxVal(T64)<=2]
normalized: [maxVal(T64)<=2 & [maxVal(F52)<=3 & maxVal(F26)<=1]]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(T65)<=1 & maxVal(T55)<=3]
normalized: [maxVal(T65)<=1 & maxVal(T55)<=3]

abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(T64)<=3 & maxVal(F23)<=2] & [[[[[maxVal(T32)<=2 & maxVal(F25)<=3] & [maxVal(F46)<=1 & maxVal(F23)<=3]] & [maxVal(F34)<=1 & [maxVal(T42)<=3 & maxVal(T46)<=2]]] & [maxVal(F43)<=2 & [maxVal(T45)<=3 & [maxVal(T32)<=1 & maxVal(T34)<=2]]]] & [maxVal(F43)<=3 & maxVal(T23)<=1]]]
normalized: [[maxVal(T64)<=3 & maxVal(F23)<=2] & [[[maxVal(F43)<=2 & [maxVal(T45)<=3 & [maxVal(T32)<=1 & maxVal(T34)<=2]]] & [[[maxVal(T32)<=2 & maxVal(F25)<=3] & [maxVal(F46)<=1 & maxVal(F23)<=3]] & [maxVal(F34)<=1 & [maxVal(T42)<=3 & maxVal(T46)<=2]]]] & [maxVal(F43)<=3 & maxVal(T23)<=1]]]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(F33)<=2 & maxVal(T44)<=1]
normalized: [maxVal(F33)<=2 & maxVal(T44)<=1]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(F25)<=1 & maxVal(T42)<=1] & maxVal(T56)<=1] & maxVal(T46)<=2]
normalized: [maxVal(T46)<=2 & [maxVal(T56)<=1 & [maxVal(F25)<=1 & maxVal(T42)<=1]]]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(T44)<=3
normalized: maxVal(T44)<=3

abstracting: (1<=3) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F45)<=1
normalized: maxVal(F45)<=1

abstracting: (1<=1) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(T44)<=2
normalized: maxVal(T44)<=2

abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(T54)<=2 & [maxVal(T56)<=3 & [[[maxVal(F55)<=2 & [maxVal(F23)<=3 & maxVal(T66)<=2]] & [[maxVal(T52)<=1 & maxVal(T62)<=1] & maxVal(F64)<=3]] & [maxVal(T53)<=3 & [maxVal(T54)<=2 & [maxVal(F66)<=3 & maxVal(T65)<=1]]]]]]
normalized: [maxVal(T54)<=2 & [maxVal(T56)<=3 & [[maxVal(T53)<=3 & [maxVal(T54)<=2 & [maxVal(F66)<=3 & maxVal(T65)<=1]]] & [[maxVal(F55)<=2 & [maxVal(F23)<=3 & maxVal(T66)<=2]] & [maxVal(F64)<=3 & [maxVal(T52)<=1 & maxVal(T62)<=1]]]]]]

abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F34)<=1
normalized: maxVal(F34)<=1

abstracting: (1<=1) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F62)<=3
normalized: maxVal(F62)<=3

abstracting: (1<=3) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(F63)<=2 & [[maxVal(T45)<=3 & maxVal(T26)<=3] & [maxVal(F45)<=1 & maxVal(F25)<=2]]] & [[maxVal(F35)<=3 & [maxVal(T55)<=1 & maxVal(F24)<=3]] & [[maxVal(T25)<=2 & maxVal(T22)<=2] & maxVal(T32)<=1]]] & [maxVal(F63)<=1 & maxVal(T42)<=3]] & [maxVal(T22)<=1 & [[maxVal(T33)<=3 & [[maxVal(F23)<=1 & maxVal(T44)<=2] & [maxVal(F32)<=1 & maxVal(T32)<=3]]] & maxVal(T34)<=1]]]
normalized: [[[[maxVal(F63)<=2 & [[maxVal(F45)<=1 & maxVal(F25)<=2] & [maxVal(T45)<=3 & maxVal(T26)<=3]]] & [[maxVal(T32)<=1 & [maxVal(T25)<=2 & maxVal(T22)<=2]] & [maxVal(F35)<=3 & [maxVal(T55)<=1 & maxVal(F24)<=3]]]] & [maxVal(F63)<=1 & maxVal(T42)<=3]] & [maxVal(T22)<=1 & [maxVal(T34)<=1 & [maxVal(T33)<=3 & [[maxVal(F32)<=1 & maxVal(T32)<=3] & [maxVal(F23)<=1 & maxVal(T44)<=2]]]]]]

abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=3) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
abstracting: (1<=1) states: 16,098,428 (7)
abstracting: (1<=2) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F34)<=3
normalized: maxVal(F34)<=3

abstracting: (1<=3) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 1m1sec


BK_STOP 1433082611707

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

.........10 64614.
initing FirstDep: 0m0sec

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="Solitaire-PT-SqrNC5x5"
export BK_EXAMINATION="ReachabilityBounds"
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/Solitaire-PT-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Solitaire-PT-SqrNC5x5, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r106kn-smll-143285115200203"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;