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

About the Execution of Marcie for AutoFlight-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9834.230 785824.00 785019.00 20.20 TFFFTTFTTTTFTTTT 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 AutoFlight-PT-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r209su-blw3-146445825100196
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464681750796


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: AutoFlight_PT_02b
(NrP: 206 NrTr: 204 NrArc: 478)

net check time: 0m 0.000sec

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

init dd package: 0m 4.018sec


RS generation: 0m36.377sec


-> reachability set: #nodes 299368 (3.0e+05) #states 16,154,516,414,537 (13)



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

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

abstracting: (3<=p183) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.207sec

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

abstracting: (3<=p191) states: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=p82) states: 0
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AG [[p95<=p166 | ~ [3<=p34]]]
normalized: ~ [E [true U ~ [[p95<=p166 | ~ [3<=p34]]]]]

abstracting: (3<=p34) states: 0
abstracting: (p95<=p166) states: 14,898,172,077,745 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.545sec

checking: EF [~ [~ [[1<=p156 & p10<=p150]]]]
normalized: E [true U [1<=p156 & p10<=p150]]

abstracting: (p10<=p150) states: 16,147,065,578,705 (13)
abstracting: (1<=p156) states: 251,617,072,896 (11)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 2.921sec

checking: AG [~ [[2<=p32 & [p160<=p71 | 1<=p50]]]]
normalized: ~ [E [true U [2<=p32 & [p160<=p71 | 1<=p50]]]]

abstracting: (1<=p50) states: 873,259,333,384 (11)
abstracting: (p160<=p71) states: 15,965,803,609,865 (13)
abstracting: (2<=p32) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.666sec

checking: AG [~ [[[2<=p137 & p117<=p185] & 2<=p178]]]
normalized: ~ [E [true U [2<=p178 & [2<=p137 & p117<=p185]]]]

abstracting: (p117<=p185) states: 14,782,884,904,241 (13)
abstracting: (2<=p137) states: 0
abstracting: (2<=p178) states: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.800sec

checking: EF [~ [[p18<=p44 | [1<=p125 & p132<=p135]]]]
normalized: E [true U ~ [[p18<=p44 | [1<=p125 & p132<=p135]]]]

abstracting: (p132<=p135) states: 16,019,623,207,529 (13)
abstracting: (1<=p125) states: 96,298,645 (7)
abstracting: (p18<=p44) states: 15,295,425,720,713 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m30.452sec

checking: EF [~ [[1<=p1 | [p9<=p169 | p6<=p32]]]]
normalized: E [true U ~ [[1<=p1 | [p9<=p169 | p6<=p32]]]]

abstracting: (p6<=p32) states: 16,154,515,842,801 (13)
abstracting: (p9<=p169) states: 16,153,929,217,025 (13)
abstracting: (1<=p1) states: 1
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.439sec

checking: EF [[~ [[1<=p129 & p111<=p55]] & ~ [[p149<=p202 & p27<=p10]]]]
normalized: E [true U [~ [[p149<=p202 & p27<=p10]] & ~ [[1<=p129 & p111<=p55]]]]

abstracting: (p111<=p55) states: 15,490,662,322,601 (13)
abstracting: (1<=p129) states: 1,307,707,462,176 (12)
abstracting: (p27<=p10) states: 14,076,216,870,569 (13)
abstracting: (p149<=p202) states: 15,098,899,859,599 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.859sec

checking: EF [[~ [[p150<=p43 | p93<=p129]] & [p44<=p15 | 3<=p93]]]
normalized: E [true U [[p44<=p15 | 3<=p93] & ~ [[p150<=p43 | p93<=p129]]]]

abstracting: (p93<=p129) states: 14,818,246,691,617 (13)
abstracting: (p150<=p43) states: 15,129,950,678,107 (13)
abstracting: (3<=p93) states: 0
abstracting: (p44<=p15) states: 15,559,100,279,849 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.776sec

checking: EF [[[p65<=p82 & ~ [3<=p149]] & ~ [[p111<=p145 | p67<=p134]]]]
normalized: E [true U [~ [[p111<=p145 | p67<=p134]] & [p65<=p82 & ~ [3<=p149]]]]

abstracting: (3<=p149) states: 0
abstracting: (p65<=p82) states: 15,305,530,024,553 (13)
abstracting: (p67<=p134) states: 14,068,278,736,185 (13)
abstracting: (p111<=p145) states: 15,455,508,149,865 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 0.261sec

checking: EF [~ [[[1<=p8 | p19<=p130] & [p74<=p57 & p162<=p88]]]]
normalized: E [true U ~ [[[p74<=p57 & p162<=p88] & [1<=p8 | p19<=p130]]]]

abstracting: (p19<=p130) states: 15,258,571,631,177 (13)
abstracting: (1<=p8) states: 69,460,776 (7)
abstracting: (p162<=p88) states: 15,645,575,636,233 (13)
abstracting: (p74<=p57) states: 15,053,507,788,553 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m56.722sec

checking: AG [[~ [~ [p150<=p9]] | [[p1<=p154 | 3<=p62] & [p86<=p159 | p180<=p44]]]]
normalized: ~ [E [true U ~ [[p150<=p9 | [[p86<=p159 | p180<=p44] & [p1<=p154 | 3<=p62]]]]]]

abstracting: (3<=p62) states: 0
abstracting: (p1<=p154) states: 16,154,516,414,536 (13)
abstracting: (p180<=p44) states: 15,291,123,977,778 (13)
abstracting: (p86<=p159) states: 14,355,254,854,809 (13)
abstracting: (p150<=p9) states: 14,999,385,617,483 (13)
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.539sec

checking: AG [[[[1<=p146 | p148<=p32] & [p149<=p182 & 3<=p116]] | ~ [[1<=p161 & p199<=p183]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p161 & p199<=p183]] | [[p149<=p182 & 3<=p116] & [1<=p146 | p148<=p32]]]]]]

abstracting: (p148<=p32) states: 15,148,419,626,411 (13)
abstracting: (1<=p146) states: 1,155,186,309,918 (12)
abstracting: (3<=p116) states: 0
abstracting: (p149<=p182) states: 15,059,728,648,801 (13)
abstracting: (p199<=p183) states: 15,301,863,521,058 (13)
abstracting: (1<=p161) states: 378,708,330,560 (11)

before gc: list nodes free: 4090972

after gc: idd nodes used:399181, unused:63600819; list nodes free:287656914
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m35.220sec

checking: AG [[[[3<=p74 | p6<=p163] | p90<=p202] | [~ [p28<=p117] & [p84<=p41 & 2<=p55]]]]
normalized: ~ [E [true U ~ [[[[p84<=p41 & 2<=p55] & ~ [p28<=p117]] | [p90<=p202 | [3<=p74 | p6<=p163]]]]]]

abstracting: (p6<=p163) states: 16,154,515,842,801 (13)
abstracting: (3<=p74) states: 0
abstracting: (p90<=p202) states: 15,443,453,791,505 (13)
abstracting: (p28<=p117) states: 14,263,170,572,913 (13)
abstracting: (2<=p55) states: 0
abstracting: (p84<=p41) states: 15,549,775,337,577 (13)
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.855sec


Total processing time: 13m 5.657sec


BK_STOP 1464682536620

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

7737 8276 32763 33298 87279 92452 94193 94822 200363 258179 264706 272248 272792 273789 287715
iterations count:15572 (76), effective:1208 (5)

initing FirstDep: 0m 0.001sec

91329 146448 174149 427612
iterations count:4804 (23), effective:286 (1)
151271 193620 230751 237171 285979 288599 294887
iterations count:7750 (37), effective:508 (2)

iterations count:540 (2), effective:40 (0)
243349 247139 258481
iterations count:3140 (15), effective:170 (0)
94569 102726 185237 226027 270197 364327 375709 381583 434619
iterations count:9815 (48), effective:631 (3)
188728 272942 418973 416489
iterations count:4830 (23), effective:317 (1)
144608 161974
iterations count:2333 (11), effective:127 (0)
110188 146947 172251 609016
iterations count:4715 (23), effective:280 (1)

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="AutoFlight-PT-02b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b 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 AutoFlight-PT-02b, 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 r209su-blw3-146445825100196"
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 ;