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

Execution Outputs of marcie for IBMB2S565S3960/none (P/T)

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

execution on node 1: quadhexa-2.u-paris10.fr (runId=137107412500129_n_1)
=====================================================================
runnning marcie on IBMB2S565S3960-PT-none (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 IBMB2S565S3960-PT-none, examination is CTLPlaceComparison
=====================================================================

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

START 1371128505

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: 273 NrTr: 179)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 2m45sec


-> reachability set: #nodes 706208 (7.1e+05) #states 15,510,635,947,410,534 (16)



before gc: list nodes free: 2169234

after gc: idd nodes used:1329516, unused:14670484; list nodes free:93170596

before gc: list nodes free: 5814919

after gc: idd nodes used:1649209, unused:14350791; list nodes free:91132737

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


before gc: list nodes free: 3998115

after gc: idd nodes used:1327713, unused:14672287; list nodes free:93182602

before gc: list nodes free: 6365254

after gc: idd nodes used:1445509, unused:14554491; list nodes free:92452364
checking: EG [[callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]
normalized: EG [[callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1446_placecomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AF [[callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054 | merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]
normalized: ~ [EG [~ [[callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054 | merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]]]


EG iterations: 0
-> the formula is FALSE

FORMULA p_1447_placecomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AF [[~ [callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054] & merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]
normalized: ~ [EG [~ [[merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used & ~ [callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054]]]]]


EG iterations: 0
-> the formula is FALSE

FORMULA p_1448_placecomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [[~ [callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054] | merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]
normalized: EG [[merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used | ~ [callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054]]]


EG iterations: 0
-> the formula is TRUE

FORMULA p_1449_placecomparison_eq_or_notx TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [AG [[callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054 -> AF [merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]]]
normalized: EG [~ [E [true U ~ [[~ [callToTask.s00003969.output.s00001077!=callToTask.s00003966.output.s00001054] | ~ [EG [~ [merge.s00001061.input.s00001066!=callToTask.s00003968.inputCriterion.s00001053.used]]]]]]]]


EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA p_1450_placecomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]
normalized: ~ [E [true U ~ [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]]]

-> the formula is FALSE

FORMULA p_1451_placecomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 1m58sec

checking: EG [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 | merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]
normalized: EG [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 | merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1452_placecomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]
normalized: EG [[merge.s00002240.input.s00001066!=callToTask.s00003970.output.s00001054 & merge.s00001061.input.s00001066!=callToTask.s00003966.input.s00001052]]

.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1453_placecomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 9m21sec

STOP 1371129066

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

9992 98130 413220 397904 408268 412808 413977 412183 411173 646589
iterations count:10659 (59), effective:1584 (8)

initing FirstDep: 0m0sec


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

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