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 S_ResAllocation-PT-R020C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930501166
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433783160272

Model: S_ResAllocation-PT-R020C002
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 80 NrTr: 42 NrArc: 200)

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 215 (2.2e+02) #states 11,534,336 (7)



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

checking: EF [[[1<=p_0_18 & 3<=r_0_0] & ~ [2<=p_0_9]]]
normalized: E [true U [~ [2<=p_0_9] & [1<=p_0_18 & 3<=r_0_0]]]

abstracting: (3<=r_0_0) states: 0
abstracting: (1<=p_0_18) states: 786,432 (5)
abstracting: (2<=p_0_9) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[1<=p_0_13 | p_1_8<=r_0_12] | [p_0_15<=p_1_4 & r_0_18<=r_1_8]] | p_0_5<=p_1_3]]
normalized: ~ [E [true U ~ [[p_0_5<=p_1_3 | [[p_0_15<=p_1_4 & r_0_18<=r_1_8] | [1<=p_0_13 | p_1_8<=r_0_12]]]]]]

abstracting: (p_1_8<=r_0_12) states: 10,223,616 (7)
abstracting: (1<=p_0_13) states: 2,097,152 (6)
abstracting: (r_0_18<=r_1_8) states: 10,223,616 (7)
abstracting: (p_0_15<=p_1_4) states: 9,961,472 (6)
abstracting: (p_0_5<=p_1_3) states: 7,340,032 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m8sec

checking: AG [[[1<=r_0_14 | [2<=p_1_18 | p_0_11<=r_1_4]] | r_0_6<=p_0_7]]
normalized: ~ [E [true U ~ [[r_0_6<=p_0_7 | [1<=r_0_14 | [2<=p_1_18 | p_0_11<=r_1_4]]]]]]

abstracting: (p_0_11<=r_1_4) states: 11,534,336 (7)
abstracting: (2<=p_1_18) states: 0
abstracting: (1<=r_0_14) states: 5,505,024 (6)
abstracting: (r_0_6<=p_0_7) states: 7,864,320 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=p_1_18 & ~ [[3<=p_0_1 | 3<=p_1_16]]]]
normalized: E [true U [3<=p_1_18 & ~ [[3<=p_0_1 | 3<=p_1_16]]]]

abstracting: (3<=p_1_16) states: 0
abstracting: (3<=p_0_1) states: 0
abstracting: (3<=p_1_18) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [3<=p_0_17] | 2<=p_1_15] | [~ [p_1_5<=p_1_4] | ~ [r_1_19<=p_0_5]]]]
normalized: ~ [E [true U ~ [[[~ [p_1_5<=p_1_4] | ~ [r_1_19<=p_0_5]] | [2<=p_1_15 | ~ [3<=p_0_17]]]]]]

abstracting: (3<=p_0_17) states: 0
abstracting: (2<=p_1_15) states: 0
abstracting: (r_1_19<=p_0_5) states: 7,733,248 (6)
abstracting: (p_1_5<=p_1_4) states: 10,485,760 (7)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=p_0_18) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[2<=r_1_10 & ~ [~ [2<=p_0_17]]]]
normalized: E [true U [2<=r_1_10 & 2<=p_0_17]]

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[3<=r_0_2 | 1<=p_1_2]]]]
normalized: E [true U [3<=r_0_2 | 1<=p_1_2]]

abstracting: (1<=p_1_2) states: 1,048,576 (6)
abstracting: (3<=r_0_2) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[r_0_10<=r_1_0 | [r_1_10<=r_0_19 & r_1_11<=p_1_1]]]]
normalized: E [true U ~ [[r_0_10<=r_1_0 | [r_1_10<=r_0_19 & r_1_11<=p_1_1]]]]

abstracting: (r_1_11<=p_1_1) states: 3,801,088 (6)
abstracting: (r_1_10<=r_0_19) states: 7,077,888 (6)
abstracting: (r_0_10<=r_1_0) states: 11,272,192 (7)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21sec

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

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

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[r_1_0<=p_0_11 & 3<=p_1_16]]
normalized: E [true U [r_1_0<=p_0_11 & 3<=p_1_16]]

abstracting: (3<=p_1_16) states: 0
abstracting: (r_1_0<=p_0_11) states: 3,145,728 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m51sec


BK_STOP 1433783212127

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

511
iterations count:1511 (35), effective:420 (10)

initing FirstDep: 0m0sec


iterations count:508 (12), effective:142 (3)

iterations count:725 (17), effective:189 (4)

iterations count:913 (21), effective:241 (5)

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_ResAllocation-PT-R020C002"
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/S_ResAllocation-PT-R020C002.tgz
mv S_ResAllocation-PT-R020C002 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 S_ResAllocation-PT-R020C002, 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 r218st-ebro-143344930501166"
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 ;