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 IBM319-PT-none, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700047
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633151362

Model: IBM319-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: 253 NrTr: 178 NrArc: 526)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 1063 (1.1e+03) #states 2,482 (3)



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

checking: [maxVal(callToTask_s00002960_output_s00001054)<=3 & maxVal(callToTask_s00002963_input_s00001052)<=3]
normalized: [maxVal(callToTask_s00002960_output_s00001054)<=3 & maxVal(callToTask_s00002963_input_s00001052)<=3]

abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(callToTask_s00001406_input_s00001066)<=1 & [[[maxVal(callToTask_s00002956_inputCriterion_s00001053_used)<=1 & [[maxVal(callToTask_s00002962_input_s00001052)<=1 & maxVal(callToProcess_s00002944_inputCriterion_s00001053_used)<=2] & maxVal(callToTask_s00002932_output_s00001077)<=3]] & maxVal(callToTask_s00002960_output_s00001077)<=2] & [maxVal(callToProcess_s00001108_output_s00001054)<=3 & [maxVal(callToTask_s00002932_inputCriterion_s00001053_used)<=3 & [maxVal(callToProcess_s00002943_inputCriterion_s00001053_used)<=2 & [maxVal(join_s00001164_activated_s00001064)<=1 & maxVal(callToTask_s00002931_output_s00001077)<=2]]]]]]
normalized: [maxVal(callToTask_s00001406_input_s00001066)<=1 & [[maxVal(callToTask_s00002960_output_s00001077)<=2 & [maxVal(callToTask_s00002956_inputCriterion_s00001053_used)<=1 & [maxVal(callToTask_s00002932_output_s00001077)<=3 & [maxVal(callToTask_s00002962_input_s00001052)<=1 & maxVal(callToProcess_s00002944_inputCriterion_s00001053_used)<=2]]]] & [maxVal(callToProcess_s00001108_output_s00001054)<=3 & [maxVal(callToTask_s00002932_inputCriterion_s00001053_used)<=3 & [maxVal(callToProcess_s00002943_inputCriterion_s00001053_used)<=2 & [maxVal(join_s00001164_activated_s00001064)<=1 & maxVal(callToTask_s00002931_output_s00001077)<=2]]]]]]

abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (0<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(callToTask_s00002063_input_s00001052)<=1 & maxVal(decision_s00001126_activated)<=3] & [maxVal(callToTask_s00002964_input_s00001052)<=3 & maxVal(callToTask_s00002955_output_s00001054)<=2]] & [[maxVal(join_s00001163_input_s00001052)<=2 & maxVal(callToTask_s00001406_input_s00001052)<=2] & maxVal(callToTask_s00002044_inputCriterion_s00001053_used)<=2]] & maxVal(merge_s00002240_input_s00001127)<=1] & maxVal(alpha)<=3] & maxVal(fork_s00001298_activated_s00001073)<=2]
normalized: [maxVal(fork_s00001298_activated_s00001073)<=2 & [maxVal(alpha)<=3 & [maxVal(merge_s00002240_input_s00001127)<=1 & [[[maxVal(callToTask_s00002063_input_s00001052)<=1 & maxVal(decision_s00001126_activated)<=3] & [maxVal(callToTask_s00002964_input_s00001052)<=3 & maxVal(callToTask_s00002955_output_s00001054)<=2]] & [maxVal(callToTask_s00002044_inputCriterion_s00001053_used)<=2 & [maxVal(join_s00001163_input_s00001052)<=2 & maxVal(callToTask_s00001406_input_s00001052)<=2]]]]]]

abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(callToTask_s00002965_output_s00001054)<=3 & [maxVal(callToTask_s00002954_input_s00001066)<=1 & [maxVal(callToTask_s00002949_output_s00001054)<=2 & maxVal(join_s00001164_activated_s00001062)<=2]]]
normalized: [maxVal(callToTask_s00002965_output_s00001054)<=3 & [maxVal(callToTask_s00002954_input_s00001066)<=1 & [maxVal(callToTask_s00002949_output_s00001054)<=2 & maxVal(join_s00001164_activated_s00001062)<=2]]]

abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[maxVal(callToTask_s00002954_inputCriterion_s00001053_used)<=2 & [maxVal(callToProcess_s00002943_output_s00001077)<=2 & maxVal(decision_s00001840_activated)<=3]] & [maxVal(callToTask_s00002959_output_s00001054)<=1 & maxVal(callToTask_s00002954_input_s00001052)<=3]]
normalized: [[maxVal(callToTask_s00002959_output_s00001054)<=1 & maxVal(callToTask_s00002954_input_s00001052)<=3] & [maxVal(callToTask_s00002954_inputCriterion_s00001053_used)<=2 & [maxVal(callToProcess_s00002943_output_s00001077)<=2 & maxVal(decision_s00001840_activated)<=3]]]

abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(callToTask_s00002961_input_s00001066)<=2 & [[maxVal(callToProcess_s00002499_input_s00001066)<=3 & [maxVal(callToTask_s00002952_output_s00001077)<=1 & maxVal(callToTask_s00002870_output_s00001054)<=1]] & [maxVal(callToProcess_s00002499_input_s00001052)<=2 & maxVal(callToProcess_s00002943_output_s00001077)<=3]]]
normalized: [maxVal(callToTask_s00002961_input_s00001066)<=2 & [[maxVal(callToProcess_s00002499_input_s00001066)<=3 & [maxVal(callToTask_s00002952_output_s00001077)<=1 & maxVal(callToTask_s00002870_output_s00001054)<=1]] & [maxVal(callToProcess_s00002499_input_s00001052)<=2 & maxVal(callToProcess_s00002943_output_s00001077)<=3]]]

abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(decision_s00002055_input_s00001066)<=2 & maxVal(callToTask_s00002954_output_s00001077)<=2] & [[[maxVal(callToTask_s00002962_output_s00001054)<=1 & [[maxVal(callToTask_s00002959_input_s00001052)<=1 & maxVal(callToTask_s00002930_output_s00001077)<=3] & maxVal(callToTask_s00002931_output_s00001077)<=1]] & maxVal(callToTask_s00002954_output_s00001077)<=3] & maxVal(callToTask_s00002044_inputCriterion_s00001053_used)<=2]]
normalized: [[maxVal(callToTask_s00002044_inputCriterion_s00001053_used)<=2 & [maxVal(callToTask_s00002954_output_s00001077)<=3 & [maxVal(callToTask_s00002962_output_s00001054)<=1 & [maxVal(callToTask_s00002931_output_s00001077)<=1 & [maxVal(callToTask_s00002959_input_s00001052)<=1 & maxVal(callToTask_s00002930_output_s00001077)<=3]]]]] & [maxVal(decision_s00002055_input_s00001066)<=2 & maxVal(callToTask_s00002954_output_s00001077)<=2]]

abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 2,482 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[maxVal(callToProcess_s00002882_inputCriterion_s00001053_used)<=3 & maxVal(callToTask_s00002869_inputCriterion_s00001053_used)<=1] & maxVal(decision_s00001123_input_s00001066)<=2] & maxVal(callToTask_s00001168_inputCriterion_s00001053_used)<=1]
normalized: [maxVal(callToTask_s00001168_inputCriterion_s00001053_used)<=1 & [maxVal(decision_s00001123_input_s00001066)<=2 & [maxVal(callToProcess_s00002882_inputCriterion_s00001053_used)<=3 & maxVal(callToTask_s00002869_inputCriterion_s00001053_used)<=1]]]

abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=2) states: 2,482 (3)
abstracting: (0<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(callToProcess_s00002499_output_s00001083)<=3 & maxVal(callToTask_s00002951_input_s00001066)<=1] & maxVal(callToTask_s00002931_inputCriterion_s00001053_used)<=1] & maxVal(callToTask_s00002956_output_s00001054)<=3] & maxVal(callToTask_s00002961_inputCriterion_s00001053_used)<=1]
normalized: [maxVal(callToTask_s00002961_inputCriterion_s00001053_used)<=1 & [maxVal(callToTask_s00002956_output_s00001054)<=3 & [maxVal(callToTask_s00002931_inputCriterion_s00001053_used)<=1 & [maxVal(callToProcess_s00002499_output_s00001083)<=3 & maxVal(callToTask_s00002951_input_s00001066)<=1]]]]

abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
abstracting: (1<=3) states: 2,482 (3)
abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,482 (3)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433633156584

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


iterations count:981 (5), effective:161 (0)

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="IBM319-PT-none"
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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 IBM319-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 r232su-smll-143354324700047"
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 ;