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=RessAllocation-PT-R003C050
export BK_EXAMINATION=ReachabilityFireability
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/RessAllocation-PT-R003C050
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is RessAllocation-PT-R003C050, examination is ReachabilityFireability'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh

Execution Outputs of marcie for RessAllocation/R003C050 (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=136978024400038_n_2)
=====================================================================
runnning marcie on RessAllocation-PT-R003C050 (ReachabilityFireability)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is RessAllocation-PT-R003C050, examination is ReachabilityFireability
=====================================================================

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

START 1369781768

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 300 NrTr: 200)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 2056 (2.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

checking: AG [["r_23_0" \in [1, oo) && "r_24_0" \in [1, oo) & "r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)]]
normalized: ~ [E [true U ~ [["r_35_0" \in [1, oo) && "r_36_0" \in [1, oo) & "r_23_0" \in [1, oo) && "r_24_0" \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_2_fireability_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [["r_35_0" \in [1, oo) && "r_36_0" \in [1, oo) | "r_24_0" \in [1, oo) && "r_23_0" \in [1, oo)]]
normalized: ~ [E [true U ~ [["r_24_0" \in [1, oo) && "r_23_0" \in [1, oo) | "r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_3_fireability_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [["r_24_0" \in [1, oo) && "r_23_0" \in [1, oo) & "r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)]]
normalized: ~ [E [true U ~ [["r_24_0" \in [1, oo) && "r_23_0" \in [1, oo) & "r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_4_fireability_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [["r_36_0" \in [1, oo) && "r_35_0" \in [1, oo) | "r_23_0" \in [1, oo) && "r_24_0" \in [1, oo)]]
normalized: ~ [E [true U ~ [["r_23_0" \in [1, oo) && "r_24_0" \in [1, oo) | "r_36_0" \in [1, oo) && "r_35_0" \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_5_fireability_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [["r_24_0" \in [1, oo) && "r_23_0" \in [1, oo) <-> ~ ["r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)]]]
normalized: ~ [E [true U ~ [[[! ("r_24_0" \in [1, oo) && "r_23_0" \in [1, oo)) & "r_35_0" \in [1, oo) && "r_36_0" \in [1, oo)] | ["r_24_0" \in [1, oo) && "r_23_0" \in [1, oo) & ! ("r_35_0" \in [1, oo) && "r_36_0" \in [1, oo))]]]]]

-> the formula is FALSE

FORMULA p_6_fireability_x FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: ~ [EF [["r_6_0" \in [1, oo) && "p_7_1" \in [1, oo) && "r_7_0" \in [1, oo) & "r_12_1" \in [1, oo) && "p_13_2" \in [1, oo) && "r_13_1" \in [1, oo)]]]
normalized: ~ [E [true U ["p_13_2" \in [1, oo) && "r_13_1" \in [1, oo) && "r_12_1" \in [1, oo) & "p_7_1" \in [1, oo) && "r_7_0" \in [1, oo) && "r_6_0" \in [1, oo)]]]

-> the formula is FALSE

FORMULA p_38_fireability_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: ~ [EF [["r_7_0" \in [1, oo) && "p_7_1" \in [1, oo) && "r_6_0" \in [1, oo) | "r_12_1" \in [1, oo) && "p_13_2" \in [1, oo) && "r_13_1" \in [1, oo)]]]
normalized: ~ [E [true U ["p_13_2" \in [1, oo) && "r_13_1" \in [1, oo) && "r_12_1" \in [1, oo) | "r_7_0" \in [1, oo) && "p_7_1" \in [1, oo) && "r_6_0" \in [1, oo)]]]

-> the formula is FALSE

FORMULA p_39_fireability_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: ~ [EF [["r_12_1" \in [1, oo) && "p_13_2" \in [1, oo) && "r_13_1" \in [1, oo) & "r_6_0" \in [1, oo) && "p_7_1" \in [1, oo) && "r_7_0" \in [1, oo)]]]
normalized: ~ [E [true U ["p_7_1" \in [1, oo) && "r_7_0" \in [1, oo) && "r_6_0" \in [1, oo) & "r_12_1" \in [1, oo) && "p_13_2" \in [1, oo) && "r_13_1" \in [1, oo)]]]

-> the formula is FALSE

FORMULA p_40_fireability_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m9sec

STOP 1369781778

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

1458
iterations count:1526 (7), effective:300 (1)

initing FirstDep: 0m0sec


iterations count:262 (1), effective:10 (0)

iterations count:324 (1), effective:20 (0)

iterations count:262 (1), effective:10 (0)

iterations count:324 (1), effective:20 (0)

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

iterations count:365 (1), effective:24 (0)

iterations count:365 (1), effective:24 (0)

iterations count:365 (1), effective:24 (0)

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