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

Execution Outputs of marcie for FMS/100 (P/T)

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

execution on node 41: cluster1u43.lip6.fr (runId=136946434200846_n_41)
=====================================================================
runnning marcie on FMS-PT-100 (ReachabilityPlaceComparison)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is FMS-PT-100, examination is ReachabilityPlaceComparison
=====================================================================

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

START 1369473690

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 22 NrTr: 20)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m1sec


before gc: list nodes free: 3895182

after gc: idd nodes used:358802, unused:15641198; list nodes free:230156089

RS generation: 24m22sec


-> reachability set: #nodes 118181 (1.2e+05) #states 2,703,057,272,484,320,385,816 (21)



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

checking: AG [[M3!=P12M3 & P2wM2=P1wP2]]
normalized: ~ [E [true U ~ [[M3!=P12M3 & P2wM2=P1wP2]]]]

-> the formula is FALSE

FORMULA p_7_placecomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m10sec

checking: AG [[M3!=P12M3 | P2wM2=P1wP2]]
normalized: ~ [E [true U ~ [[M3!=P12M3 | P2wM2=P1wP2]]]]

-> the formula is FALSE

FORMULA p_8_placecomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[M3!=P12M3 & P2wM2=P1wP2]]
normalized: ~ [E [true U ~ [[M3!=P12M3 & P2wM2=P1wP2]]]]

-> the formula is FALSE

FORMULA p_9_placecomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[M3!=P12M3 | P2wM2=P1wP2]]
normalized: ~ [E [true U ~ [[M3!=P12M3 | P2wM2=P1wP2]]]]

-> the formula is FALSE

FORMULA p_10_placecomparison_eq_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P2wM2=P1wP2 -> ~ [M3!=P12M3]]]
normalized: ~ [E [true U ~ [[~ [M3!=P12M3] | ~ [P2wM2=P1wP2]]]]]

-> the formula is TRUE

FORMULA p_11_placecomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P1s>P2d & P2wM2>P1wM1]]
normalized: ~ [E [true U ~ [[P1s>P2d & P2wM2>P1wM1]]]]

-> the formula is FALSE

FORMULA p_12_placecomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P1s>P2d | P2wM2>P1wM1]]
normalized: ~ [E [true U ~ [[P1s>P2d | P2wM2>P1wM1]]]]

-> the formula is FALSE

FORMULA p_13_placecomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [P1s>P2d] & P2wM2>P1wM1]]
normalized: ~ [E [true U ~ [[P2wM2>P1wM1 & ~ [P1s>P2d]]]]]

-> the formula is FALSE

FORMULA p_14_placecomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 25m20sec

STOP 1369475211

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

1874 1364 31890 249035 317921 210798 118058
iterations count:7620 (381), effective:1700 (85)

initing FirstDep: 0m0sec


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

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

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

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

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

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

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

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