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_Kanban-PT-0200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418300147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464332982895


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: Kanban_PT_0200
(NrP: 16 NrTr: 16 NrArc: 40)

net check time: 0m 0.000sec

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

init dd package: 0m 3.907sec


RS generation: 1m20.987sec


-> reachability set: #nodes 42816 (4.3e+04) #states 31,731,714,717,364,931,267,341 (22)



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

checking: AG [~ [AX [2<=Pm1]]]
normalized: ~ [E [true U ~ [EX [~ [2<=Pm1]]]]]

abstracting: (2<=Pm1) states: 30,798,474,509,855,247,145,300 (22)
.-> the formula is FALSE

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

MC time: 0m28.776sec

checking: AG [EF [~ [Pout2<=P4]]]
normalized: ~ [E [true U ~ [E [true U ~ [Pout2<=P4]]]]]

abstracting: (Pout2<=P4) states: 14,771,002,111,454,340,904,936 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 9.843sec

checking: EF [~ [~ [~ [Pm4<=P2]]]]
normalized: E [true U ~ [Pm4<=P2]]

abstracting: (Pm4<=P2) states: 12,068,024,746,453,073,624,821 (22)
-> the formula is TRUE

FORMULA Kanban-PT-0200-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 0.342sec

checking: ~ [~ [~ [EF [P1<=Pout1]]]]
normalized: ~ [E [true U P1<=Pout1]]

abstracting: (P1<=Pout1) states: 15,983,676,018,577,100,515,591 (22)
-> the formula is FALSE

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

MC time: 0m18.039sec

checking: AG [E [Pout3<=P3 U 3<=Pback2]]
normalized: ~ [E [true U ~ [E [Pout3<=P3 U 3<=Pback2]]]]

abstracting: (3<=Pback2) states: 30,565,202,860,007,390,834,490 (22)
abstracting: (Pout3<=P3) states: 11,377,702,399,158,213,961,486 (22)
-> the formula is FALSE

FORMULA Kanban-PT-0200-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.257sec

checking: EG [[AF [1<=Pm4] & AG [Pout2<=Pout2]]]
normalized: EG [[~ [E [true U ~ [Pout2<=Pout2]]] & ~ [EG [~ [1<=Pm4]]]]]

abstracting: (1<=Pm4) states: 31,262,773,120,556,582,529,400 (22)
..........................................................................................................................................................................................................
EG iterations: 202
abstracting: (Pout2<=Pout2) states: 31,731,714,717,364,931,267,341 (22)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-0200-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.733sec

checking: [AG [AG [3<=P1]] | P3<=Pm3]
normalized: [P3<=Pm3 | ~ [E [true U E [true U ~ [3<=P1]]]]]

abstracting: (3<=P1) states: 30,338,795,785,827,556,889,400 (22)
abstracting: (P3<=Pm3) states: 20,632,191,789,514,187,067,906 (22)
-> the formula is FALSE

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

MC time: 0m10.677sec

checking: E [EF [Pout2<=Pm4] U AG [2<=Pout2]]
normalized: E [E [true U Pout2<=Pm4] U ~ [E [true U ~ [2<=Pout2]]]]

abstracting: (2<=Pout2) states: 30,951,447,898,483,561,745,940 (22)
abstracting: (Pout2<=Pm4) states: 14,771,002,111,454,340,904,936 (22)

FORMULA Kanban-PT-0200-CTLCardinality-8 CANNOT_COMPUTE

MC time: 1m11.427sec

checking: AG [E [1<=P3 U Pback2<=Pm1]]
normalized: ~ [E [true U ~ [E [1<=P3 U Pback2<=Pm1]]]]


FORMULA Kanban-PT-0200-CTLCardinality-14 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AX [[AG [1<=P2] | ~ [[Pback3<=Pback1 | Pm3<=Pm3]]]]
normalized: ~ [EX [~ [[~ [[Pback3<=Pback1 | Pm3<=Pm3]] | ~ [E [true U ~ [1<=P2]]]]]]]


FORMULA Kanban-PT-0200-CTLCardinality-6 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [~ [E [Pback2<=Pout4 U 2<=Pm1]] & Pm2<=Pm3]
normalized: [Pm2<=Pm3 & ~ [E [Pback2<=Pout4 U 2<=Pm1]]]


FORMULA Kanban-PT-0200-CTLCardinality-13 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: E [[~ [2<=Pm3] | ~ [3<=Pback4]] U [[3<=Pout3 & 1<=Pback4] & ~ [P2<=Pout2]]]
normalized: E [[~ [3<=Pback4] | ~ [2<=Pm3]] U [[3<=Pout3 & 1<=Pback4] & ~ [P2<=Pout2]]]


FORMULA Kanban-PT-0200-CTLCardinality-5 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [AF [~ [[Pout4<=P1 & P4<=P3]]] | [AG [2<=Pout2] | ~ [EF [P3<=Pout1]]]]
normalized: [[~ [E [true U P3<=Pout1]] | ~ [E [true U ~ [2<=Pout2]]]] | ~ [EG [[Pout4<=P1 & P4<=P3]]]]


FORMULA Kanban-PT-0200-CTLCardinality-7 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: E [EF [3<=Pout4] U [[3<=P2 & P1<=Pm3] & [Pm1<=P3 & Pm3<=Pm1]]]
normalized: E [E [true U 3<=Pout4] U [[Pm1<=P3 & Pm3<=Pm1] & [3<=P2 & P1<=Pm3]]]


FORMULA Kanban-PT-0200-CTLCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: ~ [[1<=P3 & [[[Pout4<=Pout1 & Pm4<=Pout2] & [3<=Pout4 | Pout4<=Pm4]] & EF [3<=Pout3]]]]
normalized: ~ [[1<=P3 & [E [true U 3<=Pout3] & [[3<=Pout4 | Pout4<=Pm4] & [Pout4<=Pout1 & Pm4<=Pout2]]]]]


FORMULA Kanban-PT-0200-CTLCardinality-4 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [AG [[[Pback4<=Pback1 & P3<=Pback2] & P3<=Pback1]] | E [Pback2<=Pback2 U [2<=P3 & 3<=Pout3]]]
normalized: [E [Pback2<=Pback2 U [2<=P3 & 3<=Pout3]] | ~ [E [true U ~ [[P3<=Pback1 & [Pback4<=Pback1 & P3<=Pback2]]]]]]


FORMULA Kanban-PT-0200-CTLCardinality-9 CANNOT_COMPUTE

MC time: 0m 0.000sec


Total processing time: 7m31.271sec


BK_STOP 1464333434613

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

check for maximal unmarked siphon
ok
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

466 1181 6681 17248 33907 42064 43845 43306 42567 42428 44095 43556 42817 42745
iterations count:14216 (888), effective:4400 (275)

initing FirstDep: 0m 0.000sec


iterations count:130 (8), effective:33 (2)

iterations count:638 (39), effective:206 (12)
83209
iterations count:1657 (103), effective:512 (32)
42731 42817 42818 42776 42817 83820
iterations count:6616 (413), effective:1800 (112)

iterations count:113 (7), effective:30 (1)
38973 42816
iterations count:2525 (157), effective:802 (50)
42648 42680 42711 42739 42771 83804
iterations count:6550 (409), effective:1782 (111)

iterations count:16 (1), effective:0 (0)
46268 56809 55698 47281 43694
iterations count:5381 (336), effective:1788 (111)
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

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_Kanban-PT-0200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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_Kanban-PT-0200.tgz
mv S_Kanban-PT-0200 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_Kanban-PT-0200, 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 r161kn-blw3-146416418300147"
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 ;