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-3254
Executing tool marcie
Input is HexagonalGrid-PT-126, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581024000196
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823897566

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: HexagonalGrid_PT_126
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 1.117sec

parse successfull
net created successfully

Net: HexagonalGrid_PT_126
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.781sec


RS generation: 0m 0.177sec


-> reachability set: #nodes 1925 (1.9e+03) #states 2,664,192 (6)



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

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

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

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [po4_1_1<=pbl_1_1]
normalized: ~ [E [true U ~ [po4_1_1<=pbl_1_1]]]

abstracting: (po4_1_1<=pbl_1_1)
states: 2,664,192 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[po2_1_1<=po3_1_1 | ~ [3<=pil6_1_1]]]
normalized: ~ [E [true U ~ [[po2_1_1<=po3_1_1 | ~ [3<=pil6_1_1]]]]]

abstracting: (3<=pil6_1_1)
states: 0
abstracting: (po2_1_1<=po3_1_1)
states: 2,031,744 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[2<=po3_1_1 | 3<=pi2_1_1]] & ~ [~ [2<=pil5_1_1]]]]
normalized: E [true U [2<=pil5_1_1 & ~ [[2<=po3_1_1 | 3<=pi2_1_1]]]]

abstracting: (3<=pi2_1_1)
states: 0
abstracting: (2<=po3_1_1)
states: 0
abstracting: (2<=pil5_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[1<=pol6_1_1 & [2<=pil2_1_1 & 2<=pb6_1_1]]]]
normalized: ~ [E [true U [1<=pol6_1_1 & [2<=pil2_1_1 & 2<=pb6_1_1]]]]

abstracting: (2<=pb6_1_1)
states: 887,040 (5)
abstracting: (2<=pil2_1_1)
states: 0
abstracting: (1<=pol6_1_1)
states: 1,661,056 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[2<=pil4_1_1 & po4_1_1<=pil5_1_1]]
normalized: E [true U [2<=pil4_1_1 & po4_1_1<=pil5_1_1]]

abstracting: (po4_1_1<=pil5_1_1)
states: 2,293,504 (6)
abstracting: (2<=pil4_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[pi6_1_1<=pol4_1_1 | ~ [pol5_1_1<=pb3_1_1]] & 3<=pol2_1_1]]
normalized: E [true U [3<=pol2_1_1 & [pi6_1_1<=pol4_1_1 | ~ [pol5_1_1<=pb3_1_1]]]]

abstracting: (pol5_1_1<=pb3_1_1)
states: 2,006,272 (6)
abstracting: (pi6_1_1<=pol4_1_1)
states: 2,293,504 (6)
abstracting: (3<=pol2_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[~ [~ [2<=pi3_1_1]] | [[3<=pb4_1_1 | pil2_1_1<=po5_1_1] | ~ [2<=po6_1_1]]]]
normalized: ~ [E [true U ~ [[2<=pi3_1_1 | [~ [2<=po6_1_1] | [3<=pb4_1_1 | pil2_1_1<=po5_1_1]]]]]]

abstracting: (pil2_1_1<=po5_1_1)
states: 1,635,584 (6)
abstracting: (3<=pb4_1_1)
states: 467,456 (5)
abstracting: (2<=po6_1_1)
states: 0
abstracting: (2<=pi3_1_1)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[~ [2<=pil1_1_1] | [pol2_1_1<=pi6_1_1 & 1<=po1_1_1]] | [~ [2<=pi1_1_1] | ~ [3<=pb3_1_1]]]]
normalized: ~ [E [true U ~ [[[~ [3<=pb3_1_1] | ~ [2<=pi1_1_1]] | [[pol2_1_1<=pi6_1_1 & 1<=po1_1_1] | ~ [2<=pil1_1_1]]]]]]

abstracting: (2<=pil1_1_1)
states: 0
abstracting: (1<=po1_1_1)
states: 1,003,136 (6)
abstracting: (pol2_1_1<=pi6_1_1)
states: 1,635,584 (6)
abstracting: (2<=pi1_1_1)
states: 0
abstracting: (3<=pb3_1_1)
states: 467,456 (5)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[3<=pil2_1_1 & [[3<=po3_1_1 & pb3_1_1<=pil3_1_1] & [po6_1_1<=pil5_1_1 | 2<=pol5_1_1]]]]
normalized: E [true U [3<=pil2_1_1 & [[3<=po3_1_1 & pb3_1_1<=pil3_1_1] & [po6_1_1<=pil5_1_1 | 2<=pol5_1_1]]]]

abstracting: (2<=pol5_1_1)
states: 0
abstracting: (po6_1_1<=pil5_1_1)
states: 2,293,504 (6)
abstracting: (pb3_1_1<=pil3_1_1)
states: 1,512,448 (6)
abstracting: (3<=po3_1_1)
states: 0
abstracting: (3<=pil2_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[po2_1_1<=pb3_1_1 & po5_1_1<=pol5_1_1] & [[3<=po6_1_1 & po5_1_1<=po5_1_1] & 2<=pil5_1_1]]]
normalized: E [true U [[2<=pil5_1_1 & [3<=po6_1_1 & po5_1_1<=po5_1_1]] & [po2_1_1<=pb3_1_1 & po5_1_1<=pol5_1_1]]]

abstracting: (po5_1_1<=pol5_1_1)
states: 1,661,056 (6)
abstracting: (po2_1_1<=pb3_1_1)
states: 2,236,928 (6)
abstracting: (po5_1_1<=po5_1_1)
states: 2,664,192 (6)
abstracting: (3<=po6_1_1)
states: 0
abstracting: (2<=pil5_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[~ [2<=po5_1_1] | [po1_1_1<=pil3_1_1 | pb2_1_1<=pol2_1_1]] | ~ [[3<=pi5_1_1 | po4_1_1<=pb6_1_1]]]]
normalized: ~ [E [true U ~ [[[~ [2<=po5_1_1] | [po1_1_1<=pil3_1_1 | pb2_1_1<=pol2_1_1]] | ~ [[3<=pi5_1_1 | po4_1_1<=pb6_1_1]]]]]]

abstracting: (po4_1_1<=pb6_1_1)
states: 2,236,928 (6)
abstracting: (3<=pi5_1_1)
states: 0
abstracting: (pb2_1_1<=pol2_1_1)
states: 1,512,448 (6)
abstracting: (po1_1_1<=pil3_1_1)
states: 2,293,504 (6)
abstracting: (2<=po5_1_1)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

totally nodes used: 32508 (3.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 187487 197832 385319
used/not used/entry size/cache size: 211980 66896884 16 1024MB
basic ops cache: hits/miss/sum: 34504 42987 77491
used/not used/entry size/cache size: 73716 16703500 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: 13391 12307 25698
used/not used/entry size/cache size: 12307 8376301 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 67077057
1 31477
2 221
3 80
4 1
5 2
6 1
7 2
8 1
9 2
>= 10 20

Total processing time: 0m 6.895sec


BK_STOP 1495823904562

--------------------
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:1242 (29), effective:124 (2)

initing FirstDep: 0m 0.000sec

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="HexagonalGrid-PT-126"
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/HexagonalGrid-PT-126.tgz
mv HexagonalGrid-PT-126 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is HexagonalGrid-PT-126, 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 r181-blw3-149581024000196"
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 ;