Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is S_Railroad-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128200219
=====================================================================

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

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Railroad-PT-005-CTLCardinality-0
FORMULA_NAME Railroad-PT-005-CTLCardinality-1
FORMULA_NAME Railroad-PT-005-CTLCardinality-10
FORMULA_NAME Railroad-PT-005-CTLCardinality-11
FORMULA_NAME Railroad-PT-005-CTLCardinality-12
FORMULA_NAME Railroad-PT-005-CTLCardinality-13
FORMULA_NAME Railroad-PT-005-CTLCardinality-14
FORMULA_NAME Railroad-PT-005-CTLCardinality-15
FORMULA_NAME Railroad-PT-005-CTLCardinality-2
FORMULA_NAME Railroad-PT-005-CTLCardinality-3
FORMULA_NAME Railroad-PT-005-CTLCardinality-4
FORMULA_NAME Railroad-PT-005-CTLCardinality-5
FORMULA_NAME Railroad-PT-005-CTLCardinality-6
FORMULA_NAME Railroad-PT-005-CTLCardinality-7
FORMULA_NAME Railroad-PT-005-CTLCardinality-8
FORMULA_NAME Railroad-PT-005-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464571073732


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-file=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Railroad_PT_005
(NrP: 68 NrTr: 56 NrArc: 313)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 3.914sec


RS generation: 0m 0.062sec


-> reachability set: #nodes 1250 (1.2e+03) #states 1,838 (3)



starting MCC model checker
--------------------------

checking: A [EX [2<=pl_P0_5] U EF [2<=pl_P7_3]]
normalized: [~ [EG [~ [E [true U 2<=pl_P7_3]]]] & ~ [E [~ [E [true U 2<=pl_P7_3]] U [~ [EX [2<=pl_P0_5]] & ~ [E [true U 2<=pl_P7_3]]]]]]

abstracting: (2<=pl_P7_3) states: 0
abstracting: (2<=pl_P0_5) states: 0
.abstracting: (2<=pl_P7_3) states: 0
abstracting: (2<=pl_P7_3) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [[AF [2<=pl_P25_1] | ~ [[3<=pl_P29_3 | 2<=pl_P7_3]]]]
normalized: ~ [E [true U ~ [[~ [[3<=pl_P29_3 | 2<=pl_P7_3]] | ~ [EG [~ [2<=pl_P25_1]]]]]]]

abstracting: (2<=pl_P25_1) states: 0

EG iterations: 0
abstracting: (2<=pl_P7_3) states: 0
abstracting: (3<=pl_P29_3) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [EF [3<=pl_P37_1] U ~ [pl_P29_2<=pl_P18_1]]
normalized: E [E [true U 3<=pl_P37_1] U ~ [pl_P29_2<=pl_P18_1]]

abstracting: (pl_P29_2<=pl_P18_1) states: 1,829 (3)
abstracting: (3<=pl_P37_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[AF [3<=pl_P30_1] | ~ [~ [pl_P9_1<=pl_P0_2]]]]
normalized: ~ [E [true U ~ [[pl_P9_1<=pl_P0_2 | ~ [EG [~ [3<=pl_P30_1]]]]]]]

abstracting: (3<=pl_P30_1) states: 0

EG iterations: 0
abstracting: (pl_P9_1<=pl_P0_2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [E [~ [2<=pl_P0_6] U [3<=pl_P7_1 | 3<=pl_P0_3]]]
normalized: ~ [E [~ [2<=pl_P0_6] U [3<=pl_P7_1 | 3<=pl_P0_3]]]

abstracting: (3<=pl_P0_3) states: 0
abstracting: (3<=pl_P7_1) states: 0
abstracting: (2<=pl_P0_6) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[~ [AF [pl_P7_3<=pl_P7_3]] | EF [[2<=pl_P31_1 | 2<=pl_P29_2]]]]
normalized: ~ [[EG [~ [pl_P7_3<=pl_P7_3]] | E [true U [2<=pl_P31_1 | 2<=pl_P29_2]]]]

abstracting: (2<=pl_P29_2) states: 0
abstracting: (2<=pl_P31_1) states: 0
abstracting: (pl_P7_3<=pl_P7_3) states: 1,838 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[3<=pl_P10_1 & 1<=pl_P12_1]] | [3<=pl_P40_2 | [3<=pl_P7_3 & 3<=pl_P13_1]]]]
normalized: ~ [E [true U ~ [[~ [[3<=pl_P10_1 & 1<=pl_P12_1]] | [3<=pl_P40_2 | [3<=pl_P7_3 & 3<=pl_P13_1]]]]]]

abstracting: (3<=pl_P13_1) states: 0
abstracting: (3<=pl_P7_3) states: 0
abstracting: (3<=pl_P40_2) states: 0
abstracting: (1<=pl_P12_1) states: 431
abstracting: (3<=pl_P10_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [E [[pl_P9_1<=pl_P34_2 & pl_P14_1<=pl_P11_1] U 2<=pl_P40_3]]
normalized: ~ [E [[pl_P9_1<=pl_P34_2 & pl_P14_1<=pl_P11_1] U 2<=pl_P40_3]]

abstracting: (2<=pl_P40_3) states: 0
abstracting: (pl_P14_1<=pl_P11_1) states: 1,838 (3)
abstracting: (pl_P9_1<=pl_P34_2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[~ [2<=pl_P7_4] & [pl_P26_1<=pl_P39_1 | 1<=pl_P29_3]] | ~ [3<=pl_P7_5]]]
normalized: ~ [E [true U ~ [[~ [3<=pl_P7_5] | [~ [2<=pl_P7_4] & [pl_P26_1<=pl_P39_1 | 1<=pl_P29_3]]]]]]

abstracting: (1<=pl_P29_3) states: 17
abstracting: (pl_P26_1<=pl_P39_1) states: 1,821 (3)
abstracting: (2<=pl_P7_4) states: 0
abstracting: (3<=pl_P7_5) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[~ [~ [[2<=pl_P36_1 & pl_P9_1<=pl_P20_1]]] | E [pl_P40_2<=pl_P40_1 U 3<=pl_P9_1]]]
normalized: ~ [[[2<=pl_P36_1 & pl_P9_1<=pl_P20_1] | E [pl_P40_2<=pl_P40_1 U 3<=pl_P9_1]]]

abstracting: (3<=pl_P9_1) states: 0
abstracting: (pl_P40_2<=pl_P40_1) states: 1,508 (3)
abstracting: (pl_P9_1<=pl_P20_1) states: 1,838 (3)
abstracting: (2<=pl_P36_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EX [[~ [1<=pl_P13_1] | [pl_P26_1<=pl_P7_3 | 3<=pl_P7_6]]] & [EF [3<=pl_P40_3] | AX [1<=pl_P4_1]]]
normalized: [EX [[[pl_P26_1<=pl_P7_3 | 3<=pl_P7_6] | ~ [1<=pl_P13_1]]] & [E [true U 3<=pl_P40_3] | ~ [EX [~ [1<=pl_P4_1]]]]]

abstracting: (1<=pl_P4_1) states: 431
.abstracting: (3<=pl_P40_3) states: 0
abstracting: (1<=pl_P13_1) states: 518
abstracting: (3<=pl_P7_6) states: 0
abstracting: (pl_P26_1<=pl_P7_3) states: 1,827 (3)
.-> the formula is FALSE

FORMULA Railroad-PT-005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [E [~ [2<=pl_P15_1] U [3<=pl_P41_1 | 3<=pl_P40_1]] & [~ [AX [1<=pl_P34_4]] | EX [[3<=pl_P21_1 | pl_P29_6<=pl_P33_1]]]]
normalized: [[EX [[3<=pl_P21_1 | pl_P29_6<=pl_P33_1]] | EX [~ [1<=pl_P34_4]]] & E [~ [2<=pl_P15_1] U [3<=pl_P41_1 | 3<=pl_P40_1]]]

abstracting: (3<=pl_P40_1) states: 0
abstracting: (3<=pl_P41_1) states: 0
abstracting: (2<=pl_P15_1) states: 0
abstracting: (1<=pl_P34_4) states: 595
.abstracting: (pl_P29_6<=pl_P33_1) states: 1,838 (3)
abstracting: (3<=pl_P21_1) states: 0
.-> the formula is FALSE

FORMULA Railroad-PT-005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: [[AG [~ [2<=pl_P13_1]] & A [pl_P7_2<=pl_P29_4 U pl_P40_4<=pl_P26_1]] & [~ [2<=pl_P29_5] & ~ [EG [2<=pl_P15_1]]]]
normalized: [[~ [2<=pl_P29_5] & ~ [EG [2<=pl_P15_1]]] & [~ [E [true U 2<=pl_P13_1]] & [~ [EG [~ [pl_P40_4<=pl_P26_1]]] & ~ [E [~ [pl_P40_4<=pl_P26_1] U [~ [pl_P7_2<=pl_P29_4] & ~ [pl_P40_4<=pl_P26_1]]]]]]]

abstracting: (pl_P40_4<=pl_P26_1) states: 1,407 (3)
abstracting: (pl_P7_2<=pl_P29_4) states: 1,838 (3)
abstracting: (pl_P40_4<=pl_P26_1) states: 1,407 (3)
abstracting: (pl_P40_4<=pl_P26_1) states: 1,407 (3)
.
EG iterations: 1
abstracting: (2<=pl_P13_1) states: 0
abstracting: (2<=pl_P15_1) states: 0
.
EG iterations: 1
abstracting: (2<=pl_P29_5) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [EF [[2<=pl_P35_1 & [3<=pl_P24_1 | 1<=pl_P40_2]]] | AG [[~ [2<=pl_P29_1] & [3<=pl_P8_1 | pl_P3_1<=pl_P22_1]]]]
normalized: [E [true U [2<=pl_P35_1 & [3<=pl_P24_1 | 1<=pl_P40_2]]] | ~ [E [true U ~ [[[3<=pl_P8_1 | pl_P3_1<=pl_P22_1] & ~ [2<=pl_P29_1]]]]]]

abstracting: (2<=pl_P29_1) states: 0
abstracting: (pl_P3_1<=pl_P22_1) states: 1,838 (3)
abstracting: (3<=pl_P8_1) states: 0
abstracting: (1<=pl_P40_2) states: 431
abstracting: (3<=pl_P24_1) states: 0
abstracting: (2<=pl_P35_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [E [[pl_P29_2<=pl_P34_3 | pl_P0_1<=pl_P3_1] U [pl_P11_1<=pl_P34_1 & 3<=pl_P0_2]]]
normalized: ~ [E [[pl_P29_2<=pl_P34_3 | pl_P0_1<=pl_P3_1] U [pl_P11_1<=pl_P34_1 & 3<=pl_P0_2]]]

abstracting: (3<=pl_P0_2) states: 0
abstracting: (pl_P11_1<=pl_P34_1) states: 34
abstracting: (pl_P0_1<=pl_P3_1) states: 1,380 (3)
abstracting: (pl_P29_2<=pl_P34_3) states: 1,827 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [[AG [pl_P0_3<=pl_P29_6] & [pl_P31_1<=pl_P13_1 | ~ [[pl_P34_4<=pl_P23_1 & pl_P34_1<=pl_P6_1]]]] | AX [EF [3<=pl_P7_6]]]
normalized: [~ [EX [~ [E [true U 3<=pl_P7_6]]]] | [[pl_P31_1<=pl_P13_1 | ~ [[pl_P34_4<=pl_P23_1 & pl_P34_1<=pl_P6_1]]] & ~ [E [true U ~ [pl_P0_3<=pl_P29_6]]]]]

abstracting: (pl_P0_3<=pl_P29_6) states: 1,380 (3)
abstracting: (pl_P34_1<=pl_P6_1) states: 1,834 (3)
abstracting: (pl_P34_4<=pl_P23_1) states: 1,838 (3)
abstracting: (pl_P31_1<=pl_P13_1) states: 1,211 (3)
abstracting: (3<=pl_P7_6) states: 0
.-> the formula is FALSE

FORMULA Railroad-PT-005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec


Total processing time: 0m 5.648sec


BK_STOP 1464571079420

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
pl_P7_2
pl_P7_4
pl_P7_5
pl_P14_1
pl_P0_6
pl_P1_1
pl_P24_1
pl_P7_6
pl_P9_1
pl_P29_4
pl_P29_5
pl_P29_6
pl_P37_1
pl_P38_1
pl_P3_1
pl_P40_6

The net has transition(s) that can never fire:
tr_T23_24
tr_T23_18
tr_T23_30
tr_T23_36
tr_T9_12

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: 0m 0.000sec

720
iterations count:1488 (26), effective:59 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:56 (1), effective:0 (0)
1263
iterations count:1128 (20), effective:72 (1)

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.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Railroad-PT-005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_Railroad-PT-005.tgz
mv S_Railroad-PT-005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Railroad-PT-005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r185kn-smll-146444128200219"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;