fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r221su-smll-146468028400759
Last Updated
June 30, 2016

About the Execution of Marcie for TriangularGrid-PT-3011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10839.150 3600000.00 3600010.00 30.40 FTF??????FFTF??? normal

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 TriangularGrid-PT-3011, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028400759
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1465162513543


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: TriangularGrid_PT_3011
(NrP: 108 NrTr: 90 NrArc: 360)

net check time: 0m 0.000sec

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

init dd package: 0m 3.740sec


RS generation: 0m 8.341sec


-> reachability set: #nodes 6882 (6.9e+03) #states 284,675,587,524,871,889,466 (20)



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

checking: AF [3<=pi1_3_1]
normalized: ~ [EG [~ [3<=pi1_3_1]]]

abstracting: (3<=pi1_3_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (1<=pb2_1_1) states: 113,282,099,913,894,443,936 (20)
abstracting: (3<=pb2_2_2) states: 11,587,090,899,405,125,886 (19)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 7.087sec

checking: AF [AF [~ [pb3_2_2<=pil1_3_1]]]
normalized: ~ [EG [EG [pb3_2_2<=pil1_3_1]]]

abstracting: (pb3_2_2<=pil1_3_1) states: 222,166,954,814,912,544,265 (20)
.................................................
EG iterations: 49
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 9.472sec

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

abstracting: (pi1_1_1<=pol2_2_1) states: 257,923,872,673,405,953,231 (20)
-> the formula is FALSE

FORMULA TriangularGrid-PT-3011-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.582sec

checking: E [EG [1<=pil1_3_5] U ~ [pb3_3_2<=pbl_2_1]]
normalized: E [EG [1<=pil1_3_5] U ~ [pb3_3_2<=pbl_2_1]]

abstracting: (pb3_3_2<=pbl_2_1) states: 262,721,212,280,856,136,249 (20)
abstracting: (1<=pil1_3_5) states: 196,480,815,452,317,955,122 (20)
.........................................................................
EG iterations: 73

before gc: list nodes free: 4147530

after gc: idd nodes used:307224, unused:63692776; list nodes free:354826522
-> the formula is TRUE

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

MC time: 7m43.546sec

checking: AF [[AG [1<=pil3_3_3] & EX [pi1_2_1<=pol1_1_1]]]
normalized: ~ [EG [~ [[EX [pi1_2_1<=pol1_1_1] & ~ [E [true U ~ [1<=pil3_3_3]]]]]]]

abstracting: (1<=pil3_3_3) states: 196,480,815,452,457,417,970 (20)
abstracting: (pi1_2_1<=pol1_1_1) states: 257,923,872,673,436,464,845 (20)
.................................................
EG iterations: 48
-> the formula is FALSE

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

MC time: 1m46.358sec

checking: EG [~ [[~ [pb3_1_1<=pil3_2_3] | 2<=pb3_1_1]]]
normalized: EG [~ [[2<=pb3_1_1 | ~ [pb3_1_1<=pil3_2_3]]]]

abstracting: (pb3_1_1<=pil3_2_3) states: 222,175,394,788,099,948,900 (20)
abstracting: (2<=pb3_1_1) states: 40,066,548,235,746,656,592 (19)
.........................................
EG iterations: 41
-> the formula is TRUE

FORMULA TriangularGrid-PT-3011-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.007sec

checking: E [po2_3_5<=pb2_3_1 U AG [1<=po3_2_3]]
normalized: E [po2_3_5<=pb2_3_1 U ~ [E [true U ~ [1<=po3_2_3]]]]

abstracting: (1<=po3_2_3) states: 88,194,772,072,637,969,324 (19)
abstracting: (po2_3_5<=pb2_3_1) states: 230,826,303,069,691,653,593 (20)

before gc: list nodes free: 9310726

after gc: idd nodes used:280402, unused:63719598; list nodes free:354983596

before gc: list nodes free: 9288474

after gc: idd nodes used:707114, unused:63292886; list nodes free:352668944

before gc: list nodes free: 6970730

after gc: idd nodes used:1058690, unused:62941310; list nodes free:350757268

BK_TIME_CONFINEMENT_REACHED

--------------------
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

1196 1057 2104 2827 3809 4377 3534 3004 3203 3438 4753 4454 6291 5194 5432 4838 4592 5585 6612 6070 4936 5308 3453 5694 5271 5918 9238 9579 8332 8825 6769 5940 5543 6881 5557 6687 8039 7537 7905 6461 6047 7209 7626 6169 6200 6312 6306 9009 7201 8785 7095 6617 6743 8000 7296 6949 9089 8041 9231 7768 7646 8189 6932 6737 6702 6859 6888 6675 7653 10027 9751 9711 9630 8421 8087 8932 8460 8520 7008
iterations count:79085 (878), effective:12928 (143)

initing FirstDep: 0m 0.000sec

44062
iterations count:1841 (20), effective:192 (2)
26397 46374 79838 82044 79145
iterations count:5200 (57), effective:517 (5)
25226 91322 89353 129870 145381 164273 150570 277510 297456 252693 287956 294313 252000
iterations count:13071 (145), effective:1529 (16)
18417 24031 33880 40047
iterations count:4652 (51), effective:716 (7)

iterations count:599 (6), effective:61 (0)
12997 15347 14971 25003 29122 27322 26154 34744 41170 41462 41793 57380 62131 73098 83934 70198 88114 112853 135715 115584 135595 138005 144639 153452 148468 155321 137110 205907 183505 231252 199982 168069 242663 328263 400572 430693 458356 452043 817172 767249 710881 707269 673156 617045 640434 706072 763834 657399 720545 1091060 1009532 850860 788227 609968 644979 639859 603556 863157 723222 1017493 917362 1134963 1024388

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="TriangularGrid-PT-3011"
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/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 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 TriangularGrid-PT-3011, 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 r221su-smll-146468028400759"
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 ;