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 Diffusion2D-PT-D05N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348014800070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463506605815


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

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(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: 0m 3.815sec


RS generation: 0m 0.241sec


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



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

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

abstracting: (3<=cAMP__5_3_) states: 5,300,174,441,392,685,400 (18)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.596sec

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

abstracting: (3<=cAMP__5_4_) states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

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

MC time: 0m 1.486sec

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

abstracting: (3<=cAMP__3_5_) states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.825sec

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

abstracting: (3<=cAMP__1_5_) states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

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

MC time: 0m 0.524sec

checking: EF [cAMP__3_3_<=cAMP__4_1_]
normalized: E [true U cAMP__3_3_<=cAMP__4_1_]

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

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

MC time: 0m 4.030sec

checking: EF [[2<=cAMP__1_5_ | 3<=cAMP__5_5_]]
normalized: E [true U [2<=cAMP__1_5_ | 3<=cAMP__5_5_]]

abstracting: (3<=cAMP__5_5_) states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__1_5_) states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.486sec

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

abstracting: (cAMP__1_5_<=cAMP__1_5_) states: 17,529,515,713,716,297,876 (19)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [[cAMP__1_2_<=cAMP__1_1_ | ~ [1<=cAMP__2_1_]]]
normalized: ~ [E [true U ~ [[cAMP__1_2_<=cAMP__1_1_ | ~ [1<=cAMP__2_1_]]]]]

abstracting: (1<=cAMP__2_1_) states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__1_2_<=cAMP__1_1_) states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

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

MC time: 0m 0.457sec

checking: AG [[~ [[3<=cAMP__3_3_ & cAMP__3_3_<=cAMP__1_3_]] | 2<=cAMP__5_5_]]
normalized: ~ [E [true U ~ [[2<=cAMP__5_5_ | ~ [[3<=cAMP__3_3_ & cAMP__3_3_<=cAMP__1_3_]]]]]]

abstracting: (cAMP__3_3_<=cAMP__1_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__3_3_) states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__5_5_) states: 7,950,261,662,089,028,100 (18)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.552sec

checking: AG [[~ [cAMP__5_2_<=cAMP__3_1_] | [1<=cAMP__3_3_ | [1<=cAMP__5_2_ | 1<=cAMP__1_4_]]]]
normalized: ~ [E [true U ~ [[[1<=cAMP__3_3_ | [1<=cAMP__5_2_ | 1<=cAMP__1_4_]] | ~ [cAMP__5_2_<=cAMP__3_1_]]]]]

abstracting: (cAMP__5_2_<=cAMP__3_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (1<=cAMP__1_4_) states: 11,844,267,374,132,633,700 (19)
abstracting: (1<=cAMP__5_2_) states: 11,844,267,374,132,633,700 (19)
abstracting: (1<=cAMP__3_3_) states: 11,844,267,374,132,633,700 (19)
-> the formula is FALSE

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

MC time: 0m 0.510sec

checking: AG [~ [[~ [cAMP__3_2_<=cAMP__3_3_] & [cAMP__5_4_<=cAMP__5_5_ & cAMP__3_4_<=cAMP__5_5_]]]]
normalized: ~ [E [true U [~ [cAMP__3_2_<=cAMP__3_3_] & [cAMP__5_4_<=cAMP__5_5_ & cAMP__3_4_<=cAMP__5_5_]]]]

abstracting: (cAMP__3_4_<=cAMP__5_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__5_4_<=cAMP__5_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__3_2_<=cAMP__3_3_) states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.155sec

checking: AG [~ [[[cAMP__2_4_<=cAMP__3_2_ | cAMP__2_5_<=cAMP__5_3_] & [1<=cAMP__3_4_ & 2<=cAMP__4_5_]]]]
normalized: ~ [E [true U [[1<=cAMP__3_4_ & 2<=cAMP__4_5_] & [cAMP__2_4_<=cAMP__3_2_ | cAMP__2_5_<=cAMP__5_3_]]]]

abstracting: (cAMP__2_5_<=cAMP__5_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_4_<=cAMP__3_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__4_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__3_4_) states: 11,844,267,374,132,633,700 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.439sec

checking: AG [[[~ [3<=cAMP__1_2_] | [cAMP__5_3_<=cAMP__2_5_ | 2<=cAMP__4_1_]] | [2<=cAMP__5_3_ | cAMP__3_4_<=cAMP__4_3_]]]
normalized: ~ [E [true U ~ [[[[cAMP__5_3_<=cAMP__2_5_ | 2<=cAMP__4_1_] | ~ [3<=cAMP__1_2_]] | [2<=cAMP__5_3_ | cAMP__3_4_<=cAMP__4_3_]]]]]

abstracting: (cAMP__3_4_<=cAMP__4_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__5_3_) states: 7,950,261,662,089,028,100 (18)
abstracting: (3<=cAMP__1_2_) states: 5,300,174,441,392,685,400 (18)
abstracting: (2<=cAMP__4_1_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__5_3_<=cAMP__2_5_) states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

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

MC time: 0m10.241sec

checking: EF [[[[cAMP__2_5_<=cAMP__5_4_ & cAMP__2_5_<=cAMP__3_1_] & 2<=cAMP__2_5_] & cAMP__5_5_<=cAMP__4_2_]]
normalized: E [true U [cAMP__5_5_<=cAMP__4_2_ & [2<=cAMP__2_5_ & [cAMP__2_5_<=cAMP__5_4_ & cAMP__2_5_<=cAMP__3_1_]]]]

abstracting: (cAMP__2_5_<=cAMP__3_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_5_<=cAMP__5_4_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__2_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__5_5_<=cAMP__4_2_) states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.556sec

checking: EF [[[~ [cAMP__3_5_<=cAMP__3_1_] & 3<=cAMP__4_5_] & [[cAMP__1_4_<=cAMP__3_2_ & cAMP__5_5_<=cAMP__3_2_] & [2<=cAMP__4_2_ | 2<=cAMP__5_4_]]]]
normalized: E [true U [[[2<=cAMP__4_2_ | 2<=cAMP__5_4_] & [cAMP__1_4_<=cAMP__3_2_ & cAMP__5_5_<=cAMP__3_2_]] & [3<=cAMP__4_5_ & ~ [cAMP__3_5_<=cAMP__3_1_]]]]

abstracting: (cAMP__3_5_<=cAMP__3_1_) states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__4_5_) states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__5_5_<=cAMP__3_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_4_<=cAMP__3_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__5_4_) states: 7,950,261,662,089,028,100 (18)
abstracting: (2<=cAMP__4_2_) states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.955sec

checking: EF [[[[cAMP__3_3_<=cAMP__1_2_ | 2<=cAMP__3_4_] & 2<=cAMP__1_5_] & [[cAMP__2_3_<=cAMP__5_5_ & cAMP__4_3_<=cAMP__2_3_] | [cAMP__2_3_<=cAMP__2_4_ & cAMP__5_2_<=cAMP__3_3_]]]]
normalized: E [true U [[[cAMP__2_3_<=cAMP__2_4_ & cAMP__5_2_<=cAMP__3_3_] | [cAMP__2_3_<=cAMP__5_5_ & cAMP__4_3_<=cAMP__2_3_]] & [2<=cAMP__1_5_ & [cAMP__3_3_<=cAMP__1_2_ | 2<=cAMP__3_4_]]]]

abstracting: (2<=cAMP__3_4_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__3_3_<=cAMP__1_2_) states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_5_) states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__4_3_<=cAMP__2_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_3_<=cAMP__5_5_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__5_2_<=cAMP__3_3_) states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_3_<=cAMP__2_4_) states: 10,450,079,192,611,522,356 (19)

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-12 CANNOT_COMPUTE

MC time: 4m14.998sec


Total processing time: 6m14.348sec


BK_STOP 1463506980587

--------------------
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:940 (6), effective:24 (0)

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

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

iterations count:403 (2), effective:13 (0)

iterations count:914 (6), effective:23 (0)

iterations count:948 (6), effective:26 (0)
1164
iterations count:1202 (8), effective:37 (0)

iterations count:278 (1), effective:3 (0)

iterations count:942 (6), effective:24 (0)
2944
iterations count:1847 (12), effective:56 (0)
1181
iterations count:1868 (12), effective:58 (0)
4023 1621
iterations count:2323 (16), effective:75 (0)
8071 2280 1221
iterations count:3211 (22), effective:101 (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="Diffusion2D-PT-D05N050"
export BK_EXAMINATION="ReachabilityCardinality"
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/Diffusion2D-PT-D05N050.tgz
mv Diffusion2D-PT-D05N050 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 Diffusion2D-PT-D05N050, 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 r029kn-smll-146348014800070"
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 ;