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-3253
Executing tool marcie
Input is S_SquareGrid-PT-020102, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454200120
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496683389647

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: SquareGrid_PT_020102
(NrP: 68 NrTr: 72 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 2.294sec

parse successfull
net created successfully

Net: SquareGrid_PT_020102
(NrP: 68 NrTr: 72 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 7.729sec


RS generation: 0m 1.099sec


-> reachability set: #nodes 2034 (2.0e+03) #states 2,085,423,232,578 (12)



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

checking: EF [EX [3<=p1ol_1_1]]
normalized: E [true U EX [3<=p1ol_1_1]]

abstracting: (3<=p1ol_1_1)
states: 0
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [EX [1<=p4i_1_1]]
normalized: ~ [EG [~ [EX [1<=p4i_1_1]]]]

abstracting: (1<=p4i_1_1)
states: 592,360,675,452 (11)
......
EG iterations: 5
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.178sec

checking: ~ [~ [AF [[3<=pb4_1_2 & 3<=p3i_2_2]]]]
normalized: ~ [EG [~ [[3<=pb4_1_2 & 3<=p3i_2_2]]]]

abstracting: (3<=p3i_2_2)
states: 0
abstracting: (3<=pb4_1_2)
states: 90,137,146,432 (10)

EG iterations: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[AF [1<=p4o_2_2] & EX [3<=p2il_2_2]]]
normalized: ~ [EG [~ [[EX [3<=p2il_2_2] & ~ [EG [~ [1<=p4o_2_2]]]]]]]

abstracting: (1<=p4o_2_2)
states: 592,360,675,452 (11)
......
EG iterations: 6
abstracting: (3<=p2il_2_2)
states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.575sec

checking: A [~ [p2il_1_2<=pb1_2_1] U AF [1<=p3o_2_2]]
normalized: [~ [EG [EG [~ [1<=p3o_2_2]]]] & ~ [E [EG [~ [1<=p3o_2_2]] U [p2il_1_2<=pb1_2_1 & EG [~ [1<=p3o_2_2]]]]]]

abstracting: (1<=p3o_2_2)
states: 592,360,675,452 (11)
.....
EG iterations: 5
abstracting: (p2il_1_2<=pb1_2_1)
states: 1,169,696,534,160 (12)
abstracting: (1<=p3o_2_2)
states: 592,360,675,452 (11)
.....
EG iterations: 5
abstracting: (1<=p3o_2_2)
states: 592,360,675,452 (11)
.....
EG iterations: 5
.
EG iterations: 1
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.446sec

checking: [~ [[3<=p2il_1_2 & AX [3<=p1o_2_2]]] & EF [EX [2<=p1i_2_1]]]
normalized: [E [true U EX [2<=p1i_2_1]] & ~ [[3<=p2il_1_2 & ~ [EX [~ [3<=p1o_2_2]]]]]]

abstracting: (3<=p1o_2_2)
states: 0
.abstracting: (3<=p2il_1_2)
states: 0
abstracting: (2<=p1i_2_1)
states: 0
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [p2i_1_2<=p4il_2_2 U AX [3<=p2ol_2_2]]
normalized: E [p2i_1_2<=p4il_2_2 U ~ [EX [~ [3<=p2ol_2_2]]]]

abstracting: (3<=p2ol_2_2)
states: 0
.abstracting: (p2i_1_2<=p4il_2_2)
states: 1,922,434,474,086 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.637sec

checking: EF [A [p4ol_2_1<=p2i_2_2 U 2<=p4ol_2_2]]
normalized: E [true U [~ [EG [~ [2<=p4ol_2_2]]] & ~ [E [~ [2<=p4ol_2_2] U [~ [2<=p4ol_2_2] & ~ [p4ol_2_1<=p2i_2_2]]]]]]

abstracting: (p4ol_2_1<=p2i_2_2)
states: 1,021,732,592,412 (12)
abstracting: (2<=p4ol_2_2)
states: 0
abstracting: (2<=p4ol_2_2)
states: 0
abstracting: (2<=p4ol_2_2)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: EG [[EG [pbl_1_2<=p4i_2_1] | EF [2<=p3il_2_1]]]
normalized: EG [[E [true U 2<=p3il_2_1] | EG [pbl_1_2<=p4i_2_1]]]

abstracting: (pbl_1_2<=p4i_2_1)
states: 100,498,787,984 (11)
......
EG iterations: 6
abstracting: (2<=p3il_2_1)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.438sec

checking: AG [[p1il_0<=p1ol_2_1 | [~ [2<=pb1_2_1] | 1<=p3i_2_2]]]
normalized: ~ [E [true U ~ [[p1il_0<=p1ol_2_1 | [1<=p3i_2_2 | ~ [2<=pb1_2_1]]]]]]

abstracting: (2<=pb1_2_1)
states: 280,659,824,176 (11)
abstracting: (1<=p3i_2_2)
states: 592,360,675,452 (11)
abstracting: (p1il_0<=p1ol_2_1)
states: 1,656,051,315,618 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.465sec

checking: EF [[[1<=p1i_0 | [p4o_1_2<=p4il_1_2 & 3<=p2ol_1_2]] & 1<=p4i_2_1]]
normalized: E [true U [1<=p4i_2_1 & [1<=p1i_0 | [p4o_1_2<=p4il_1_2 & 3<=p2ol_1_2]]]]

abstracting: (3<=p2ol_1_2)
states: 0
abstracting: (p4o_1_2<=p4il_1_2)
states: 1,922,434,474,086 (12)
abstracting: (1<=p1i_0)
states: 592,360,675,452 (11)
abstracting: (1<=p4i_2_1)
states: 592,360,675,452 (11)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.963sec

checking: E [EF [p4o_2_1<=pb3_2_1] U [[2<=p1ol_1_1 & 2<=p4i_2_2] | 3<=pb2_2_2]]
normalized: E [E [true U p4o_2_1<=pb3_2_1] U [3<=pb2_2_2 | [2<=p1ol_1_1 & 2<=p4i_2_2]]]

abstracting: (2<=p4i_2_2)
states: 0
abstracting: (2<=p1ol_1_1)
states: 0
abstracting: (3<=pb2_2_2)
states: 90,137,146,432 (10)
abstracting: (p4o_2_1<=pb3_2_1)
states: 1,710,070,304,850 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.449sec

checking: [EX [[[2<=p4i_2_1 & p4il_1_1<=p2i_2_2] | pbl_2_2<=p1il_2_2]] | AF [AG [3<=p2i_2_2]]]
normalized: [~ [EG [E [true U ~ [3<=p2i_2_2]]]] | EX [[pbl_2_2<=p1il_2_2 | [2<=p4i_2_1 & p4il_1_1<=p2i_2_2]]]]

abstracting: (p4il_1_1<=p2i_2_2)
states: 1,021,732,592,412 (12)
abstracting: (2<=p4i_2_1)
states: 0
abstracting: (pbl_2_2<=p1il_2_2)
states: 172,760,362,096 (11)
.abstracting: (3<=p2i_2_2)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: A [[[1<=p1i_0 | p1i_1_2<=pb4_2_2] | [3<=pb4_1_1 & pbl_2_2<=p1o_2_2]] U EX [3<=p4ol_2_2]]
normalized: [~ [E [~ [EX [3<=p4ol_2_2]] U [~ [[[3<=pb4_1_1 & pbl_2_2<=p1o_2_2] | [1<=p1i_0 | p1i_1_2<=pb4_2_2]]] & ~ [EX [3<=p4ol_2_2]]]]] & ~ [EG [~ [EX [3<=p4ol_2_2]]]]]

abstracting: (3<=p4ol_2_2)
states: 0
.
EG iterations: 0
abstracting: (3<=p4ol_2_2)
states: 0
.abstracting: (p1i_1_2<=pb4_2_2)
states: 1,710,070,304,850 (12)
abstracting: (1<=p1i_0)
states: 592,360,675,452 (11)
abstracting: (pbl_2_2<=p1o_2_2)
states: 100,498,787,984 (11)
abstracting: (3<=pb4_1_1)
states: 90,137,146,432 (10)
abstracting: (3<=p4ol_2_2)
states: 0
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.271sec

checking: [[~ [AX [3<=pb4_2_2]] | 2<=pb2_2_2] & EG [[~ [2<=p1o_2_1] & [p1o_2_2<=p4i_1_1 & p3o_2_1<=p4o_2_2]]]]
normalized: [[2<=pb2_2_2 | EX [~ [3<=pb4_2_2]]] & EG [[[p1o_2_2<=p4i_1_1 & p3o_2_1<=p4o_2_2] & ~ [2<=p1o_2_1]]]]

abstracting: (2<=p1o_2_1)
states: 0
abstracting: (p3o_2_1<=p4o_2_2)
states: 1,656,051,315,618 (12)
abstracting: (p1o_2_2<=p4i_1_1)
states: 1,656,051,315,618 (12)
............
EG iterations: 12
abstracting: (3<=pb4_2_2)
states: 90,137,146,432 (10)
.abstracting: (2<=pb2_2_2)
states: 280,659,824,176 (11)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.930sec

checking: [AF [AG [p1o_2_2<=p3il_2_2]] & [p2ol_1_2<=p1ol_1_2 & ~ [[[p4i_1_1<=p4ol_2_1 & 3<=p2il_2_2] & [p4ol_2_1<=p4ol_2_1 | pbl_1_1<=pb3_2_1]]]]]
normalized: [~ [EG [E [true U ~ [p1o_2_2<=p3il_2_2]]]] & [p2ol_1_2<=p1ol_1_2 & ~ [[[p4i_1_1<=p4ol_2_1 & 3<=p2il_2_2] & [p4ol_2_1<=p4ol_2_1 | pbl_1_1<=pb3_2_1]]]]]

abstracting: (pbl_1_1<=pb3_2_1)
states: 160,161,665,248 (11)
abstracting: (p4ol_2_1<=p4ol_2_1)
states: 2,085,423,232,578 (12)
abstracting: (3<=p2il_2_2)
states: 0
abstracting: (p4i_1_1<=p4ol_2_1)
states: 1,922,434,474,086 (12)
abstracting: (p2ol_1_2<=p1ol_1_2)
states: 1,656,051,315,618 (12)
abstracting: (p1o_2_2<=p3il_2_2)
states: 1,922,434,474,086 (12)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.435sec

totally nodes used: 2563012 (2.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 32862770 25497708 58360478
used/not used/entry size/cache size: 22855632 44253232 16 1024MB
basic ops cache: hits/miss/sum: 2572288 2321390 4893678
used/not used/entry size/cache size: 3022726 13754490 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 35012 26730 61742
used/not used/entry size/cache size: 26687 8361921 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64745903
1 2222362
2 117339
3 14690
4 4000
5 1414
6 869
7 429
8 334
9 200
>= 10 1324

Total processing time: 0m50.145sec


BK_STOP 1496683440054

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

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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


iterations count:11383 (158), effective:1118 (15)

initing FirstDep: 0m 0.000sec


iterations count:1223 (16), effective:95 (1)

iterations count:35516 (493), effective:3457 (48)

iterations count:565 (7), effective:41 (0)

iterations count:4662 (64), effective:352 (4)

iterations count:2416 (33), effective:180 (2)

iterations count:474 (6), effective:44 (0)

iterations count:4577 (63), effective:398 (5)

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

iterations count:2500 (34), effective:212 (2)

iterations count:2781 (38), effective:241 (3)

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_SquareGrid-PT-020102"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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_SquareGrid-PT-020102.tgz
mv S_SquareGrid-PT-020102 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_SquareGrid-PT-020102, 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 r151-ebro-149443454200120"
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 ;