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_Diffusion2D-PT-D05N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416258000075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464190325901


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

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m23.887sec


RS generation: 0m 1.559sec


-> reachability set: #nodes 2425 (2.4e+03) #states 26,010,968,307,696,038,491,182,501 (25)



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

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

abstracting: (2<=cAMP__4_5_) states: 16,883,594,692,249,592,254,308,075 (25)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.589sec

checking: EF [AG [[2<=cAMP__3_3_ & 2<=cAMP__1_5_]]]
normalized: E [true U ~ [E [true U ~ [[2<=cAMP__3_3_ & 2<=cAMP__1_5_]]]]]

abstracting: (2<=cAMP__1_5_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (2<=cAMP__3_3_) states: 16,883,594,692,249,592,254,308,075 (25)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.295sec

checking: AF [EF [[3<=cAMP__5_1_ & 1<=cAMP__3_5_]]]
normalized: ~ [EG [~ [E [true U [3<=cAMP__5_1_ & 1<=cAMP__3_5_]]]]]

abstracting: (1<=cAMP__3_5_) states: 20,976,587,344,916,160,073,534,275 (25)
abstracting: (3<=cAMP__5_1_) states: 13,562,231,801,970,983,941,985,175 (25)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 6.803sec

checking: A [2<=cAMP__3_4_ U EF [2<=cAMP__4_5_]]
normalized: [~ [EG [~ [E [true U 2<=cAMP__4_5_]]]] & ~ [E [~ [E [true U 2<=cAMP__4_5_]] U [~ [E [true U 2<=cAMP__4_5_]] & ~ [2<=cAMP__3_4_]]]]]

abstracting: (2<=cAMP__3_4_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (2<=cAMP__4_5_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (2<=cAMP__4_5_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (2<=cAMP__4_5_) states: 16,883,594,692,249,592,254,308,075 (25)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EF [~ [[2<=cAMP__1_2_ | ~ [cAMP__3_3_<=cAMP__5_4_]]]]
normalized: E [true U ~ [[2<=cAMP__1_2_ | ~ [cAMP__3_3_<=cAMP__5_4_]]]]

abstracting: (cAMP__3_3_<=cAMP__5_4_) states: 14,393,366,890,371,176,262,127,461 (25)
abstracting: (2<=cAMP__1_2_) states: 16,883,594,692,249,592,254,308,075 (25)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.745sec

checking: AF [E [cAMP__1_1_<=cAMP__1_4_ U 2<=cAMP__4_5_]]
normalized: ~ [EG [~ [E [cAMP__1_1_<=cAMP__1_4_ U 2<=cAMP__4_5_]]]]

abstracting: (2<=cAMP__4_5_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (cAMP__1_1_<=cAMP__1_4_) states: 14,393,366,890,371,176,262,127,461 (25)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.258sec

checking: EF [EF [[3<=cAMP__1_4_ & cAMP__5_3_<=cAMP__4_2_]]]
normalized: E [true U E [true U [3<=cAMP__1_4_ & cAMP__5_3_<=cAMP__4_2_]]]

abstracting: (cAMP__5_3_<=cAMP__4_2_) states: 14,393,366,890,371,176,262,127,461 (25)
abstracting: (3<=cAMP__1_4_) states: 13,562,231,801,970,983,941,985,175 (25)
-> the formula is TRUE

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

MC time: 2m11.832sec

checking: EF [~ [[cAMP__2_3_<=cAMP__4_4_ & 2<=cAMP__3_1_]]]
normalized: E [true U ~ [[cAMP__2_3_<=cAMP__4_4_ & 2<=cAMP__3_1_]]]

abstracting: (2<=cAMP__3_1_) states: 16,883,594,692,249,592,254,308,075 (25)
abstracting: (cAMP__2_3_<=cAMP__4_4_) states: 14,393,366,890,371,176,262,127,461 (25)
-> the formula is TRUE

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

MC time: 0m18.271sec

checking: EF [AG [[cAMP__3_4_<=cAMP__4_2_ & cAMP__1_3_<=cAMP__5_3_]]]
normalized: E [true U ~ [E [true U ~ [[cAMP__3_4_<=cAMP__4_2_ & cAMP__1_3_<=cAMP__5_3_]]]]]

abstracting: (cAMP__1_3_<=cAMP__5_3_) states: 14,393,366,890,371,176,262,127,461 (25)
abstracting: (cAMP__3_4_<=cAMP__4_2_) states: 14,393,366,890,371,176,262,127,461 (25)

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-4 CANNOT_COMPUTE

MC time: 1m 4.495sec

checking: E [cAMP__5_1_<=cAMP__5_4_ U AG [cAMP__2_3_<=cAMP__1_2_]]
normalized: E [cAMP__5_1_<=cAMP__5_4_ U ~ [E [true U ~ [cAMP__2_3_<=cAMP__1_2_]]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-8 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: E [2<=cAMP__5_1_ U [2<=cAMP__1_2_ & [3<=cAMP__2_4_ | 1<=cAMP__2_5_]]]
normalized: E [2<=cAMP__5_1_ U [2<=cAMP__1_2_ & [3<=cAMP__2_4_ | 1<=cAMP__2_5_]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-11 CANNOT_COMPUTE

MC time: 0m 0.013sec

checking: [EF [1<=cAMP__2_3_] & ~ [[EF [2<=cAMP__2_1_] | EF [cAMP__1_4_<=cAMP__5_4_]]]]
normalized: [~ [[E [true U cAMP__1_4_<=cAMP__5_4_] | E [true U 2<=cAMP__2_1_]]] & E [true U 1<=cAMP__2_3_]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-15 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [A [[1<=cAMP__3_5_ | cAMP__3_3_<=cAMP__5_5_] U ~ [3<=cAMP__3_3_]] | ~ [AG [2<=cAMP__3_3_]]]
normalized: [E [true U ~ [2<=cAMP__3_3_]] | [~ [EG [3<=cAMP__3_3_]] & ~ [E [3<=cAMP__3_3_ U [3<=cAMP__3_3_ & ~ [[1<=cAMP__3_5_ | cAMP__3_3_<=cAMP__5_5_]]]]]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-0 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: ~ [[A [cAMP__1_3_<=cAMP__5_4_ U cAMP__4_3_<=cAMP__1_3_] | AX [[1<=cAMP__2_1_ | cAMP__5_5_<=cAMP__3_3_]]]]
normalized: ~ [[~ [EX [~ [[1<=cAMP__2_1_ | cAMP__5_5_<=cAMP__3_3_]]]] | [~ [EG [~ [cAMP__4_3_<=cAMP__1_3_]]] & ~ [E [~ [cAMP__4_3_<=cAMP__1_3_] U [~ [cAMP__1_3_<=cAMP__5_4_] & ~ [cAMP__4_3_<=cAMP__1_3_]]]]]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-12 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [EX [[[1<=cAMP__1_1_ | cAMP__4_4_<=cAMP__1_5_] | [cAMP__1_5_<=cAMP__1_3_ | cAMP__1_1_<=cAMP__4_5_]]] & EF [AG [cAMP__2_1_<=cAMP__4_3_]]]
normalized: [E [true U ~ [E [true U ~ [cAMP__2_1_<=cAMP__4_3_]]]] & EX [[[cAMP__1_5_<=cAMP__1_3_ | cAMP__1_1_<=cAMP__4_5_] | [1<=cAMP__1_1_ | cAMP__4_4_<=cAMP__1_5_]]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-2 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: [~ [A [cAMP__5_1_<=cAMP__5_3_ U cAMP__1_4_<=cAMP__1_4_]] | [[[[3<=cAMP__4_4_ | 3<=cAMP__5_2_] & [1<=cAMP__2_3_ | cAMP__2_2_<=cAMP__5_3_]] & EX [cAMP__2_5_<=cAMP__4_3_]] & E [3<=cAMP__4_1_ U 2<=cAMP__4_5_]]]
normalized: [[[EX [cAMP__2_5_<=cAMP__4_3_] & [[1<=cAMP__2_3_ | cAMP__2_2_<=cAMP__5_3_] & [3<=cAMP__4_4_ | 3<=cAMP__5_2_]]] & E [3<=cAMP__4_1_ U 2<=cAMP__4_5_]] | ~ [[~ [EG [~ [cAMP__1_4_<=cAMP__1_4_]]] & ~ [E [~ [cAMP__1_4_<=cAMP__1_4_] U [~ [cAMP__5_1_<=cAMP__5_3_] & ~ [cAMP__1_4_<=cAMP__1_4_]]]]]]]


FORMULA Diffusion2D-PT-D05N100-CTLCardinality-13 CANNOT_COMPUTE

MC time: 0m 0.000sec


Total processing time: 5m13.901sec


BK_STOP 1464190640216

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


iterations count:921 (6), effective:24 (0)

initing FirstDep: 0m 0.000sec


iterations count:940 (6), effective:24 (0)

iterations count:160 (1), effective:1 (0)
2397
iterations count:1398 (9), effective:41 (0)

iterations count:940 (6), effective:24 (0)

iterations count:940 (6), effective:24 (0)

iterations count:940 (6), effective:24 (0)

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

iterations count:977 (6), effective:31 (0)
4759
iterations count:1348 (9), effective:40 (0)

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

iterations count:160 (1), effective:1 (0)
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

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-D05N100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-D05N100.tgz
mv S_Diffusion2D-PT-D05N100 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_Diffusion2D-PT-D05N100, 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 r149kn-smll-146416258000075"
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 ;