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_Diffusion2D-PT-D05N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438600363
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495056963598

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: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 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.312sec

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 7.879sec


RS generation: 0m 0.860sec


-> reachability set: #nodes 1225 (1.2e+03) #states 17,529,515,713,716,297,876 (19)



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

checking: AG [~ [AX [1<=cAMP__5_3_]]]
normalized: ~ [E [true U ~ [EX [~ [1<=cAMP__5_3_]]]]]

abstracting: (1<=cAMP__5_3_)
states: 11,844,267,374,132,633,700 (19)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.071sec

checking: ~ [EF [AX [2<=cAMP__4_5_]]]
normalized: ~ [E [true U ~ [EX [~ [2<=cAMP__4_5_]]]]]

abstracting: (2<=cAMP__4_5_)
states: 7,950,261,662,089,028,100 (18)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.711sec

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

abstracting: (3<=cAMP__5_1_)
states: 5,300,174,441,392,685,400 (18)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.023sec

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

abstracting: (2<=cAMP__2_5_)
states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.835sec

checking: AG [~ [AG [cAMP__2_3_<=cAMP__5_3_]]]
normalized: ~ [E [true U ~ [E [true U ~ [cAMP__2_3_<=cAMP__5_3_]]]]]

abstracting: (cAMP__2_3_<=cAMP__5_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.041sec

checking: AG [AX [cAMP__2_5_<=cAMP__3_3_]]
normalized: ~ [E [true U EX [~ [cAMP__2_5_<=cAMP__3_3_]]]]

abstracting: (cAMP__2_5_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.148sec

checking: E [~ [2<=cAMP__5_2_] U EG [2<=cAMP__5_3_]]
normalized: E [~ [2<=cAMP__5_2_] U EG [2<=cAMP__5_3_]]

abstracting: (2<=cAMP__5_3_)
states: 7,950,261,662,089,028,100 (18)
.
EG iterations: 1
abstracting: (2<=cAMP__5_2_)
states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.532sec

checking: E [~ [[1<=cAMP__4_3_ & 2<=cAMP__5_4_]] U AX [1<=cAMP__3_1_]]
normalized: E [~ [[1<=cAMP__4_3_ & 2<=cAMP__5_4_]] U ~ [EX [~ [1<=cAMP__3_1_]]]]

abstracting: (1<=cAMP__3_1_)
states: 11,844,267,374,132,633,700 (19)
.abstracting: (2<=cAMP__5_4_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__4_3_)
states: 11,844,267,374,132,633,700 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.068sec

checking: E [EG [cAMP__2_1_<=cAMP__2_4_] U EX [3<=cAMP__5_1_]]
normalized: E [EG [cAMP__2_1_<=cAMP__2_4_] U EX [3<=cAMP__5_1_]]

abstracting: (3<=cAMP__5_1_)
states: 5,300,174,441,392,685,400 (18)
.abstracting: (cAMP__2_1_<=cAMP__2_4_)
states: 10,450,079,192,611,522,356 (19)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.876sec

checking: AX [E [cAMP__1_4_<=cAMP__2_2_ U 3<=cAMP__2_5_]]
normalized: ~ [EX [~ [E [cAMP__1_4_<=cAMP__2_2_ U 3<=cAMP__2_5_]]]]

abstracting: (3<=cAMP__2_5_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__1_4_<=cAMP__2_2_)
states: 10,450,079,192,611,522,356 (19)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.071sec

checking: AG [[cAMP__2_4_<=cAMP__1_3_ | EF [cAMP__3_1_<=cAMP__4_3_]]]
normalized: ~ [E [true U ~ [[cAMP__2_4_<=cAMP__1_3_ | E [true U cAMP__3_1_<=cAMP__4_3_]]]]]

abstracting: (cAMP__3_1_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_4_<=cAMP__1_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.064sec

checking: EX [[[[1<=cAMP__3_5_ | 3<=cAMP__5_3_] & [2<=cAMP__2_4_ & 2<=cAMP__3_5_]] | EF [2<=cAMP__2_5_]]]
normalized: EX [[E [true U 2<=cAMP__2_5_] | [[2<=cAMP__2_4_ & 2<=cAMP__3_5_] & [1<=cAMP__3_5_ | 3<=cAMP__5_3_]]]]

abstracting: (3<=cAMP__5_3_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (1<=cAMP__3_5_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (2<=cAMP__3_5_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__2_4_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__2_5_)
states: 7,950,261,662,089,028,100 (18)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.347sec

checking: ~ [E [[cAMP__5_5_<=cAMP__5_1_ & cAMP__2_4_<=cAMP__5_5_] U [1<=cAMP__4_5_ & 3<=cAMP__3_2_]]]
normalized: ~ [E [[cAMP__5_5_<=cAMP__5_1_ & cAMP__2_4_<=cAMP__5_5_] U [1<=cAMP__4_5_ & 3<=cAMP__3_2_]]]

abstracting: (3<=cAMP__3_2_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (1<=cAMP__4_5_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__2_4_<=cAMP__5_5_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__5_5_<=cAMP__5_1_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.428sec

checking: AX [[[2<=cAMP__5_5_ & [3<=cAMP__4_1_ | 1<=cAMP__5_2_]] & [cAMP__5_2_<=cAMP__3_5_ | [3<=cAMP__2_3_ & cAMP__1_4_<=cAMP__2_4_]]]]
normalized: ~ [EX [~ [[[cAMP__5_2_<=cAMP__3_5_ | [3<=cAMP__2_3_ & cAMP__1_4_<=cAMP__2_4_]] & [2<=cAMP__5_5_ & [3<=cAMP__4_1_ | 1<=cAMP__5_2_]]]]]]

abstracting: (1<=cAMP__5_2_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__4_1_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__5_5_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__1_4_<=cAMP__2_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__2_3_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__5_2_<=cAMP__3_5_)
states: 10,450,079,192,611,522,356 (19)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.354sec

checking: [AG [AX [cAMP__4_5_<=cAMP__3_3_]] | [~ [[[1<=cAMP__3_5_ | cAMP__5_1_<=cAMP__1_4_] | [2<=cAMP__2_5_ | 2<=cAMP__3_3_]]] & [AF [3<=cAMP__5_1_] & [cAMP__4_4_<=cAMP__2_4_ & [2<=cAMP__4_1_ & cAMP__5_2_<=cAMP__3_4_]]]]]
normalized: [[[[cAMP__4_4_<=cAMP__2_4_ & [2<=cAMP__4_1_ & cAMP__5_2_<=cAMP__3_4_]] & ~ [EG [~ [3<=cAMP__5_1_]]]] & ~ [[[2<=cAMP__2_5_ | 2<=cAMP__3_3_] | [1<=cAMP__3_5_ | cAMP__5_1_<=cAMP__1_4_]]]] | ~ [E [true U EX [~ [cAMP__4_5_<=cAMP__3_3_]]]]]

abstracting: (cAMP__4_5_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
.abstracting: (cAMP__5_1_<=cAMP__1_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__3_5_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (2<=cAMP__3_3_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__2_5_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (3<=cAMP__5_1_)
states: 5,300,174,441,392,685,400 (18)
.
EG iterations: 1
abstracting: (cAMP__5_2_<=cAMP__3_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__4_1_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__4_4_<=cAMP__2_4_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.844sec

checking: E [[[cAMP__3_1_<=cAMP__3_2_ | cAMP__2_4_<=cAMP__1_1_] & [cAMP__5_5_<=cAMP__4_4_ | 1<=cAMP__2_1_]] U [[cAMP__1_5_<=cAMP__1_3_ & 3<=cAMP__3_1_] & [cAMP__3_5_<=cAMP__5_2_ & 3<=cAMP__5_4_]]]
normalized: E [[[cAMP__5_5_<=cAMP__4_4_ | 1<=cAMP__2_1_] & [cAMP__3_1_<=cAMP__3_2_ | cAMP__2_4_<=cAMP__1_1_]] U [[cAMP__3_5_<=cAMP__5_2_ & 3<=cAMP__5_4_] & [cAMP__1_5_<=cAMP__1_3_ & 3<=cAMP__3_1_]]]

abstracting: (3<=cAMP__3_1_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__1_5_<=cAMP__1_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__5_4_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__3_5_<=cAMP__5_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_4_<=cAMP__1_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_1_<=cAMP__3_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__2_1_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__5_5_<=cAMP__4_4_)
states: 10,450,079,192,611,522,356 (19)

FORMULA Diffusion2D-PT-D05N050-CTLCardinality-5 CANNOT_COMPUTE

MC time: 4m34.252sec

totally nodes used: 18475512 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1928758373 94384246 2023142619
used/not used/entry size/cache size: 55311444 11797420 16 1024MB
basic ops cache: hits/miss/sum: 335308138 18153705 353461843
used/not used/entry size/cache size: 14896065 1881151 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: 2258906 111051 2369957
used/not used/entry size/cache size: 110329 8278279 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 55466400
1 10009680
2 967962
3 108327
4 64860
5 47262
6 41877
7 39229
8 35342
9 35078
>= 10 292847

Total processing time: 7m55.453sec


BK_STOP 1495057439937

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


iterations count:42944 (298), effective:1200 (8)

initing FirstDep: 0m 0.000sec


iterations count:1860 (12), effective:48 (0)

iterations count:2718 (18), effective:72 (0)

iterations count:2718 (18), effective:72 (0)

iterations count:1864 (12), effective:48 (0)

iterations count:15079 (104), effective:505 (3)

iterations count:1021 (7), effective:68 (0)

iterations count:1860 (12), effective:48 (0)

iterations count:1916 (13), effective:50 (0)

iterations count:2665 (18), effective:69 (0)

iterations count:2729 (18), effective:73 (0)

iterations count:1744 (12), effective:50 (0)

iterations count:1864 (12), effective:48 (0)

iterations count:3853 (26), effective:114 (0)

iterations count:789 (5), effective:68 (0)
std::bad_alloc

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_Diffusion2D-PT-D05N050"
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_Diffusion2D-PT-D05N050.tgz
mv S_Diffusion2D-PT-D05N050 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_Diffusion2D-PT-D05N050, 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 r091-ebro-149488438600363"
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 ;