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 SquareGrid-PT-020102, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r071-ebro-149440997600124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494829797789

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=ReachabilityCardinality.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.262sec

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.885sec


RS generation: 0m 1.757sec


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



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

checking: EF [2<=p4il_1_1]
normalized: E [true U 2<=p4il_1_1]

abstracting: (2<=p4il_1_1)
states: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (3<=pb4_1_1)
states: 90,137,146,432 (10)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.655sec

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

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

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

MC time: 0m 0.000sec

checking: AG [~ [2<=p1il_1_2]]
normalized: ~ [E [true U 2<=p1il_1_2]]

abstracting: (2<=p1il_1_2)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [~ [2<=p1il_2_1]]
normalized: ~ [E [true U 2<=p1il_2_1]]

abstracting: (2<=p1il_2_1)
states: 0
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [3<=p2il_2_2]]
normalized: ~ [E [true U 3<=p2il_2_2]]

abstracting: (3<=p2il_2_2)
states: 0
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p1ol_2_2<=pbl_2_2]
normalized: ~ [E [true U ~ [p1ol_2_2<=pbl_2_2]]]

abstracting: (p1ol_2_2<=pbl_2_2)
states: 2,034,138,849,834 (12)
-> the formula is FALSE

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

MC time: 0m 4.112sec

checking: EF [~ [~ [~ [p4o_2_1<=pbl_2_1]]]]
normalized: E [true U ~ [p4o_2_1<=pbl_2_1]]

abstracting: (p4o_2_1<=pbl_2_1)
states: 2,070,398,415,834 (12)
-> the formula is TRUE

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

MC time: 0m 5.285sec

checking: EF [[~ [~ [3<=p1i_2_1]] & p1ol_2_2<=p1o_2_1]]
normalized: E [true U [3<=p1i_2_1 & p1ol_2_2<=p1o_2_1]]

abstracting: (p1ol_2_2<=p1o_2_1)
states: 1,021,732,592,412 (12)
abstracting: (3<=p1i_2_1)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.040sec

checking: AG [[p4il_2_2<=pb2_2_2 | ~ [[3<=p1o_1_2 & 3<=p1il_2_1]]]]
normalized: ~ [E [true U ~ [[p4il_2_2<=pb2_2_2 | ~ [[3<=p1o_1_2 & 3<=p1il_2_1]]]]]]

abstracting: (3<=p1il_2_1)
states: 0
abstracting: (3<=p1o_1_2)
states: 0
abstracting: (p4il_2_2<=pb2_2_2)
states: 1,169,696,534,160 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[p1o_1_2<=p2i_2_2 & [p4ol_1_1<=p4ol_2_1 & 2<=p1ol_1_2]]]]
normalized: ~ [E [true U [p1o_1_2<=p2i_2_2 & [p4ol_1_1<=p4ol_2_1 & 2<=p1ol_1_2]]]]

abstracting: (2<=p1ol_1_2)
states: 0
abstracting: (p4ol_1_1<=p4ol_2_1)
states: 1,656,051,315,618 (12)
abstracting: (p1o_1_2<=p2i_2_2)
states: 1,656,051,315,618 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[~ [~ [3<=p1ol_2_1]] & ~ [[p1ol_2_1<=p4o_2_1 | p2il_2_2<=p3o_2_2]]]]
normalized: E [true U [3<=p1ol_2_1 & ~ [[p1ol_2_1<=p4o_2_1 | p2il_2_2<=p3o_2_2]]]]

abstracting: (p2il_2_2<=p3o_2_2)
states: 1,021,732,592,412 (12)
abstracting: (p1ol_2_1<=p4o_2_1)
states: 1,021,732,592,412 (12)
abstracting: (3<=p1ol_2_1)
states: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[3<=p4o_2_2 | [[2<=p4ol_2_2 & p1i_1_2<=pbl_2_1] & 2<=pb4_2_2]]]
normalized: E [true U [3<=p4o_2_2 | [2<=pb4_2_2 & [2<=p4ol_2_2 & p1i_1_2<=pbl_2_1]]]]

abstracting: (p1i_1_2<=pbl_2_1)
states: 2,070,398,415,834 (12)
abstracting: (2<=p4ol_2_2)
states: 0
abstracting: (2<=pb4_2_2)
states: 280,659,824,176 (11)
abstracting: (3<=p4o_2_2)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EF [[~ [[p1ol_1_2<=p4i_1_2 | p4il_1_1<=pb4_1_2]] & 3<=pb4_2_1]]
normalized: E [true U [3<=pb4_2_1 & ~ [[p1ol_1_2<=p4i_1_2 | p4il_1_1<=pb4_1_2]]]]

abstracting: (p4il_1_1<=pb4_1_2)
states: 1,169,696,534,160 (12)
abstracting: (p1ol_1_2<=p4i_1_2)
states: 1,021,732,592,412 (12)
abstracting: (3<=pb4_2_1)
states: 90,137,146,432 (10)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.959sec

checking: EF [[[[3<=p3i_2_2 | 1<=p4o_1_1] | 1<=p4i_2_1] & [[2<=p2i_1_2 & 3<=p2il_1_2] & ~ [p2i_1_2<=p3ol_2_1]]]]
normalized: E [true U [[~ [p2i_1_2<=p3ol_2_1] & [2<=p2i_1_2 & 3<=p2il_1_2]] & [1<=p4i_2_1 | [3<=p3i_2_2 | 1<=p4o_1_1]]]]

abstracting: (1<=p4o_1_1)
states: 592,360,675,452 (11)
abstracting: (3<=p3i_2_2)
states: 0
abstracting: (1<=p4i_2_1)
states: 592,360,675,452 (11)
abstracting: (3<=p2il_1_2)
states: 0
abstracting: (2<=p2i_1_2)
states: 0
abstracting: (p2i_1_2<=p3ol_2_1)
states: 1,922,434,474,086 (12)
-> the formula is FALSE

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

MC time: 0m 0.021sec

checking: AG [[[[p4i_2_2<=p2o_2_2 | p2il_1_2<=pbl_2_2] & 1<=pb4_2_1] | [[pb3_2_2<=p1ol_2_2 | 2<=p1il_0] | [1<=p4ol_1_2 | 1<=p3ol_2_2]]]]
normalized: ~ [E [true U ~ [[[[1<=p4ol_1_2 | 1<=p3ol_2_2] | [pb3_2_2<=p1ol_2_2 | 2<=p1il_0]] | [1<=pb4_2_1 & [p4i_2_2<=p2o_2_2 | p2il_1_2<=pbl_2_2]]]]]]

abstracting: (p2il_1_2<=pbl_2_2)
states: 2,034,138,849,834 (12)
abstracting: (p4i_2_2<=p2o_2_2)
states: 1,656,051,315,618 (12)
abstracting: (1<=pb4_2_1)
states: 794,343,606,432 (11)
abstracting: (2<=p1il_0)
states: 0
abstracting: (pb3_2_2<=p1ol_2_2)
states: 1,661,424,281,626 (12)
abstracting: (1<=p3ol_2_2)
states: 1,493,062,557,126 (12)
abstracting: (1<=p4ol_1_2)
states: 1,493,062,557,126 (12)
-> the formula is FALSE

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

MC time: 0m 5.013sec

totally nodes used: 1388657 (1.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28727668 18485457 47213125
used/not used/entry size/cache size: 16954727 50154137 16 1024MB
basic ops cache: hits/miss/sum: 2061440 1501316 3562756
used/not used/entry size/cache size: 1997244 14779972 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: 31738 23575 55313
used/not used/entry size/cache size: 23545 8365063 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 65817286
1 1237023
2 43119
3 6030
4 1790
5 948
6 810
7 301
8 200
9 140
>= 10 1217

Total processing time: 0m44.548sec


BK_STOP 1494829842607

--------------------
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.001sec


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

initing FirstDep: 0m 0.001sec


iterations count:4171 (57), effective:324 (4)

iterations count:4816 (66), effective:448 (6)

iterations count:9064 (125), effective:709 (9)

iterations count:5947 (82), effective:544 (7)

iterations count:5807 (80), effective:526 (7)

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="SquareGrid-PT-020102"
export BK_EXAMINATION="ReachabilityCardinality"
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/SquareGrid-PT-020102.tgz
mv 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 SquareGrid-PT-020102, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r071-ebro-149440997600124"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;