Introduction

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=PhilosophersDyn-PT-03
export BK_EXAMINATION=CTLMarkingComparison
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1654
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is PhilosophersDyn-PT-03, examination is CTLMarkingComparison'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh

Execution Outputs of marcie for PhilosophersDyn/03 (P/T)

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

execution on node 25: cluster1u27.lip6.fr (runId=136972135800902_n_25)
=====================================================================
runnning marcie on PhilosophersDyn-PT-03 (CTLMarkingComparison)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is PhilosophersDyn-PT-03, examination is CTLMarkingComparison
=====================================================================

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

START 1369742683

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=CTLMarkingComparison.txt

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 60 NrTr: 330)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m1sec


RS generation: 0m1sec


-> reachability set: #nodes 23114 (2.3e+04) #states 7,251 (3)



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

checking: EF [[[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]] & [Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]]]]
normalized: E [true U [[[[true & 1.000000000000000!=Forks_1] & Forks_2!=0.000000000000000] & Forks_3!=0.000000000000000] & [[[true & 1.000000000000000!=WaitLeft_2] & WaitLeft_3!=0.000000000000000] & WaitLeft_1!=0.000000000000000]]]

-> the formula is FALSE

FORMULA p_1866_markingcomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [[[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]] | [Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]]]]
normalized: EG [[[[[true & 1.000000000000000!=WaitLeft_2] & WaitLeft_3!=0.000000000000000] & WaitLeft_1!=0.000000000000000] | [[[true & 1.000000000000000!=Forks_1] & Forks_2!=0.000000000000000] & Forks_3!=0.000000000000000]]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1867_markingcomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EF [[~ [[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]] & [Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]]]]
normalized: E [true U [[[[true & 1.000000000000000!=Forks_1] & Forks_2!=0.000000000000000] & Forks_3!=0.000000000000000] & ~ [[WaitLeft_1!=0.000000000000000 & [[true & 1.000000000000000!=WaitLeft_2] & WaitLeft_3!=0.000000000000000]]]]]

-> the formula is FALSE

FORMULA p_1868_markingcomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AF [[~ [[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]] | [Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]]]]
normalized: ~ [EG [~ [[[Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]] | ~ [[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]]]]]]

.
EG iterations: 1
-> the formula is TRUE

FORMULA p_1869_markingcomparison_eq_or_notx TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [EF [[~ [[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]] xor [Forks_3!=0.000000000000000 & [Forks_2!=0.000000000000000 & [1.000000000000000!=Forks_1 & true]]]]]]
normalized: EG [E [true U [[[[[true & 1.000000000000000!=Forks_1] & Forks_2!=0.000000000000000] & Forks_3!=0.000000000000000] & [WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]] | [~ [[WaitLeft_1!=0.000000000000000 & [WaitLeft_3!=0.000000000000000 & [1.000000000000000!=WaitLeft_2 & true]]]] & ~ [[[[true & 1.000000000000000!=Forks_1] & Forks_2!=0.000000000000000] & Forks_3!=0.000000000000000]]]]]]


EG iterations: 0
-> the formula is TRUE

FORMULA p_1870_markingcomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[[Neighbourhood_3_3!=0.000000000000000 & [Neighbourhood_2_1!=0.000000000000000 & [Neighbourhood_3_2!=0.000000000000000 & [Neighbourhood_1_1!=0.000000000000000 & [Neighbourhood_3_1!=0.000000000000000 & [Neighbourhood_2_2!=0.000000000000000 & [Neighbourhood_1_2!=0.000000000000000 & [Neighbourhood_1_3!=0.000000000000000 & [1.000000000000000!=Neighbourhood_2_3 & true]]]]]]]]] & [[1.000000000000000>WaitLeft_1 & true] & [WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]]]]]
normalized: ~ [E [true U ~ [[[Neighbourhood_3_3!=0.000000000000000 & [Neighbourhood_2_1!=0.000000000000000 & [Neighbourhood_3_2!=0.000000000000000 & [Neighbourhood_1_1!=0.000000000000000 & [Neighbourhood_3_1!=0.000000000000000 & [Neighbourhood_2_2!=0.000000000000000 & [Neighbourhood_1_2!=0.000000000000000 & [Neighbourhood_1_3!=0.000000000000000 & [1.000000000000000!=Neighbourhood_2_3 & true]]]]]]]]] & [[WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]] & [1.000000000000000>WaitLeft_1 & true]]]]]]

-> the formula is FALSE

FORMULA p_1871_markingcomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[[[1.000000000000000>WaitLeft_1 & true] & [WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]]] | [[Neighbourhood_2_1!=0.000000000000000 & [Neighbourhood_3_2!=0.000000000000000 & [[Neighbourhood_3_1!=0.000000000000000 & [[Neighbourhood_1_2!=0.000000000000000 & [Neighbourhood_1_3!=0.000000000000000 & [1.000000000000000!=Neighbourhood_2_3 & true]]] & Neighbourhood_2_2!=0.000000000000000]] & Neighbourhood_1_1!=0.000000000000000]]] & Neighbourhood_3_3!=0.000000000000000]]]
normalized: ~ [E [true U ~ [[[[WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]] & [1.000000000000000>WaitLeft_1 & true]] | [[[Neighbourhood_3_2!=0.000000000000000 & [Neighbourhood_1_1!=0.000000000000000 & [Neighbourhood_3_1!=0.000000000000000 & [[Neighbourhood_1_2!=0.000000000000000 & [Neighbourhood_1_3!=0.000000000000000 & [1.000000000000000!=Neighbourhood_2_3 & true]]] & Neighbourhood_2_2!=0.000000000000000]]]] & Neighbourhood_2_1!=0.000000000000000] & Neighbourhood_3_3!=0.000000000000000]]]]]

-> the formula is FALSE

FORMULA p_1872_markingcomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EF [[[[WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]] & [1.000000000000000>WaitLeft_1 & true]] & [[Neighbourhood_2_1!=0.000000000000000 & [Neighbourhood_3_2!=0.000000000000000 & [[[Neighbourhood_2_2!=0.000000000000000 & [[[true & 1.000000000000000!=Neighbourhood_2_3] & Neighbourhood_1_3!=0.000000000000000] & Neighbourhood_1_2!=0.000000000000000]] & Neighbourhood_3_1!=0.000000000000000] & Neighbourhood_1_1!=0.000000000000000]]] & Neighbourhood_3_3!=0.000000000000000]]]
normalized: E [true U [[Neighbourhood_3_3!=0.000000000000000 & [Neighbourhood_2_1!=0.000000000000000 & [[[[Neighbourhood_2_2!=0.000000000000000 & [Neighbourhood_1_2!=0.000000000000000 & [Neighbourhood_1_3!=0.000000000000000 & [1.000000000000000!=Neighbourhood_2_3 & true]]]] & Neighbourhood_3_1!=0.000000000000000] & Neighbourhood_1_1!=0.000000000000000] & Neighbourhood_3_2!=0.000000000000000]]] & [[true & 1.000000000000000>WaitLeft_1] & [WaitLeft_3=0.000000000000000 & [WaitLeft_2=0.000000000000000 & true]]]]]

-> the formula is FALSE

FORMULA p_1873_markingcomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m5sec

STOP 1369742688

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

801 1739 2418 2739 3364 3400 3606 3925 5280 5869 6115 7039 7041 7557 7437 7608 7780 9487 10273 10897 11437 11547 11827 12964 13629 14319 15130 15596 15681 16132 16917 17264 17488 18076 18210 18569 19406 19697 20239 20426 20980 21737 21996 22251 22488 22629 22954 23217 23114
iterations count:49042 (148), effective:545 (1)

initing FirstDep: 0m0sec


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

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

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

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