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-110, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581024000183
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823868290

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: HexagonalGrid_PT_110
(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.213sec


RS generation: 0m 0.017sec


-> last computed set: #nodes 22 (2.2e+01) #states 3


parse successfull
net created successfully

Net: HexagonalGrid_PT_110
(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.856sec


RS generation: 0m 0.039sec


-> reachability set: #nodes 679 (6.8e+02) #states 40,193 (4)



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

checking: EX [EG [1<=pol3_1_1]]
normalized: EX [EG [1<=pol3_1_1]]

abstracting: (1<=pol3_1_1)
states: 29,568 (4)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AF [3<=pol2_1_1]
normalized: ~ [EG [~ [3<=pol2_1_1]]]

abstracting: (3<=pol2_1_1)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HexagonalGrid-PT-110-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AX [~ [pol2_1_1<=pb5_1_1]]]
normalized: ~ [EG [EX [pol2_1_1<=pb5_1_1]]]

abstracting: (pol2_1_1<=pb5_1_1)
states: 21,250 (4)
...
EG iterations: 2
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: ~ [~ [EG [pi2_1_1<=pb4_1_1]]]
normalized: EG [pi2_1_1<=pb4_1_1]

abstracting: (pi2_1_1<=pb4_1_1)
states: 32,785 (4)
...
EG iterations: 3
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [pol6_1_1<=pb5_1_1]
normalized: EG [pol6_1_1<=pb5_1_1]

abstracting: (pol6_1_1<=pb5_1_1)
states: 21,250 (4)
..
EG iterations: 2
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [AG [AG [pb1_1_1<=pi1_1_1]] | AF [AX [2<=pb2_1_1]]]
normalized: [~ [EG [EX [~ [2<=pb2_1_1]]]] | ~ [E [true U E [true U ~ [pb1_1_1<=pi1_1_1]]]]]

abstracting: (pb1_1_1<=pi1_1_1)
states: 28,786 (4)
abstracting: (2<=pb2_1_1)
states: 3,999 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: AF [A [pil5_1_1<=pb1_1_1 U 2<=po5_1_1]]
normalized: ~ [EG [~ [[~ [EG [~ [2<=po5_1_1]]] & ~ [E [~ [2<=po5_1_1] U [~ [pil5_1_1<=pb1_1_1] & ~ [2<=po5_1_1]]]]]]]]

abstracting: (2<=po5_1_1)
states: 0
abstracting: (pil5_1_1<=pb1_1_1)
states: 21,250 (4)
abstracting: (2<=po5_1_1)
states: 0
abstracting: (2<=po5_1_1)
states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EG [E [pi1_1_1<=po2_1_1 U po1_1_1<=pil4_1_1]]
normalized: EG [E [pi1_1_1<=po2_1_1 U po1_1_1<=pil4_1_1]]

abstracting: (po1_1_1<=pil4_1_1)
states: 37,632 (4)
abstracting: (pi1_1_1<=po2_1_1)
states: 32,129 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AF [[1<=pi4_1_1 & [~ [pb4_1_1<=pi3_1_1] | [3<=pi6_1_1 & 1<=pb3_1_1]]]]
normalized: ~ [EG [~ [[1<=pi4_1_1 & [[3<=pi6_1_1 & 1<=pb3_1_1] | ~ [pb4_1_1<=pi3_1_1]]]]]]

abstracting: (pb4_1_1<=pi3_1_1)
states: 28,786 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (3<=pi6_1_1)
states: 0
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
...
EG iterations: 3
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [AF [~ [~ [1<=pi4_1_1]]] | [AX [1<=pb6_1_1] & E [pi6_1_1<=pol2_1_1 U po1_1_1<=pb5_1_1]]]
normalized: [[E [pi6_1_1<=pol2_1_1 U po1_1_1<=pb5_1_1] & ~ [EX [~ [1<=pb6_1_1]]]] | ~ [EG [~ [1<=pi4_1_1]]]]

abstracting: (1<=pi4_1_1)
states: 10,625 (4)
...
EG iterations: 3
abstracting: (1<=pb6_1_1)
states: 13,842 (4)
.abstracting: (po1_1_1<=pb5_1_1)
states: 32,785 (4)
abstracting: (pi6_1_1<=pol2_1_1)
states: 37,632 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: ~ [EG [[[po6_1_1<=po4_1_1 | po2_1_1<=pil6_1_1] & [pb5_1_1<=pb4_1_1 & 1<=pol6_1_1]]]]
normalized: ~ [EG [[[pb5_1_1<=pb4_1_1 & 1<=pol6_1_1] & [po6_1_1<=po4_1_1 | po2_1_1<=pil6_1_1]]]]

abstracting: (po2_1_1<=pil6_1_1)
states: 37,632 (4)
abstracting: (po6_1_1<=po4_1_1)
states: 32,129 (4)
abstracting: (1<=pol6_1_1)
states: 29,568 (4)
abstracting: (pb5_1_1<=pb4_1_1)
states: 29,568 (4)
..
EG iterations: 2
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AF [[EF [3<=po6_1_1] & [[pb1_1_1<=pb5_1_1 & 1<=po6_1_1] & [3<=pil5_1_1 & pil5_1_1<=pil1_1_1]]]]
normalized: ~ [EG [~ [[[[pb1_1_1<=pb5_1_1 & 1<=po6_1_1] & [3<=pil5_1_1 & pil5_1_1<=pil1_1_1]] & E [true U 3<=po6_1_1]]]]]

abstracting: (3<=po6_1_1)
states: 0
abstracting: (pil5_1_1<=pil1_1_1)
states: 32,129 (4)
abstracting: (3<=pil5_1_1)
states: 0
abstracting: (1<=po6_1_1)
states: 10,625 (4)
abstracting: (pb1_1_1<=pb5_1_1)
states: 29,568 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[EF [2<=pol1_1_1] & [[pol5_1_1<=pi1_1_1 | pil4_1_1<=pb5_1_1] | [1<=pb3_1_1 & pol4_1_1<=pol5_1_1]]]]
normalized: EX [[E [true U 2<=pol1_1_1] & [[1<=pb3_1_1 & pol4_1_1<=pol5_1_1] | [pol5_1_1<=pi1_1_1 | pil4_1_1<=pb5_1_1]]]]

abstracting: (pil4_1_1<=pb5_1_1)
states: 21,250 (4)
abstracting: (pol5_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (pol4_1_1<=pol5_1_1)
states: 32,129 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (2<=pol1_1_1)
states: 0
.-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [~ [[[~ [pol4_1_1<=pol4_1_1] & [pol6_1_1<=pil6_1_1 & pi6_1_1<=pi3_1_1]] | AF [3<=po3_1_1]]] | ~ [EF [[1<=pb6_1_1 & 1<=pb6_1_1]]]]
normalized: [~ [[~ [EG [~ [3<=po3_1_1]]] | [[pol6_1_1<=pil6_1_1 & pi6_1_1<=pi3_1_1] & ~ [pol4_1_1<=pol4_1_1]]]] | ~ [E [true U [1<=pb6_1_1 & 1<=pb6_1_1]]]]

abstracting: (1<=pb6_1_1)
states: 13,842 (4)
abstracting: (1<=pb6_1_1)
states: 13,842 (4)
abstracting: (pol4_1_1<=pol4_1_1)
states: 40,193 (4)
abstracting: (pi6_1_1<=pi3_1_1)
states: 32,129 (4)
abstracting: (pol6_1_1<=pil6_1_1)
states: 32,129 (4)
abstracting: (3<=po3_1_1)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: ~ [[[[pb5_1_1<=po6_1_1 | [pi6_1_1<=pil1_1_1 | pil1_1_1<=pil6_1_1]] | ~ [[2<=po5_1_1 & 3<=pb5_1_1]]] & [EF [2<=pi5_1_1] | EF [3<=po2_1_1]]]]
normalized: ~ [[[E [true U 3<=po2_1_1] | E [true U 2<=pi5_1_1]] & [[pb5_1_1<=po6_1_1 | [pi6_1_1<=pil1_1_1 | pil1_1_1<=pil6_1_1]] | ~ [[2<=po5_1_1 & 3<=pb5_1_1]]]]]

abstracting: (3<=pb5_1_1)
states: 924
abstracting: (2<=po5_1_1)
states: 0
abstracting: (pil1_1_1<=pil6_1_1)
states: 32,129 (4)
abstracting: (pi6_1_1<=pil1_1_1)
states: 37,632 (4)
abstracting: (pb5_1_1<=po6_1_1)
states: 28,786 (4)
abstracting: (2<=pi5_1_1)
states: 0
abstracting: (3<=po2_1_1)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 40380 (4.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 165093 265132 430225
used/not used/entry size/cache size: 300897 66807967 16 1024MB
basic ops cache: hits/miss/sum: 17094 39003 56097
used/not used/entry size/cache size: 69084 16708132 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: 4124 6174 10298
used/not used/entry size/cache size: 6174 8382434 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 67068988
1 39487
2 336
3 29
4 8
5 4
6 2
7 10
8 0
9 0
>= 10 0

Total processing time: 0m 7.435sec


BK_STOP 1495823875832

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


initing FirstDep: 0m 0.000sec

zbdd.cc:1122: 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:798 (19), effective:65 (1)

initing FirstDep: 0m 0.000sec


iterations count:326 (7), effective:18 (0)

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

iterations count:99 (2), effective:16 (0)

iterations count:47 (1), effective:2 (0)

iterations count:47 (1), effective:2 (0)

iterations count:248 (5), effective:15 (0)

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-110"
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/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 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-110, 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 r181-blw3-149581024000183"
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 ;