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

Execution Outputs of marcie for Peterson/2 (P/T)

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

execution on node 30: cluster1u32.lip6.fr (runId=136966892501303_n_30)
=====================================================================
runnning marcie on Peterson-PT-2 (ReachabilityMix)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is Peterson-PT-2, examination is ReachabilityMix
=====================================================================

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

START 1369683200

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 102 NrTr: 126)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m1sec


RS generation: 0m0sec


-> reachability set: #nodes 2615 (2.6e+03) #states 20,754 (4)



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

checking: AG [[["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]] & [["IsEndLoop_2_0_2" \in [1, oo) | [[["IsEndLoop_2_1_2" \in [1, oo) | "IsEndLoop_1_1_2" \in [1, oo)] | "IsEndLoop_1_0_2" \in [1, oo)] | "IsEndLoop_0_0_2" \in [1, oo)]] | "IsEndLoop_0_1_2" \in [1, oo)]]]
normalized: ~ [E [true U ~ [[["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]] & [["IsEndLoop_2_0_2" \in [1, oo) | [[["IsEndLoop_2_1_2" \in [1, oo) | "IsEndLoop_1_1_2" \in [1, oo)] | "IsEndLoop_1_0_2" \in [1, oo)] | "IsEndLoop_0_0_2" \in [1, oo)]] | "IsEndLoop_0_1_2" \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_37_mix_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[[[[["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]] | "IsEndLoop_0_0_2" \in [1, oo)] | "IsEndLoop_2_0_2" \in [1, oo)] | "IsEndLoop_0_1_2" \in [1, oo)] | ["EndTurn_1_1" \in [1, oo) | ["EndTurn_0_1" \in [1, oo) | "EndTurn_2_1" \in [1, oo)]]]]
normalized: ~ [E [true U ~ [[[[[["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]] | "IsEndLoop_0_0_2" \in [1, oo)] | "IsEndLoop_2_0_2" \in [1, oo)] | "IsEndLoop_0_1_2" \in [1, oo)] | [["EndTurn_0_1" \in [1, oo) | "EndTurn_2_1" \in [1, oo)] | "EndTurn_1_1" \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_38_mix_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [[[["IsEndLoop_0_0_2" \in [1, oo) | ["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]]] | "IsEndLoop_2_0_2" \in [1, oo)] | "IsEndLoop_0_1_2" \in [1, oo)]] & ~ [[["EndTurn_0_1" \in [1, oo) | "EndTurn_2_1" \in [1, oo)] | "EndTurn_1_1" \in [1, oo)]]]]
normalized: ~ [E [true U ~ [[~ [[[["IsEndLoop_0_0_2" \in [1, oo) | ["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]]] | "IsEndLoop_2_0_2" \in [1, oo)] | "IsEndLoop_0_1_2" \in [1, oo)]] & ~ [[["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)] | "EndTurn_1_1" \in [1, oo)]]]]]]

-> the formula is FALSE

FORMULA p_39_mix_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [["IsEndLoop_0_1_2" \in [1, oo) | ["IsEndLoop_2_0_2" \in [1, oo) | [[["IsEndLoop_2_1_2" \in [1, oo) | "IsEndLoop_1_1_2" \in [1, oo)] | "IsEndLoop_1_0_2" \in [1, oo)] | "IsEndLoop_0_0_2" \in [1, oo)]]]] | ~ [["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]]]]]
normalized: ~ [E [true U ~ [[~ [["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]]] | ~ [[[["IsEndLoop_0_0_2" \in [1, oo) | ["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]]] | "IsEndLoop_2_0_2" \in [1, oo)] | "IsEndLoop_0_1_2" \in [1, oo)]]]]]]

-> the formula is TRUE

FORMULA p_40_mix_eq_or_notx TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[["IsEndLoop_0_1_2" \in [1, oo) | ["IsEndLoop_2_0_2" \in [1, oo) | ["IsEndLoop_0_0_2" \in [1, oo) | [["IsEndLoop_2_1_2" \in [1, oo) | "IsEndLoop_1_1_2" \in [1, oo)] | "IsEndLoop_1_0_2" \in [1, oo)]]]] xor [["EndTurn_0_1" \in [1, oo) | "EndTurn_2_1" \in [1, oo)] | "EndTurn_1_1" \in [1, oo)]]]
normalized: ~ [E [true U ~ [[[["IsEndLoop_0_1_2" \in [1, oo) | [[["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]] | "IsEndLoop_0_0_2" \in [1, oo)] | "IsEndLoop_2_0_2" \in [1, oo)]] & ~ [["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]]]] | [~ [["IsEndLoop_0_1_2" \in [1, oo) | [[["IsEndLoop_1_0_2" \in [1, oo) | ["IsEndLoop_1_1_2" \in [1, oo) | "IsEndLoop_2_1_2" \in [1, oo)]] | "IsEndLoop_0_0_2" \in [1, oo)] | "IsEndLoop_2_0_2" \in [1, oo)]]] & ["EndTurn_1_1" \in [1, oo) | ["EndTurn_2_1" \in [1, oo) | "EndTurn_0_1" \in [1, oo)]]]]]]]

-> the formula is FALSE

FORMULA p_41_mix_eq_x FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo)]] & [[true & [[[true & Idle_1>CS_1] & Idle_0>CS_0] & Idle_2>CS_2]] & [[[Idle_0>CS_0 | [false | Idle_1>CS_1]] | Idle_2>CS_2] | false]]]]
normalized: ~ [E [true U ~ [[[[false | [Idle_2>CS_2 | [Idle_0>CS_0 | [Idle_1>CS_1 | false]]]] & [[Idle_2>CS_2 & [Idle_0>CS_0 & [Idle_1>CS_1 & true]]] & true]] & [["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | "WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo)] | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_42_mix_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | ["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | "WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo)]] | [[[[[Idle_1>CS_1 & true] & Idle_0>CS_0] & Idle_2>CS_2] & true] & [[[[false | Idle_1>CS_1] | Idle_0>CS_0] | Idle_2>CS_2] | false]]]]
normalized: ~ [E [true U ~ [[[[false | [Idle_2>CS_2 | [Idle_0>CS_0 | [Idle_1>CS_1 | false]]]] & [true & [Idle_2>CS_2 & [Idle_0>CS_0 & [Idle_1>CS_1 & true]]]]] | [["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo)] | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_43_mix_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [[[true & [[[true & Idle_1>CS_1] & Idle_0>CS_0] & Idle_2>CS_2]] & [[[Idle_0>CS_0 | [false | Idle_1>CS_1]] | Idle_2>CS_2] | false]]] & [["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo)] | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]]
normalized: ~ [E [true U ~ [[["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | ["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | "WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo)]] & ~ [[[false | [Idle_2>CS_2 | [Idle_0>CS_0 | [Idle_1>CS_1 | false]]]] & [[Idle_2>CS_2 & [Idle_0>CS_0 & [Idle_1>CS_1 & true]]] & true]]]]]]]

-> the formula is FALSE

FORMULA p_44_mix_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m3sec

STOP 1369683203

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

758 1244 1679 1685 2305 2516
iterations count:6277 (49), effective:549 (4)

initing FirstDep: 0m0sec


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

iterations count:327 (2), effective:9 (0)
2622 3013 3298 2995 3306 2868
iterations count:6283 (49), effective:355 (2)

iterations count:327 (2), effective:9 (0)

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

iterations count:168 (1), effective:3 (0)

iterations count:168 (1), effective:3 (0)

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