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_IBMB2S565S3960-PT-none, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441000424
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433375035953

Model: S_IBMB2S565S3960-PT-none
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 273 NrTr: 179 NrArc: 572)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 1m39sec


-> reachability set: #nodes 706208 (7.1e+05) #states 15,510,635,947,410,534 (16)



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

checking: [[[maxVal(callToTask_s00003961_output_s00001080)<=3 & [maxVal(callToTask_s00003961_output_s00001080)<=2 & [[maxVal(endNode_s00001402_input_default)<=2 & maxVal(callToTask_s00003969_output_s00001054)<=1] & maxVal(fork_s00002500_activated_s00001073)<=2]]] & maxVal(merge_s00002239_activated)<=2] & [maxVal(merge_s00001061_input_s00001066)<=3 & [maxVal(callToProcess_s00003957_output_s00001080)<=2 & [[[maxVal(fork_s00001298_activated_s00001073)<=3 & maxVal(callToProcess_s00003872_input_s00001066)<=1] & maxVal(callToTask_s00001360_output_s00001054)<=3] & [[maxVal(merge_s00001161_input_s00001128)<=1 & maxVal(merge_s00002241_activated)<=2] & maxVal(callToProcess_s00003957_input_s00001068)<=3]]]]]
normalized: [[maxVal(merge_s00002239_activated)<=2 & [maxVal(callToTask_s00003961_output_s00001080)<=3 & [maxVal(callToTask_s00003961_output_s00001080)<=2 & [maxVal(fork_s00002500_activated_s00001073)<=2 & [maxVal(endNode_s00001402_input_default)<=2 & maxVal(callToTask_s00003969_output_s00001054)<=1]]]]] & [maxVal(merge_s00001061_input_s00001066)<=3 & [maxVal(callToProcess_s00003957_output_s00001080)<=2 & [[maxVal(callToTask_s00001360_output_s00001054)<=3 & [maxVal(fork_s00001298_activated_s00001073)<=3 & maxVal(callToProcess_s00003872_input_s00001066)<=1]] & [maxVal(callToProcess_s00003957_input_s00001068)<=3 & [maxVal(merge_s00001161_input_s00001128)<=1 & maxVal(merge_s00002241_activated)<=2]]]]]]

abstracting: (7<=2) states: 0
abstracting: (7<=1) states: 0
abstracting: (7<=3) states: 0
abstracting: (7<=1) states: 0
abstracting: (7<=3) states: 0
abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
abstracting: (3<=2) states: 0
abstracting: (7<=3) states: 0
abstracting: (7<=1) states: 0
abstracting: (2<=2) states: 15,510,635,947,410,534 (16)
abstracting: (7<=2) states: 0
abstracting: (3<=2) states: 0
abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
abstracting: (2<=2) states: 15,510,635,947,410,534 (16)
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(callToProcess_s00003904_input_s00001052)<=3 & maxVal(fork_s00001298_input_s00001066)<=2] & maxVal(callToTask_s00003966_input_s00001052)<=1]
normalized: [maxVal(callToTask_s00003966_input_s00001052)<=1 & [maxVal(callToProcess_s00003904_input_s00001052)<=3 & maxVal(fork_s00001298_input_s00001066)<=2]]

abstracting: (7<=2) states: 0
abstracting: (2<=3) states: 15,510,635,947,410,534 (16)
abstracting: (7<=1) states: 0
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(callToTask_s00003977_output_s00001077)<=1 & [[[maxVal(callToTask_s00003913_input_s00001052)<=2 & maxVal(fork_s00002755_activated_s00001075)<=1] & maxVal(fork_s00001298_input_s00001066)<=3] & maxVal(merge_s00001162_input_s00001166)<=3]]
normalized: [maxVal(callToTask_s00003977_output_s00001077)<=1 & [maxVal(merge_s00001162_input_s00001166)<=3 & [maxVal(fork_s00001298_input_s00001066)<=3 & [maxVal(callToTask_s00003913_input_s00001052)<=2 & maxVal(fork_s00002755_activated_s00001075)<=1]]]]

abstracting: (1<=1) states: 15,510,635,947,410,534 (16)
abstracting: (7<=2) states: 0
abstracting: (7<=3) states: 0
abstracting: (2<=3) states: 15,510,635,947,410,534 (16)
abstracting: (3<=1) states: 0
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
-> the formula is TRUE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(merge_s00001161_input_s00001066)<=2 & [maxVal(callToTask_s00003963_output_s00001077)<=1 & [[maxVal(merge_s00001162_input_s00001299)<=3 & [[maxVal(callToTask_s00003975_input_s00001052)<=3 & maxVal(callToProcess_s00003859_inputCriterion_s00001053_used)<=3] & [maxVal(merge_s00002240_input_s00001127)<=1 & maxVal(callToTask_s00003981_input_s00001066)<=3]]] & [maxVal(endNode_s00001402_input_default)<=1 & maxVal(callToTask_s00003973_input_s00001068)<=1]]]]
normalized: [maxVal(merge_s00001161_input_s00001066)<=2 & [maxVal(callToTask_s00003963_output_s00001077)<=1 & [[maxVal(endNode_s00001402_input_default)<=1 & maxVal(callToTask_s00003973_input_s00001068)<=1] & [maxVal(merge_s00001162_input_s00001299)<=3 & [[maxVal(callToTask_s00003975_input_s00001052)<=3 & maxVal(callToProcess_s00003859_inputCriterion_s00001053_used)<=3] & [maxVal(merge_s00002240_input_s00001127)<=1 & maxVal(callToTask_s00003981_input_s00001066)<=3]]]]]]

abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
abstracting: (7<=1) states: 0
abstracting: (7<=3) states: 0
abstracting: (7<=3) states: 0
abstracting: (2<=3) states: 15,510,635,947,410,534 (16)
abstracting: (7<=1) states: 0
abstracting: (2<=1) states: 0
abstracting: (7<=1) states: 0
abstracting: (7<=2) states: 0
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(decision_s00001841_activated)<=3 & maxVal(callToTask_s00003965_output_s00001077)<=2] & maxVal(fork_s00001403_activated_s00001078)<=3] & maxVal(join_s00002243_input_s00001166)<=2]
normalized: [maxVal(join_s00002243_input_s00001166)<=2 & [maxVal(fork_s00001403_activated_s00001078)<=3 & [maxVal(decision_s00001841_activated)<=3 & maxVal(callToTask_s00003965_output_s00001077)<=2]]]

abstracting: (3<=2) states: 0
abstracting: (7<=3) states: 0
abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
abstracting: (7<=2) states: 0
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(endNode_s00001402_input_default)<=2 & [[maxVal(callToTask_s00003964_input_s00001052)<=1 & maxVal(callToProcess_s00003859_output_s00001054)<=2] & maxVal(merge_s00001160_input_s00001166)<=1]]
normalized: [maxVal(endNode_s00001402_input_default)<=2 & [maxVal(merge_s00001160_input_s00001166)<=1 & [maxVal(callToTask_s00003964_input_s00001052)<=1 & maxVal(callToProcess_s00003859_output_s00001054)<=2]]]

abstracting: (7<=2) states: 0
abstracting: (3<=1) states: 0
abstracting: (7<=1) states: 0
abstracting: (2<=2) states: 15,510,635,947,410,534 (16)
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(merge_s00002238_input_s00001066)<=3 & maxVal(callToTask_s00003970_inputCriterion_s00001053_used)<=1]
normalized: [maxVal(merge_s00002238_input_s00001066)<=3 & maxVal(callToTask_s00003970_inputCriterion_s00001053_used)<=1]

abstracting: (7<=1) states: 0
abstracting: (1<=3) states: 15,510,635,947,410,534 (16)
-> the formula is FALSE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 15,510,635,947,410,534 (16)
-> the formula is TRUE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=3) states: 15,510,635,947,410,534 (16)
-> the formula is TRUE

FORMULA IBMB2S565S3960-PT-none-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 4m31sec


BK_STOP 1433375308085

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

9988 98130 414396 397904 408268 412892 413977 412183 411152 646589
iterations count:10673 (59), effective:1584 (8)

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="S_IBMB2S565S3960-PT-none"
export BK_EXAMINATION="ReachabilityBounds"
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_IBMB2S565S3960-PT-none.tgz
mv S_IBMB2S565S3960-PT-none 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_IBMB2S565S3960-PT-none, 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 r162st-ebro-143319441000424"
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 ;