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

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

=== Now, execution of the tool begins

BK_START 1463511338747


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_D10N010
(NrP: 100 NrTr: 684 NrArc: 1368)

net check time: 0m 0.000sec

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

init dd package: 0m 3.866sec


RS generation: 0m 0.287sec


-> reachability set: #nodes 1090 (1.1e+03) #states 42,634,215,112,710 (13)



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

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

abstracting: (2<=cAMP__1_4_) states: 325,949,656,825 (11)
-> the formula is TRUE

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

MC time: 0m 2.948sec

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

abstracting: (2<=cAMP__7_3_) states: 325,949,656,825 (11)
-> the formula is TRUE

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

MC time: 0m 2.432sec

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

abstracting: (2<=cAMP__6_1_) states: 325,949,656,825 (11)
-> the formula is TRUE

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

MC time: 0m 2.765sec

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

abstracting: (3<=cAMP__1_9_) states: 24,370,067,800 (10)
-> the formula is TRUE

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

MC time: 0m 2.334sec

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

abstracting: (2<=cAMP__4_8_) states: 325,949,656,825 (11)
-> the formula is FALSE

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

MC time: 0m 1.334sec

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

abstracting: (cAMP__8_1_<=cAMP__5_2_) states: 39,025,920,455,941 (13)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.501sec

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

abstracting: (cAMP__5_1_<=cAMP__4_9_) states: 39,025,920,455,941 (13)
-> the formula is FALSE

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

MC time: 0m 1.605sec

checking: EF [[2<=cAMP__2_3_ | 1<=cAMP__10_4_]]
normalized: E [true U [2<=cAMP__2_3_ | 1<=cAMP__10_4_]]

abstracting: (1<=cAMP__10_4_) states: 3,911,395,881,900 (12)
abstracting: (2<=cAMP__2_3_) states: 325,949,656,825 (11)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.411sec

checking: EF [[~ [[2<=cAMP__1_6_ | 1<=cAMP__1_6_]] & ~ [cAMP__1_1_<=cAMP__4_3_]]]
normalized: E [true U [~ [cAMP__1_1_<=cAMP__4_3_] & ~ [[2<=cAMP__1_6_ | 1<=cAMP__1_6_]]]]

abstracting: (1<=cAMP__1_6_) states: 3,911,395,881,900 (12)
abstracting: (2<=cAMP__1_6_) states: 325,949,656,825 (11)
abstracting: (cAMP__1_1_<=cAMP__4_3_) states: 39,025,920,455,941 (13)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.860sec

checking: AG [[cAMP__10_3_<=cAMP__2_7_ & ~ [[cAMP__4_3_<=cAMP__8_2_ & 3<=cAMP__4_1_]]]]
normalized: ~ [E [true U ~ [[cAMP__10_3_<=cAMP__2_7_ & ~ [[cAMP__4_3_<=cAMP__8_2_ & 3<=cAMP__4_1_]]]]]]

abstracting: (3<=cAMP__4_1_) states: 24,370,067,800 (10)
abstracting: (cAMP__4_3_<=cAMP__8_2_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__10_3_<=cAMP__2_7_) states: 39,025,920,455,941 (13)
-> the formula is FALSE

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

MC time: 0m 2.562sec

checking: EF [[~ [cAMP__1_10_<=cAMP__10_3_] & [cAMP__10_9_<=cAMP__5_8_ | ~ [3<=cAMP__10_10_]]]]
normalized: E [true U [~ [cAMP__1_10_<=cAMP__10_3_] & [cAMP__10_9_<=cAMP__5_8_ | ~ [3<=cAMP__10_10_]]]]

abstracting: (3<=cAMP__10_10_) states: 24,370,067,800 (10)
abstracting: (cAMP__10_9_<=cAMP__5_8_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__1_10_<=cAMP__10_3_) states: 39,025,920,455,941 (13)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.595sec

checking: AG [[~ [[1<=cAMP__6_4_ | 1<=cAMP__8_9_]] | [1<=cAMP__10_2_ | [3<=cAMP__10_4_ | cAMP__3_10_<=cAMP__7_4_]]]]
normalized: ~ [E [true U ~ [[[1<=cAMP__10_2_ | [3<=cAMP__10_4_ | cAMP__3_10_<=cAMP__7_4_]] | ~ [[1<=cAMP__6_4_ | 1<=cAMP__8_9_]]]]]]

abstracting: (1<=cAMP__8_9_) states: 3,911,395,881,900 (12)
abstracting: (1<=cAMP__6_4_) states: 3,911,395,881,900 (12)
abstracting: (cAMP__3_10_<=cAMP__7_4_) states: 39,025,920,455,941 (13)
abstracting: (3<=cAMP__10_4_) states: 24,370,067,800 (10)
abstracting: (1<=cAMP__10_2_) states: 3,911,395,881,900 (12)
-> the formula is FALSE

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

MC time: 0m 3.519sec

checking: AG [[~ [[cAMP__5_9_<=cAMP__2_10_ | 2<=cAMP__5_9_]] | [~ [2<=cAMP__2_8_] | [2<=cAMP__1_1_ | 2<=cAMP__2_2_]]]]
normalized: ~ [E [true U ~ [[~ [[cAMP__5_9_<=cAMP__2_10_ | 2<=cAMP__5_9_]] | [[2<=cAMP__1_1_ | 2<=cAMP__2_2_] | ~ [2<=cAMP__2_8_]]]]]]

abstracting: (2<=cAMP__2_8_) states: 325,949,656,825 (11)
abstracting: (2<=cAMP__2_2_) states: 325,949,656,825 (11)
abstracting: (2<=cAMP__1_1_) states: 325,949,656,825 (11)
abstracting: (2<=cAMP__5_9_) states: 325,949,656,825 (11)
abstracting: (cAMP__5_9_<=cAMP__2_10_) states: 39,025,920,455,941 (13)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.763sec

checking: EF [~ [[[2<=cAMP__8_9_ | cAMP__3_5_<=cAMP__1_4_] | [cAMP__8_1_<=cAMP__10_4_ & cAMP__9_6_<=cAMP__8_4_]]]]
normalized: E [true U ~ [[[cAMP__8_1_<=cAMP__10_4_ & cAMP__9_6_<=cAMP__8_4_] | [2<=cAMP__8_9_ | cAMP__3_5_<=cAMP__1_4_]]]]

abstracting: (cAMP__3_5_<=cAMP__1_4_) states: 39,025,920,455,941 (13)
abstracting: (2<=cAMP__8_9_) states: 325,949,656,825 (11)
abstracting: (cAMP__9_6_<=cAMP__8_4_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__8_1_<=cAMP__10_4_) states: 39,025,920,455,941 (13)
-> the formula is TRUE

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

MC time: 0m 7.115sec

checking: EF [[[[1<=cAMP__8_8_ & 1<=cAMP__5_10_] | [cAMP__7_10_<=cAMP__5_7_ & 1<=cAMP__10_3_]] | ~ [cAMP__2_9_<=cAMP__8_6_]]]
normalized: E [true U [~ [cAMP__2_9_<=cAMP__8_6_] | [[cAMP__7_10_<=cAMP__5_7_ & 1<=cAMP__10_3_] | [1<=cAMP__8_8_ & 1<=cAMP__5_10_]]]]

abstracting: (1<=cAMP__5_10_) states: 3,911,395,881,900 (12)
abstracting: (1<=cAMP__8_8_) states: 3,911,395,881,900 (12)
abstracting: (1<=cAMP__10_3_) states: 3,911,395,881,900 (12)
abstracting: (cAMP__7_10_<=cAMP__5_7_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__2_9_<=cAMP__8_6_) states: 39,025,920,455,941 (13)
-> the formula is TRUE

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

MC time: 0m 3.003sec

checking: EF [[[cAMP__3_9_<=cAMP__8_7_ & [1<=cAMP__1_9_ | 2<=cAMP__4_1_]] & ~ [[cAMP__10_7_<=cAMP__8_10_ & cAMP__10_4_<=cAMP__5_6_]]]]
normalized: E [true U [~ [[cAMP__10_7_<=cAMP__8_10_ & cAMP__10_4_<=cAMP__5_6_]] & [cAMP__3_9_<=cAMP__8_7_ & [1<=cAMP__1_9_ | 2<=cAMP__4_1_]]]]

abstracting: (2<=cAMP__4_1_) states: 325,949,656,825 (11)
abstracting: (1<=cAMP__1_9_) states: 3,911,395,881,900 (12)
abstracting: (cAMP__3_9_<=cAMP__8_7_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__10_4_<=cAMP__5_6_) states: 39,025,920,455,941 (13)
abstracting: (cAMP__10_7_<=cAMP__8_10_) states: 39,025,920,455,941 (13)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.329sec


Total processing time: 0m51.190sec


BK_STOP 1463511389984

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

490 490 580 650 760 870 900 1000
iterations count:8700 (12), effective:99 (0)

initing FirstDep: 0m 0.001sec

1956 1716 1556 1380 1188 1046 1052 1074
iterations count:8633 (12), effective:99 (0)
1990 1750 1574 1414 1238 1094 1052 1074
iterations count:8629 (12), effective:99 (0)
2150 1894 1734 1558 1382 1238 1142 1074
iterations count:8631 (12), effective:99 (0)
1675 1381 1108 961 994 1024 1033 1066
iterations count:8633 (12), effective:99 (0)
1262 1054 988 1004 1026 1046 1052 1074
iterations count:8630 (12), effective:99 (0)
2999 2564 2245 1955 1607 1346 1191 1082
iterations count:8631 (12), effective:99 (0)
1736 1592 1493 1394 1304 1214 1142 1081
iterations count:8720 (12), effective:100 (0)
1620 1515 1427 1363 1275 1195 1171 1083
iterations count:8630 (12), effective:99 (0)
1882 1702 1603 1504 1423 1306 1252 1189
iterations count:8783 (12), effective:101 (0)
2387 1989 1692 1476 1339 1257 1152 1082
iterations count:8631 (12), effective:99 (0)
1352 1235 1127 1046 1057 1068 1071 1081
iterations count:8689 (12), effective:101 (0)
1779 2497 1888 1371 1173 1110 1034 1048 1056 1080
iterations count:10308 (15), effective:134 (0)
1607 1367 1175 1031 1017 1037 1045 1065
iterations count:8705 (12), effective:100 (0)
3031 1555 1467 1411 1315 2610 2262 1885 1682 1162 1049 1054 1080
iterations count:13363 (19), effective:168 (0)
2099 1257 1230 1216 1117 1046 1057 1068 1071 1081
iterations count:10701 (15), effective:152 (0)
2442 1348 1214 1224 1625 1490 1382 1301 1217 1163 1133 1079
iterations count:12779 (18), effective:172 (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="Diffusion2D-PT-D10N010"
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-D10N010.tgz
mv Diffusion2D-PT-D10N010 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-D10N010, 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-146348014900133"
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 ;