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

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

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

execution on node 4: quadhexa-2.u-paris10.fr (runId=136955389700120_n_4)
=====================================================================
runnning marcie on LamportFastMutEx-PT-2 (CTLPlaceComparison)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is LamportFastMutEx-PT-2, examination is CTLPlaceComparison
=====================================================================

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

START 1369577003

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 69 NrTr: 96)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 621 (6.2e+02) #states 380



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

checking: EG [[[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [[[wait_1_1!=done_1_1 & [[[[true & wait_0_0!=done_0_0] & wait_0_1!=done_0_1] & wait_0_2!=done_0_2] & wait_2_1!=done_2_1]] & wait_1_0!=done_1_0] & wait_1_2!=done_1_2]]] & [[[setbi_11_0=ifyi_15_0 & true] & setbi_11_2=ifyi_15_2] & setbi_11_1=ifyi_15_1]]]
normalized: EG [[[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [wait_0_1!=done_0_1 & [wait_0_0!=done_0_0 & true]]]]]]]]] & [setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [setbi_11_0=ifyi_15_0 & true]]]]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1846_placecomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[[[[[[[[[wait_0_1!=done_0_1 & [wait_0_0!=done_0_0 & true]] & wait_0_2!=done_0_2] & wait_2_1!=done_2_1] & wait_1_1!=done_1_1] & wait_1_0!=done_1_0] & wait_1_2!=done_1_2] & wait_2_2!=done_2_2] & wait_2_0!=done_2_0] | [setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [true & setbi_11_0=ifyi_15_0]]]]]
normalized: ~ [E [true U ~ [[[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [setbi_11_0=ifyi_15_0 & true]]] | [wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [wait_0_1!=done_0_1 & [wait_0_0!=done_0_0 & true]]]]]]]]]]]]]

-> the formula is FALSE

FORMULA p_1847_placecomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AF [[~ [[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [true & setbi_11_0=ifyi_15_0]]]] & [wait_2_0!=done_2_0 & [[wait_1_2!=done_1_2 & [[[[[[true & wait_0_0!=done_0_0] & wait_0_1!=done_0_1] & wait_0_2!=done_0_2] & wait_2_1!=done_2_1] & wait_1_1!=done_1_1] & wait_1_0!=done_1_0]] & wait_2_2!=done_2_2]]]]
normalized: ~ [EG [~ [[[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [wait_0_1!=done_0_1 & [wait_0_0!=done_0_0 & true]]]]]]]]] & ~ [[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [setbi_11_0=ifyi_15_0 & true]]]]]]]]


EG iterations: 0
-> the formula is FALSE

FORMULA p_1848_placecomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EF [[~ [[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [setbi_11_0=ifyi_15_0 & true]]]] | [wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [[[wait_0_0!=done_0_0 & true] & wait_0_1!=done_0_1] & wait_0_2!=done_0_2]]]]]]]]]
normalized: E [true U [[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [[[wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [[wait_0_0!=done_0_0 & true] & wait_0_1!=done_0_1]]] & wait_1_1!=done_1_1] & wait_1_0!=done_1_0]]]] | ~ [[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [setbi_11_0=ifyi_15_0 & true]]]]]]

-> the formula is TRUE

FORMULA p_1849_placecomparison_eq_or_notx TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [EG [[[setbi_11_1=ifyi_15_1 & [setbi_11_2=ifyi_15_2 & [true & setbi_11_0=ifyi_15_0]]] -> ~ [[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [wait_0_1!=done_0_1 & [wait_0_0!=done_0_0 & true]]]]]]]]]]]]]
normalized: ~ [E [true U ~ [EG [[~ [[[[setbi_11_0=ifyi_15_0 & true] & setbi_11_2=ifyi_15_2] & setbi_11_1=ifyi_15_1]] | ~ [[wait_2_0!=done_2_0 & [wait_2_2!=done_2_2 & [wait_1_2!=done_1_2 & [wait_1_0!=done_1_0 & [wait_1_1!=done_1_1 & [wait_2_1!=done_2_1 & [wait_0_2!=done_0_2 & [wait_0_1!=done_0_1 & [true & wait_0_0!=done_0_0]]]]]]]]]]]]]]]


EG iterations: 0
-> the formula is TRUE

FORMULA p_1850_placecomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[[[[ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [ifyi_15_2>x_2 | false]]] | false] & [[ifyi_15_0>x_0 & [ifyi_15_1>x_1 & [ifyi_15_2>x_2 & true]]] & true]] & [true & [done_1_0<=wait_1_0 & [done_2_1<=wait_2_1 & [[[[done_1_1<=wait_1_1 & [done_0_2<=wait_0_2 & [done_1_2<=wait_1_2 & [done_2_0<=wait_2_0 & true]]]] & done_2_2<=wait_2_2] & done_0_0<=wait_0_0] & done_0_1<=wait_0_1]]]]]]
normalized: ~ [E [true U ~ [[[true & [done_1_0<=wait_1_0 & [done_2_1<=wait_2_1 & [done_0_1<=wait_0_1 & [done_0_0<=wait_0_0 & [done_2_2<=wait_2_2 & [done_1_1<=wait_1_1 & [done_0_2<=wait_0_2 & [done_1_2<=wait_1_2 & [done_2_0<=wait_2_0 & true]]]]]]]]]] & [[true & [ifyi_15_0>x_0 & [ifyi_15_1>x_1 & [ifyi_15_2>x_2 & true]]]] & [false | [ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [ifyi_15_2>x_2 | false]]]]]]]]]

-> the formula is FALSE

FORMULA p_1851_placecomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EF [[[[[done_2_1<=wait_2_1 & [done_0_1<=wait_0_1 & [done_0_0<=wait_0_0 & [[done_1_1<=wait_1_1 & [[done_1_2<=wait_1_2 & [done_2_0<=wait_2_0 & true]] & done_0_2<=wait_0_2]] & done_2_2<=wait_2_2]]]] & done_1_0<=wait_1_0] & true] | [[false | [ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [ifyi_15_2>x_2 | false]]]] & [true & [ifyi_15_0>x_0 & [[ifyi_15_2>x_2 & true] & ifyi_15_1>x_1]]]]]]
normalized: E [true U [[[[ifyi_15_0>x_0 & [ifyi_15_1>x_1 & [ifyi_15_2>x_2 & true]]] & true] & [[ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [ifyi_15_2>x_2 | false]]] | false]] | [true & [done_1_0<=wait_1_0 & [done_2_1<=wait_2_1 & [done_0_1<=wait_0_1 & [done_0_0<=wait_0_0 & [done_2_2<=wait_2_2 & [done_1_1<=wait_1_1 & [done_0_2<=wait_0_2 & [done_1_2<=wait_1_2 & [done_2_0<=wait_2_0 & true]]]]]]]]]]]]

-> the formula is FALSE

FORMULA p_1852_placecomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AF [[[[false | [ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [false | ifyi_15_2>x_2]]]] & [true & [ifyi_15_0>x_0 & [ifyi_15_1>x_1 & [true & ifyi_15_2>x_2]]]]] & [true & [[[[done_0_0<=wait_0_0 & [done_2_2<=wait_2_2 & [done_1_1<=wait_1_1 & [done_0_2<=wait_0_2 & [[done_2_0<=wait_2_0 & true] & done_1_2<=wait_1_2]]]]] & done_0_1<=wait_0_1] & done_2_1<=wait_2_1] & done_1_0<=wait_1_0]]]]
normalized: ~ [EG [~ [[[[done_1_0<=wait_1_0 & [done_2_1<=wait_2_1 & [done_0_1<=wait_0_1 & [done_0_0<=wait_0_0 & [done_2_2<=wait_2_2 & [done_1_1<=wait_1_1 & [done_0_2<=wait_0_2 & [done_1_2<=wait_1_2 & [done_2_0<=wait_2_0 & true]]]]]]]]] & true] & [[[ifyi_15_0>x_0 & [ifyi_15_1>x_1 & [ifyi_15_2>x_2 & true]]] & true] & [[ifyi_15_0>x_0 | [ifyi_15_1>x_1 | [ifyi_15_2>x_2 | false]]] | false]]]]]]


EG iterations: 0
-> the formula is FALSE

FORMULA p_1853_placecomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m6sec

STOP 1369577010

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

278 629
iterations count:2135 (22), effective:86 (0)

initing FirstDep: 0m0sec


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

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

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

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