About the Execution of MARCIE for IBMB2S565S3960-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8025.840 | 242596.00 | 242010.00 | 20.00 | 3 7 2 7 3 7 2 7 7 7 7 7 2 3 7 3 | normal |
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-3254
Executing tool marcie
Input is IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800092
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-0
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-1
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-10
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-11
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-12
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-13
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-14
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-15
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-2
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-3
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-4
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-5
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-6
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-7
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-8
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1494452233761
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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=UpperBounds.xml --memory=6
parse successfull
net created successfully
Net: IBMB2S565S3960_PT_none
(NrP: 273 NrTr: 179 NrArc: 572)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.023sec
net check time: 0m 0.000sec
init dd package: 0m 1.167sec
RS generation: 0m 0.011sec
-> last computed set: #nodes 43 (4.3e+01) #states 28
parse successfull
net created successfully
Net: IBMB2S565S3960_PT_none
(NrP: 273 NrTr: 179 NrArc: 572)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.023sec
net check time: 0m 0.000sec
init dd package: 0m 3.658sec
RS generation: 3m46.982sec
-> reachability set: #nodes 3663978 (3.7e+06) #states 15,510,635,947,410,534 (16)
starting MCC model checker
--------------------------
checking: place_bound(decision_s00002762_activated)
normalized: place_bound(decision_s00002762_activated)
-> the formula is 3
FORMULA IBMB2S565S3960-PT-none-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: place_bound(callToTask_s00003980_output_s00001080)
normalized: place_bound(callToTask_s00003980_output_s00001080)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-1 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003975_output_s00001077)
normalized: place_bound(callToTask_s00003975_output_s00001077)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-2 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003962_input_s00001066)
normalized: place_bound(callToTask_s00003962_input_s00001066)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-3 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(merge_s00001161_input_s00001129)
normalized: place_bound(merge_s00001161_input_s00001129)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-4 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(merge_s00001161_input_s00001052)
normalized: place_bound(merge_s00001161_input_s00001052)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-5 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToProcess_s00003904_input_s00001052)
normalized: place_bound(callToProcess_s00003904_input_s00001052)
-> the formula is 2
FORMULA IBMB2S565S3960-PT-none-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003967_inputCriterion_s00001053_used)
normalized: place_bound(callToTask_s00003967_inputCriterion_s00001053_used)
-> the formula is 3
FORMULA IBMB2S565S3960-PT-none-UpperBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(fork_s00001298_input_s00001068)
normalized: place_bound(fork_s00001298_input_s00001068)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-8 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(fork_s00001403_activated_s00001075)
normalized: place_bound(fork_s00001403_activated_s00001075)
-> the formula is 3
FORMULA IBMB2S565S3960-PT-none-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(endNode_s00001402_input_default)
normalized: place_bound(endNode_s00001402_input_default)
-> the formula is 2
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003973_output_s00001054)
normalized: place_bound(callToTask_s00003973_output_s00001054)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003981_input_s00001068)
normalized: place_bound(callToTask_s00003981_input_s00001068)
-> the formula is 3
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003913_inputCriterion_s00001053_used)
normalized: place_bound(callToTask_s00003913_inputCriterion_s00001053_used)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToProcess_s00003904_input_s00001052)
normalized: place_bound(callToProcess_s00003904_input_s00001052)
-> the formula is 2
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(callToTask_s00003972_inputCriterion_s00001053_used)
normalized: place_bound(callToTask_s00003972_inputCriterion_s00001053_used)
-> the formula is 7
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 5895445 (5.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 133260565 241997204 375257769
used/not used/entry size/cache size: 65255896 1852968 16 1024MB
basic ops cache: hits/miss/sum: 2699189 5093689 7792878
used/not used/entry size/cache size: 5439354 11337862 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2155742 3670752 5826494
used/not used/entry size/cache size: 2983328 5405280 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61846684
1 4713250
2 476824
3 62690
4 7754
5 1091
6 343
7 153
8 44
9 5
>= 10 26
Total processing time: 4m 2.071sec
BK_STOP 1494452476357
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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
zbdd.cc:1122: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
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.001sec
iterations count:8863 (49), effective:1374 (7)
initing FirstDep: 0m 0.000sec
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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is IBMB2S565S3960-PT-none, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r031-blw7-149440473800092"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
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 ;