fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r173kn-ebro-146433145400277
Last Updated
June 30, 2016

About the Execution of Marcie for S_BridgeAndVehicles-PT-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7389.500 3600000.00 3600555.00 20.10 ??F??????F????F? 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 S_BridgeAndVehicles-PT-V20P10N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433145400277
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464792440141


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: BridgeAndVehicles_PT_V20P10N10
(NrP: 68 NrTr: 548 NrArc: 4070)

net check time: 0m 0.000sec

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

init dd package: 0m 8.060sec


RS generation: 0m36.826sec


-> reachability set: #nodes 113193 (1.1e+05) #states 6,732,570 (6)



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

checking: EF [2<=sum(CHOIX_2, CHOIX_1)]
normalized: E [true U 2<=sum(CHOIX_2, CHOIX_1)]

abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.257sec

checking: EF [2<=sum(CHOIX_2, CHOIX_1)]
normalized: E [true U 2<=sum(CHOIX_2, CHOIX_1)]

abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: AG [[[~ [1<=ROUTE_B] & ~ [2<=SUR_PONT_A]] | 2<=ROUTE_B]]
normalized: ~ [E [true U ~ [[2<=ROUTE_B | [~ [1<=ROUTE_B] & ~ [2<=SUR_PONT_A]]]]]]

abstracting: (2<=SUR_PONT_A) states: 2,084,640 (6)
abstracting: (1<=ROUTE_B) states: 5,999,472 (6)
abstracting: (2<=ROUTE_B) states: 5,310,342 (6)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m17.016sec

checking: AG [~ [[~ [3<=CAPACITE] | 2<=sum(VIDANGE_2, VIDANGE_1)]]]
normalized: ~ [E [true U [2<=sum(VIDANGE_2, VIDANGE_1) | ~ [3<=CAPACITE]]]]

abstracting: (3<=CAPACITE) states: 6,336,230 (6)
abstracting: (2<=sum(VIDANGE_2, VIDANGE_1)) states: 0

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

920 3664 6200 7683 7694 7683 10730 10892 11134 11280 11331 11316 12344 15182 18012 19963 22697 22956 23108 23138 23176 24477 25362 27872 29417 25085 27487 27116 26930 26487 25819 27809 29786 31688 28752 30181 30764 30516 30079 29651 29167 31792 34029 36092 32376 34892 34668 34304 34064 33519 33152 36754 39245 41083 37014 39419 39306 38936 38426 38129 41347 42608 45046 46663 42331 44733 44413 44180 43741 43073 47679 49269 51462 49392 49377 50687 50390 49938 49619 49045 54294 56429 58480 54878 57394 57094 56954 56574 56018 55662 61539 64148 65779 62123 64641 64421 64033 63768 63276 65678 70996 72832 70157 71427 72012 71766 71331 70902 70419 73343 75914 78358 80285 80271 80249 79655 74351 76753 76418 76222 75753 75086 76423 79317 81665 82994 83065 82788 77354 79188 79370 79126 78689 78229 77771 80748 83290 85480 86306 86371 85980 80318 82834 82610 82225 81879 81455 82221 85879 87845 90032 90305 90187 89584 84299 86701 86381 86144 85701 85036 88634 91217 93547 94871 94936 94702 88880 91396 91121 90976 90566 90002 89648 95075 97119 99719 100149 99991 99592 94127 96497 96419 96047 95535 95177 98325 101763 104150 106009 106007 105893 101409 101314 102442 102141 101692 101340 100786 106863 109455 111694 112503 112546 112174 106517 109033 108809 108437 108044 107654 109777 111994 114421 116348 116400 116295 113280 110399 112527 112226 111795 111527 110500 110943 113313 115075 110533 111561 112073 112465 112753 112953 113123 113173 113191
iterations count:235690 (430), effective:9267 (16)

initing FirstDep: 0m 0.003sec

118119 119114 125495 125902 126221 126276 126280 126558 126553 126567 126604 126633 127711 132462 131797 131260 130794 130412 130313 129844 129339 128919 128435 130277 134101 133515 132916 132457 132483 131976 131456 130955 130454 129988 132191 135906 135323 134694 134221 134186 133671 133179 132661 132151 131661 133019 137832 137250 136604 136066 135597 135542 135004 134457 133972 133425 135025 139782 139269 138644 138047 137524 137451 136929 136389 135847 135326 134599 137591 141376 140849 140097 139551 139260 139020 138459 137899 137310 136668 136300 143631 143062 142555 141816 141181 141152 140619 140071 139511 138933 138309 139689 145409 144872 144222 143518 142927 142848 142305 141743 141188 140563 139934 141245 147301 146783 146128 145390 144770 144809 144256 143681 143112 142496 141739 140842 142164 149957 149444 148688 147980 147318 147331 146755 146181 145490 144937 144238 143198 144511 152746 152094 151276 150461 149845 149888 149292 148701 148005 147396 146678 145516 146823 155477 154817 154025 153148 152442 152467 151882 151266 150476 149938 149083 148000 153974 158141 157614 156890 155933 155159 155158 154572 153923 153276 152431 151844 150780 150801 156721 160534 159948 158869 158038 157587 157258 156628 156023 155348 154666 153811 152470 153759 163583 162914 162194 161140 160248 160242 159614 158960 158282 157345 156727 155821 155425 161217 166031 165441 164452 163329 162567 162636 161980 161322 160405 159780 158695 157444 157737 163226 168448 167815 166798 165782 164798 164916 164265 163569 162578 161961 161213 160219 159746 145219 146361 145771 144716 143485 142656 142601 141912 141176 140121 139436 138663 137599 136306 132343 132343 132343 132343 131743 131233 130943 124013
iterations count:246975 (450), effective:6026 (10)
15661 17781 19943 21465 23137 24394 25117 27200 31477 34798 35344 35806 36116 38360 46690 46182 46206 46258 46288 46300 46318 46297 46309 46302 46474 46466 46461 46448 46446 46426 50758 55567 60330 59638 58574 57854 57749 57752 57743 57640 57544 57690 57546 57329 57026 56804 56494 57505 62655 71105 70247 69418 68356 67683 67674 67680 67662 67574 67383 67987 67801 67525 67200 66864 66541 68686 72381 81100 80242 79441 78301 77573 77564 77582 77561 77461 77273 78365 78177 77887 77447 77129 76654 76544 79914 83370 89308 88640 87500 86540 86322 86301 86316 86228 86112 87818 87676 87174 87015 86572 86088 85318 84811 88844 93219 96913 96132 94925 93986 93924 93909 93921 93830 93689 96076 95966 95397 95228 94704 94081 93088 92306 93426 99250 103391 102757 101541 100581 100394 100376 100391 100303 100187 103341 103335 102696 102503 101828 101080 100339 98740 98767 101160 109423 108575 107609 106441 105720 105711 105729 105708 105614 105423 109558 109407 108627 107945 107616 106733 105169 103915 103939 106034 112899 112463 111284 110028 109631 109613 109631 109613 109472 109294 114298 114086 113190 112235 111512 110469 108864 109482 110261 112518 119938 119296 118017 116777 116391 116376 116373 116373 116239 116045 122433 122227 121243 120136 119740 118751 116502 114786 123971 125708 127661 129605 137216 136571 135405 134236 133646 133634 133646 133631 133537 133355 140854 140690 139476 138657 137987 136648 135224 131956 138311 142083 142316 142466 142561 142627 142684 142732 142455 142933 143161 143290 143345 143420 143486 143253 143554 143721 143949 144061 144199 144325 144399 144028 144796 145243 145706 145886 146126 146266 146446 146152 146717 147455 147897 148233 148587 148793 148975 149133 148728 149831 150444 151005 151594 151890 152154 152386 152586 152268 153991 155031 155975 156631 157038 157401

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_BridgeAndVehicles-PT-V20P10N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_BridgeAndVehicles-PT-V20P10N10.tgz
mv S_BridgeAndVehicles-PT-V20P10N10 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_BridgeAndVehicles-PT-V20P10N10, 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 r173kn-ebro-146433145400277"
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 ;