fond
Model Checking Contest @ Petri Nets 2013
Milano, Italy, June 25, 2013
marcie: ReachabilityDeadlock on Philosophers/000005 (P/T)
Last Updated
Apr. 26, 2013

Introduction

This page shows the outputs produced by the execution of marcie on Philosophers/000005 (P/T). We provide:

About the Execution

Execution Summary
Memory (MB) CPU (s) End
662.41 2.11 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=Philosophers-PT-000005
export BK_EXAMINATION=ReachabilityDeadlock
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1652
export BIN_DIR=/home/mcc/BenchKit/bin
BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is Philosophers-PT-000005, examination is ReachabilityDeadlock'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo 'START 1369688260'

Execution Outputs of marcie for Philosophers/000005 (P/T)

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.


execution on node 2: quadhexa-2.u-paris10.fr (runId=136968524300038_n_2)
=====================================================================
runnning marcie on Philosophers-PT-000005 (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 Philosophers-PT-000005, examination is ReachabilityDeadlock
=====================================================================

--------------------
content from stdout:

START 1369688260

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: 25 NrTr: 25)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 110 (1.1e+02) #states 243



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: 0m6sec

STOP 1369688267

--------------------
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:107 (4), effective:15 (0)

initing FirstDep: 0m0sec


iterations count:25 (1), effective:0 (0)

--------------------
content from /tmp/BenchKit_head_log_file.1652: