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_SquareGrid-PT-020102, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444263600529
=====================================================================

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


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m16.447sec


RS generation: 0m 1.212sec


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



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

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

abstracting: (2<=p1ol_1_2) 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.001sec

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

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

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

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 3.358sec

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

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

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

MC time: 0m 0.001sec

checking: AG [~ [[1<=p3i_2_2 & p2il_1_2<=p1i_0]]]
normalized: ~ [E [true U [1<=p3i_2_2 & p2il_1_2<=p1i_0]]]

abstracting: (p2il_1_2<=p1i_0) states: 1,021,732,592,412 (12)
abstracting: (1<=p3i_2_2) states: 592,360,675,452 (11)
-> the formula is FALSE

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

MC time: 0m 2.301sec

checking: EF [[[[p4o_1_1<=p1o_1_1 & 3<=p4il_2_2] | 2<=p1i_2_2] & 1<=pb1_2_2]]
normalized: E [true U [1<=pb1_2_2 & [2<=p1i_2_2 | [p4o_1_1<=p1o_1_1 & 3<=p4il_2_2]]]]

abstracting: (3<=p4il_2_2) states: 0
abstracting: (p4o_1_1<=p1o_1_1) states: 1,656,051,315,618 (12)
abstracting: (2<=p1i_2_2) states: 0
abstracting: (1<=pb1_2_2) states: 794,343,606,432 (11)
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: EF [[[p1ol_2_1<=p3o_2_2 & [2<=p1o_1_1 & pbl_1_1<=pb1_1_1]] & ~ [3<=p2o_1_2]]]
normalized: E [true U [~ [3<=p2o_1_2] & [p1ol_2_1<=p3o_2_2 & [2<=p1o_1_1 & pbl_1_1<=pb1_1_1]]]]

abstracting: (pbl_1_1<=pb1_1_1) states: 247,505,514,640 (11)
abstracting: (2<=p1o_1_1) states: 0
abstracting: (p1ol_2_1<=p3o_2_2) states: 1,021,732,592,412 (12)
abstracting: (3<=p2o_1_2) states: 0
-> the formula is FALSE

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

MC time: 0m 0.018sec

checking: EF [[~ [[3<=p1ol_2_2 | p3o_2_2<=pb4_2_2]] & [[3<=p4ol_2_2 | 2<=p4i_2_1] | 1<=p2i_2_2]]]
normalized: E [true U [[1<=p2i_2_2 | [3<=p4ol_2_2 | 2<=p4i_2_1]] & ~ [[3<=p1ol_2_2 | p3o_2_2<=pb4_2_2]]]]

abstracting: (p3o_2_2<=pb4_2_2) states: 1,710,070,304,850 (12)
abstracting: (3<=p1ol_2_2) states: 0
abstracting: (2<=p4i_2_1) states: 0
abstracting: (3<=p4ol_2_2) states: 0
abstracting: (1<=p2i_2_2) states: 592,360,675,452 (11)
-> the formula is TRUE

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

MC time: 0m 1.329sec

checking: AG [~ [[[p1o_2_1<=pb1_1_1 & pb3_1_1<=pb3_2_1] & [3<=pb1_1_2 | 2<=p4i_2_1]]]]
normalized: ~ [E [true U [[p1o_2_1<=pb1_1_1 & pb3_1_1<=pb3_2_1] & [3<=pb1_1_2 | 2<=p4i_2_1]]]]

abstracting: (2<=p4i_2_1) states: 0
abstracting: (3<=pb1_1_2) states: 90,137,146,432 (10)
abstracting: (pb3_1_1<=pb3_2_1) states: 1,506,492,088,762 (12)
abstracting: (p1o_2_1<=pb1_1_1) states: 1,710,070,304,850 (12)
-> the formula is FALSE

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

MC time: 0m 3.952sec

checking: AG [[[[3<=p3ol_2_2 & p3i_2_2<=p3il_2_1] & ~ [p1i_2_1<=p4i_2_1]] | p3ol_2_2<=p3ol_2_2]]
normalized: ~ [E [true U ~ [[p3ol_2_2<=p3ol_2_2 | [~ [p1i_2_1<=p4i_2_1] & [3<=p3ol_2_2 & p3i_2_2<=p3il_2_1]]]]]]

abstracting: (p3i_2_2<=p3il_2_1) states: 1,922,434,474,086 (12)
abstracting: (3<=p3ol_2_2) states: 0
abstracting: (p1i_2_1<=p4i_2_1) states: 1,656,051,315,618 (12)
abstracting: (p3ol_2_2<=p3ol_2_2) states: 2,085,423,232,578 (12)
-> the formula is TRUE

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

MC time: 0m 0.017sec

checking: AG [~ [[[pb3_2_1<=p3o_2_1 | p1i_0<=p1ol_1_1] & [p1il_0<=p1ol_1_2 & 3<=pb2_2_2]]]]
normalized: ~ [E [true U [[p1il_0<=p1ol_1_2 & 3<=pb2_2_2] & [pb3_2_1<=p3o_2_1 | p1i_0<=p1ol_1_1]]]]

abstracting: (p1i_0<=p1ol_1_1) states: 1,922,434,474,086 (12)
abstracting: (pb3_2_1<=p3o_2_1) states: 1,434,418,752,922 (12)
abstracting: (3<=pb2_2_2) states: 90,137,146,432 (10)
abstracting: (p1il_0<=p1ol_1_2) states: 1,656,051,315,618 (12)
-> the formula is FALSE

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

MC time: 0m 3.099sec

checking: EF [[[[p3o_2_1<=p4i_1_2 & 1<=p1i_0] & [p4ol_1_1<=p3i_2_2 | pb3_1_1<=p1ol_1_1]] & pb2_1_1<=p4o_1_2]]
normalized: E [true U [pb2_1_1<=p4o_1_2 & [[p4ol_1_1<=p3i_2_2 | pb3_1_1<=p1ol_1_1] & [p3o_2_1<=p4i_1_2 & 1<=p1i_0]]]]

abstracting: (1<=p1i_0) states: 592,360,675,452 (11)
abstracting: (p3o_2_1<=p4i_1_2) states: 1,656,051,315,618 (12)
abstracting: (pb3_1_1<=p1ol_1_1) states: 1,661,424,281,626 (12)
abstracting: (p4ol_1_1<=p3i_2_2) states: 1,021,732,592,412 (12)
abstracting: (pb2_1_1<=p4o_1_2) states: 1,434,418,752,922 (12)
-> the formula is TRUE

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

MC time: 0m 4.206sec

checking: EF [[[[pb3_2_1<=pb4_2_2 & p4il_2_1<=pb3_1_2] & [p2ol_2_2<=p4i_1_2 & 2<=p4ol_2_1]] & ~ [[p3il_2_2<=pb4_1_1 | 1<=p1ol_2_2]]]]
normalized: E [true U [~ [[p3il_2_2<=pb4_1_1 | 1<=p1ol_2_2]] & [[p2ol_2_2<=p4i_1_2 & 2<=p4ol_2_1] & [pb3_2_1<=pb4_2_2 & p4il_2_1<=pb3_1_2]]]]

abstracting: (p4il_2_1<=pb3_1_2) states: 1,169,696,534,160 (12)
abstracting: (pb3_2_1<=pb4_2_2) states: 1,506,492,088,762 (12)
abstracting: (2<=p4ol_2_1) states: 0
abstracting: (p2ol_2_2<=p4i_1_2) states: 1,021,732,592,412 (12)
abstracting: (1<=p1ol_2_2) states: 1,493,062,557,126 (12)
abstracting: (p3il_2_2<=pb4_1_1) states: 1,169,696,534,160 (12)
-> the formula is FALSE

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

MC time: 0m 0.054sec

checking: AG [[[[1<=pb3_1_1 | p4ol_2_1<=pb4_2_1] | [p1i_0<=pb3_2_2 | pb3_1_1<=p1il_2_2]] | [~ [pbl_2_1<=pb3_2_1] | p1il_2_2<=pb3_1_1]]]
normalized: ~ [E [true U ~ [[[p1il_2_2<=pb3_1_1 | ~ [pbl_2_1<=pb3_2_1]] | [[p1i_0<=pb3_2_2 | pb3_1_1<=p1il_2_2] | [1<=pb3_1_1 | p4ol_2_1<=pb4_2_1]]]]]]

abstracting: (p4ol_2_1<=pb4_2_1) states: 1,169,696,534,160 (12)
abstracting: (1<=pb3_1_1) states: 794,343,606,432 (11)
abstracting: (pb3_1_1<=p1il_2_2) states: 1,661,424,281,626 (12)
abstracting: (p1i_0<=pb3_2_2) states: 1,710,070,304,850 (12)
abstracting: (pbl_2_1<=pb3_2_1) states: 247,505,514,640 (11)
abstracting: (p1il_2_2<=pb3_1_1) states: 1,169,696,534,160 (12)
-> the formula is TRUE

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

MC time: 0m 0.079sec


Total processing time: 0m40.719sec


BK_STOP 1465203274429

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

1016 1431 1226 1667 1244 2180 2341 1627 1794 2598 2198
iterations count:11383 (158), effective:1118 (15)

initing FirstDep: 0m 0.000sec

8679 6389 9088
iterations count:3731 (51), effective:285 (3)
4177 6872
iterations count:2653 (36), effective:216 (3)
4143 4623 7908
iterations count:3559 (49), effective:302 (4)
3611 6799 7587 9538
iterations count:4641 (64), effective:420 (5)
3765 8246 8607 11725 8309
iterations count:5278 (73), effective:456 (6)
15567 10431 6762
iterations count:3844 (53), effective:309 (4)

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="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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-2979"
echo " Executing tool marcie"
echo " Input is S_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 r197kn-qhx2-146444263600529"
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 ;