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_TriangularGrid-PT-1200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454500336
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496688669599

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: TriangularGrid_PT_1200
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.223sec

parse successfull
net created successfully

Net: TriangularGrid_PT_1200
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 7.418sec


RS generation: 0m 0.321sec


-> reachability set: #nodes 651 (6.5e+02) #states 109,552 (5)



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

checking: ~ [EF [AF [3<=pil3_1_1]]]
normalized: ~ [E [true U ~ [EG [~ [3<=pil3_1_1]]]]]

abstracting: (3<=pil3_1_1)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=pi1_1_1)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: [EF [2<=pol1_1_1] | EG [AG [1<=po2_1_1]]]
normalized: [EG [~ [E [true U ~ [1<=po2_1_1]]]] | E [true U 2<=pol1_1_1]]

abstracting: (2<=pol1_1_1)
states: 0
abstracting: (1<=po2_1_1)
states: 53,840 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [E [1<=pol3_1_1 U 2<=pi3_1_1]]
normalized: E [true U E [1<=pol3_1_1 U 2<=pi3_1_1]]

abstracting: (2<=pi3_1_1)
states: 0
abstracting: (1<=pol3_1_1)
states: 55,712 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [~ [~ [[3<=po3_1_1 | pol1_1_1<=pi2_1_1]]]]
normalized: ~ [EG [~ [[3<=po3_1_1 | pol1_1_1<=pi2_1_1]]]]

abstracting: (pol1_1_1<=pi2_1_1)
states: 81,224 (4)
abstracting: (3<=po3_1_1)
states: 0
........................................................................................................................................................................................
EG iterations: 184
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.445sec

checking: EF [AG [[pol1_1_1<=pol3_1_1 & pbl_1_1<=pb2_1_1]]]
normalized: E [true U ~ [E [true U ~ [[pol1_1_1<=pol3_1_1 & pbl_1_1<=pb2_1_1]]]]]

abstracting: (pbl_1_1<=pb2_1_1)
states: 98,752 (4)
abstracting: (pol1_1_1<=pol3_1_1)
states: 82,168 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.300sec

checking: AG [[EG [pil1_1_1<=pb2_1_1] | EF [pol1_1_1<=pil1_1_1]]]
normalized: ~ [E [true U ~ [[E [true U pol1_1_1<=pil1_1_1] | EG [pil1_1_1<=pb2_1_1]]]]]

abstracting: (pil1_1_1<=pb2_1_1)
states: 107,680 (5)
.
EG iterations: 1
abstracting: (pol1_1_1<=pil1_1_1)
states: 82,168 (4)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [EG [EX [1<=pil2_1_1]] & EF [~ [[pil1_1_1<=pil1_1_1 | 1<=pbl_1_1]]]]
normalized: [E [true U ~ [[pil1_1_1<=pil1_1_1 | 1<=pbl_1_1]]] & EG [EX [1<=pil2_1_1]]]

abstracting: (1<=pil2_1_1)
states: 55,712 (4)
...
EG iterations: 2
abstracting: (1<=pbl_1_1)
states: 107,661 (5)
abstracting: (pil1_1_1<=pil1_1_1)
states: 109,552 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [E [pil2_1_1<=pol1_1_1 U po2_1_1<=po2_1_1]]
normalized: ~ [E [true U ~ [E [pil2_1_1<=pol1_1_1 U po2_1_1<=po2_1_1]]]]

abstracting: (po2_1_1<=po2_1_1)
states: 109,552 (5)
abstracting: (pil2_1_1<=pol1_1_1)
states: 82,168 (4)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [AF [[2<=pb2_1_1 & [pb2_1_1<=pil3_1_1 | pol3_1_1<=pi1_1_1]]]]
normalized: EG [~ [[2<=pb2_1_1 & [pb2_1_1<=pil3_1_1 | pol3_1_1<=pi1_1_1]]]]

abstracting: (pol3_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pb2_1_1<=pil3_1_1)
states: 5,552 (3)
abstracting: (2<=pb2_1_1)
states: 102,192 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: [EF [EG [3<=pol3_1_1]] & AF [[pi2_1_1<=pol1_1_1 | [1<=po1_1_1 | pil2_1_1<=pol2_1_1]]]]
normalized: [~ [EG [~ [[pi2_1_1<=pol1_1_1 | [1<=po1_1_1 | pil2_1_1<=pol2_1_1]]]]] & E [true U EG [3<=pol3_1_1]]]

abstracting: (3<=pol3_1_1)
states: 0
.
EG iterations: 1
abstracting: (pil2_1_1<=pol2_1_1)
states: 82,168 (4)
abstracting: (1<=po1_1_1)
states: 53,840 (4)
abstracting: (pi2_1_1<=pol1_1_1)
states: 83,096 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: E [[[3<=pol2_1_1 | 2<=pb3_1_1] | [1<=pb3_1_1 & 3<=po2_1_1]] U ~ [[pb2_1_1<=pol1_1_1 | 1<=pb3_1_1]]]
normalized: E [[[1<=pb3_1_1 & 3<=po2_1_1] | [3<=pol2_1_1 | 2<=pb3_1_1]] U ~ [[pb2_1_1<=pol1_1_1 | 1<=pb3_1_1]]]

abstracting: (1<=pb3_1_1)
states: 105,840 (5)
abstracting: (pb2_1_1<=pol1_1_1)
states: 5,552 (3)
abstracting: (2<=pb3_1_1)
states: 102,192 (5)
abstracting: (3<=pol2_1_1)
states: 0
abstracting: (3<=po2_1_1)
states: 0
abstracting: (1<=pb3_1_1)
states: 105,840 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: ~ [AG [[[pol3_1_1<=pil1_1_1 & pi1_1_1<=pbl_1_1] | [1<=pol3_1_1 | pi1_1_1<=pb3_1_1]]]]
normalized: E [true U ~ [[[1<=pol3_1_1 | pi1_1_1<=pb3_1_1] | [pol3_1_1<=pil1_1_1 & pi1_1_1<=pbl_1_1]]]]

abstracting: (pi1_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (pol3_1_1<=pil1_1_1)
states: 82,168 (4)
abstracting: (pi1_1_1<=pb3_1_1)
states: 107,712 (5)
abstracting: (1<=pol3_1_1)
states: 55,712 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[[[pol3_1_1<=pol1_1_1 & pi1_1_1<=po1_1_1] | [pol1_1_1<=pi3_1_1 & 1<=pi1_1_1]] & EF [3<=pil1_1_1]]]
normalized: E [true U [E [true U 3<=pil1_1_1] & [[pol1_1_1<=pi3_1_1 & 1<=pi1_1_1] | [pol3_1_1<=pol1_1_1 & pi1_1_1<=po1_1_1]]]]

abstracting: (pi1_1_1<=po1_1_1)
states: 82,168 (4)
abstracting: (pol3_1_1<=pol1_1_1)
states: 82,168 (4)
abstracting: (1<=pi1_1_1)
states: 53,840 (4)
abstracting: (pol1_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (3<=pil1_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [EX [[1<=pil3_1_1 | [pil1_1_1<=pb2_1_1 & pi2_1_1<=pb2_1_1]]] & AG [~ [[2<=pil2_1_1 & pil3_1_1<=pb2_1_1]]]]
normalized: [~ [E [true U [2<=pil2_1_1 & pil3_1_1<=pb2_1_1]]] & EX [[1<=pil3_1_1 | [pil1_1_1<=pb2_1_1 & pi2_1_1<=pb2_1_1]]]]

abstracting: (pi2_1_1<=pb2_1_1)
states: 107,712 (5)
abstracting: (pil1_1_1<=pb2_1_1)
states: 107,680 (5)
abstracting: (1<=pil3_1_1)
states: 55,712 (4)
.abstracting: (pil3_1_1<=pb2_1_1)
states: 107,680 (5)
abstracting: (2<=pil2_1_1)
states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [[~ [~ [~ [pb2_1_1<=pi2_1_1]]] & EF [~ [pbl_1_1<=pb2_1_1]]] & [AF [pbl_1_1<=pil3_1_1] | [~ [[pil2_1_1<=pil3_1_1 | 1<=po1_1_1]] & [[pol1_1_1<=pil1_1_1 & 3<=pb3_1_1] | [pol2_1_1<=pi1_1_1 & 1<=pi3_1_1]]]]]
normalized: [[~ [pb2_1_1<=pi2_1_1] & E [true U ~ [pbl_1_1<=pb2_1_1]]] & [~ [EG [~ [pbl_1_1<=pil3_1_1]]] | [[[pol2_1_1<=pi1_1_1 & 1<=pi3_1_1] | [pol1_1_1<=pil1_1_1 & 3<=pb3_1_1]] & ~ [[pil2_1_1<=pil3_1_1 | 1<=po1_1_1]]]]]

abstracting: (1<=po1_1_1)
states: 53,840 (4)
abstracting: (pil2_1_1<=pil3_1_1)
states: 82,168 (4)
abstracting: (3<=pb3_1_1)
states: 98,608 (4)
abstracting: (pol1_1_1<=pil1_1_1)
states: 82,168 (4)
abstracting: (1<=pi3_1_1)
states: 53,840 (4)
abstracting: (pol2_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pbl_1_1<=pil3_1_1)
states: 11,041 (4)
...
EG iterations: 3
abstracting: (pbl_1_1<=pb2_1_1)
states: 98,752 (4)
abstracting: (pb2_1_1<=pi2_1_1)
states: 5,520 (3)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

totally nodes used: 156526 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6069831 423017 6492848
used/not used/entry size/cache size: 515007 66593857 16 1024MB
basic ops cache: hits/miss/sum: 1791069 156392 1947461
used/not used/entry size/cache size: 324122 16453094 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: 129286 7793 137079
used/not used/entry size/cache size: 7793 8380815 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 67016264
1 66969
2 13966
3 3009
4 2785
5 2405
6 815
7 1021
8 733
9 681
>= 10 216

Total processing time: 0m18.640sec


BK_STOP 1496688688446

--------------------
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:1232 (102), effective:320 (26)

initing FirstDep: 0m 0.000sec


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

iterations count:820 (68), effective:174 (14)

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

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

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

iterations count:817 (68), effective:172 (14)

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_TriangularGrid-PT-1200"
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_TriangularGrid-PT-1200.tgz
mv S_TriangularGrid-PT-1200 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_TriangularGrid-PT-1200, 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-149443454500336"
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 ;