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-2265
Executing tool marcie
Input is Kanban-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503800444
=====================================================================

--------------------
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 Kanban-PT-0010-CTLCardinality-0
FORMULA_NAME Kanban-PT-0010-CTLCardinality-1
FORMULA_NAME Kanban-PT-0010-CTLCardinality-10
FORMULA_NAME Kanban-PT-0010-CTLCardinality-11
FORMULA_NAME Kanban-PT-0010-CTLCardinality-12
FORMULA_NAME Kanban-PT-0010-CTLCardinality-13
FORMULA_NAME Kanban-PT-0010-CTLCardinality-14
FORMULA_NAME Kanban-PT-0010-CTLCardinality-15
FORMULA_NAME Kanban-PT-0010-CTLCardinality-2
FORMULA_NAME Kanban-PT-0010-CTLCardinality-3
FORMULA_NAME Kanban-PT-0010-CTLCardinality-4
FORMULA_NAME Kanban-PT-0010-CTLCardinality-5
FORMULA_NAME Kanban-PT-0010-CTLCardinality-6
FORMULA_NAME Kanban-PT-0010-CTLCardinality-7
FORMULA_NAME Kanban-PT-0010-CTLCardinality-8
FORMULA_NAME Kanban-PT-0010-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1432541906818

Model: Kanban-PT-0010
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m7sec


RS generation: 0m0sec


-> reachability set: #nodes 706 (7.1e+02) #states 1,005,927,208 (9)



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

checking: EF [~ [[[Pout3<=P4 | 2<=Pback1] & Pback1<=P4]]]
normalized: E [true U ~ [[Pback1<=P4 & [Pout3<=P4 | 2<=Pback1]]]]

abstracting: (2<=Pback1) states: 580,342,620 (8)
abstracting: (Pout3<=P4) states: 535,886,494 (8)
abstracting: (Pback1<=P4) states: 578,584,006 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m53sec

checking: ~ [~ [AG [[3<=P1 | 1<=Pback4]]]]
normalized: ~ [E [true U ~ [[3<=P1 | 1<=Pback4]]]]

abstracting: (1<=Pback4) states: 773,790,160 (8)
abstracting: (3<=P1) states: 422,067,360 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [EX [2<=P1]] | AG [Pback1<=P4]]
normalized: [~ [EX [2<=P1]] | ~ [E [true U ~ [Pback1<=P4]]]]

abstracting: (Pback1<=P4) states: 578,584,006 (8)
abstracting: (2<=P1) states: 580,342,620 (8)
.-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36sec

checking: [EF [AG [1<=Pm2]] & P2<=P3]
normalized: [P2<=P3 & E [true U ~ [E [true U ~ [1<=Pm2]]]]]

abstracting: (1<=Pm2) states: 807,081,132 (8)
abstracting: (P2<=P3) states: 1,005,927,208 (9)
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24sec

checking: [E [[3<=P2 | 2<=Pback1] U ~ [Pm3<=P4]] | AX [2<=Pback1]]
normalized: [~ [EX [~ [2<=Pback1]]] | E [[3<=P2 | 2<=Pback1] U ~ [Pm3<=P4]]]

abstracting: (Pm3<=P4) states: 535,886,494 (8)
abstracting: (2<=Pback1) states: 580,342,620 (8)
abstracting: (3<=P2) states: 236,554,032 (8)
abstracting: (2<=Pback1) states: 580,342,620 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m6sec

checking: E [~ [2<=Pback2] U P3<=Pm1]
normalized: E [~ [2<=Pback2] U P3<=Pm1]

abstracting: (P3<=Pm1) states: 715,510,510 (8)
abstracting: (2<=Pback2) states: 631,628,712 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26sec

checking: [P3<=Pm2 | EF [EF [2<=Pout1]]]
normalized: [P3<=Pm2 | E [true U E [true U 2<=Pout1]]]

abstracting: (2<=Pout1) states: 580,342,620 (8)
abstracting: (P3<=Pm2) states: 721,440,720 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26sec

checking: [[3<=Pout3 | E [3<=P1 U 3<=Pm1]] | AX [~ [[Pout4<=Pm2 & Pback1<=P1]]]]
normalized: [[3<=Pout3 | E [3<=P1 U 3<=Pm1]] | ~ [EX [[Pout4<=Pm2 & Pback1<=P1]]]]

abstracting: (Pback1<=P1) states: 566,273,708 (8)
abstracting: (Pout4<=Pm2) states: 612,243,060 (8)
.abstracting: (3<=Pm1) states: 422,067,360 (8)
abstracting: (3<=P1) states: 422,067,360 (8)
abstracting: (3<=Pout3) states: 479,488,152 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m8sec

checking: E [EF [Pout3<=P4] U P2<=Pback2]
normalized: E [E [true U Pout3<=P4] U P2<=Pback2]

abstracting: (P2<=Pback2) states: 721,440,720 (8)
abstracting: (Pout3<=P4) states: 535,886,494 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m46sec

checking: [[AG [Pout3<=P2] & [[~ [Pback3<=Pout1] | Pout3<=Pm3] & ~ [~ [P1<=P2]]]] & ~ [2<=Pm2]]
normalized: [~ [2<=Pm2] & [[P1<=P2 & [Pout3<=Pm3 | ~ [Pback3<=Pout1]]] & ~ [E [true U ~ [Pout3<=P2]]]]]

abstracting: (Pout3<=P2) states: 433,437,004 (8)
abstracting: (Pback3<=Pout1) states: 535,886,494 (8)
abstracting: (Pout3<=Pm3) states: 555,967,412 (8)
abstracting: (P1<=P2) states: 469,877,122 (8)
abstracting: (2<=Pm2) states: 631,628,712 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 18m49sec

checking: [EF [AG [3<=Pm4]] & ~ [AF [[Pback4<=P2 & 1<=Pback3]]]]
normalized: [E [true U ~ [E [true U ~ [3<=Pm4]]]] & EG [~ [[Pback4<=P2 & 1<=Pback3]]]]

abstracting: (1<=Pback3) states: 807,081,132 (8)
abstracting: (Pback4<=P2) states: 469,877,122 (8)
.
EG iterations: 1
abstracting: (3<=Pm4) states: 422,067,360 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18sec

checking: EF [[AG [Pout4<=Pm1] & ~ [[Pm1<=Pback2 | Pout4<=Pm1]]]]
normalized: E [true U [~ [E [true U ~ [Pout4<=Pm1]]] & ~ [[Pm1<=Pback2 | Pout4<=Pm1]]]]

abstracting: (Pout4<=Pm1) states: 578,584,006 (8)
abstracting: (Pm1<=Pback2) states: 612,243,060 (8)
abstracting: (Pout4<=Pm1) states: 578,584,006 (8)
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: EG [~ [AG [Pout1<=Pout1]]]
normalized: EG [E [true U ~ [Pout1<=Pout1]]]

abstracting: (Pout1<=Pout1) states: 1,005,927,208 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[1<=Pout2 | ~ [Pback4<=P3]] | ~ [1<=Pout2]]]
normalized: ~ [E [true U ~ [[~ [1<=Pout2] | [1<=Pout2 | ~ [Pback4<=P3]]]]]]

abstracting: (Pback4<=P3) states: 469,877,122 (8)
abstracting: (1<=Pout2) states: 807,081,132 (8)
abstracting: (1<=Pout2) states: 807,081,132 (8)
-> the formula is TRUE

FORMULA Kanban-PT-0010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29sec

checking: ~ [EF [AF [3<=Pout1]]]
normalized: ~ [E [true U ~ [EG [~ [3<=Pout1]]]]]

abstracting: (3<=Pout1) states: 422,067,360 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [E [Pm2<=Pout1 U 2<=Pback3]]
normalized: ~ [EX [~ [E [Pm2<=Pout1 U 2<=Pback3]]]]

abstracting: (2<=Pback3) states: 631,628,712 (8)
abstracting: (Pm2<=Pout1) states: 535,886,494 (8)
.-> the formula is FALSE

FORMULA Kanban-PT-0010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m7sec


Total processing time: 30m46sec


BK_STOP 1432543753140

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


iterations count:716 (44), effective:210 (13)

initing FirstDep: 0m0sec


iterations count:38 (2), effective:7 (0)

iterations count:142 (8), effective:31 (1)

iterations count:60 (3), effective:12 (0)

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

iterations count:62 (3), effective:13 (0)

iterations count:140 (8), effective:31 (1)

iterations count:71 (4), effective:14 (0)

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

iterations count:85 (5), effective:18 (1)

iterations count:56 (3), effective:9 (0)

iterations count:81 (5), effective:17 (1)

iterations count:96 (6), effective:21 (1)

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

iterations count:26 (1), effective:4 (0)

iterations count:83 (5), effective:17 (1)

iterations count:128 (8), effective:29 (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="Kanban-PT-0010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Kanban-PT-0010.tgz
mv Kanban-PT-0010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is Kanban-PT-0010, 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 r050kn-ebro-143236503800444"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;