Introduction
This page shows the outputs produced by the execution of marcie on SimpleLoadBal/02 (P/T). We provide:
- A short summary,
- the execution chart (evolution of CPU and memory over the execution),
- the sequence of actions to be executed by the VM,
- the results of these actions.
About the Execution
Execution Summary | |||
Memory (MB) | CPU (s) | End | |
662.28 | 0.56 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
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.
export BK_INPUT=SimpleLoadBal-PT-02
export BK_EXAMINATION=ReachabilityDeadlock
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1651
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is SimpleLoadBal-PT-02, examination is ReachabilityDeadlock'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh
Execution Outputs of marcie for SimpleLoadBal/02 (P/T)
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
execution on node 29: cluster1u31.lip6.fr (runId=136983929801140_n_29)
=====================================================================
runnning marcie on SimpleLoadBal-PT-02 (ReachabilityDeadlock)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is SimpleLoadBal-PT-02, examination is ReachabilityDeadlock
=====================================================================
--------------------
content from stdout:
START 1369863003
Marcie rev. 1103M (build: rohrch on 2013-02-17)
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 --mem=4 --mcc-file=ReachabilityDeadlock.txt
constant oo registered with value < INFINITY >
parse successfull!
(NrP: 32 NrTr: 45)
net check time: 0m0sec
parse mcc successfull!
place and transition orderings generation:0m0sec
init dd package: 0m1sec
RS generation: 0m0sec
-> reachability set: #nodes 576 (5.8e+02) #states 832
starting CTL model checker
--------------------------
checking: AG [~ [AX [true]]]
normalized: ~ [E [true U ~ [EX [false]]]]
.-> the formula is FALSE
FORMULA p_1_deadlock FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: ~ [EF [~ [AX [true]]]]
normalized: ~ [E [true U EX [false]]]
.-> the formula is TRUE
FORMULA p_47_deadlock TRUE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
total processing time: 0m1sec
STOP 1369863005
--------------------
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
595
iterations count:1158 (25), effective:121 (2)
initing FirstDep: 0m0sec
iterations count:45 (1), effective:0 (0)
--------------------
content from /tmp/BenchKit_head_log_file.1651: