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

Introduction

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

About the Execution

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

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

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


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

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

START 1369687196

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

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m20sec

init dd package: 0m5sec


before gc: list nodes free: 879186

after gc: idd nodes used:12326, unused:15987674; list nodes free:71224987

RS generation: 1m46sec


-> reachability set: #nodes 25980 (2.6e+04) #states 1,322,070,819,480,806,636,890,455,259,752,144,365,965,422,032,752,148,167,664,920,368,226,828,597,346,704,899,540,778,313,850,608,061,963,909,777,696,872,582,355,950,954,582,100,618,911,865,342,725,257,953,674,027,620,225,198,320,803,878,014,774,228,964,841,274,390,400,117,588,618,041,128,947,815,623,094,438,061,566,173,054,086,674,490,506,178,125,480,344,405,547,054,397,038,895,817,465,368,254,916,136,220,830,268,563,778,582,290,228,416,398,307,887,896,918,556,404,084,898,937,609,373,242,171,846,359,938,695,516,765,018,940,588,109,060,426,089,671,438,864,102,814,350,385,648,747,165,832,010,614,366,132,173,102,768,902,855,220,001 (477)



before gc: list nodes free: 1037108

after gc: idd nodes used:54910, unused:15945090; list nodes free:71019246

before gc: list nodes free: 1096974

after gc: idd nodes used:51179, unused:15948821; list nodes free:71035130

starting CTL model checker
--------------------------


before gc: list nodes free: 1086758

after gc: idd nodes used:55689, unused:15944311; list nodes free:71015897

before gc: list nodes free: 1098041

after gc: idd nodes used:52369, unused:15947631; list nodes free:71029997
checking: AG [~ [AX [true]]]
normalized: ~ [E [true U ~ [EX [false]]]]

.-> the formula is FALSE

FORMULA p_1_deadlock FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 3m13sec

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: 11m7sec

STOP 1369687864

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

5593 6037 6481 6926 7369 7814 8257 8702 9149 9593 17700 17700 17700 17740 18184 18628 20619 21016 21459 21904 22347 25659
iterations count:22993 (4), effective:3000 (0)

initing FirstDep: 0m0sec

25980 25980 25980 25980 25980
iterations count:5000 (1), effective:0 (0)

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