fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r011-ebro-149436297200340
Last Updated
June 27, 2017

About the Execution of MARCIE for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11288.920 3600000.00 3600038.00 40.60 T?F??F?FTF???TF? 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-3253
Executing tool marcie
Input is DES-PT-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r011-ebro-149436297200340
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494456208448

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6

parse successfull
net created successfully

Net: DES_PT_60a
(NrP: 354 NrTr: 311 NrArc: 1496)

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

net check time: 0m 0.001sec

init dd package: 0m 2.382sec


after gc: zbdd nodes used:80131, unused:18669869
after gc: zbdd nodes used:118823, unused:37381177
RS generation: 2m35.985sec


-> reachability set: #nodes 115998 (1.2e+05) #states 81,839,417,852,245 (13)



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

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

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

FORMULA DES-PT-60a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

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

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

FORMULA DES-PT-60a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=p304)
states: 0
-> the formula is FALSE

FORMULA DES-PT-60a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=p303)
states: 0
-> the formula is FALSE

FORMULA DES-PT-60a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=p243)
states: 0
-> the formula is FALSE

FORMULA DES-PT-60a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p122<=p67)
states: 80,476,242,892,437 (13)

after gc: zbdd nodes used:305628, unused:74694372
after gc: zbdd nodes used:269262, unused:149730738MC time: 5m45.018sec

checking: EF [~ [p181<=p139]]
normalized: E [true U ~ [p181<=p139]]

abstracting: (p181<=p139)
states: 81,269,294,718,193 (13)

after gc: zbdd nodes used:361879, unused:299638121MC time: 5m10.220sec

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

abstracting: (p66<=p70)
states: 80,412,159,669,581 (13)
MC time: 4m39.048sec

checking: EF [~ [~ [[1<=p226 | 2<=p348]]]]
normalized: E [true U [1<=p226 | 2<=p348]]

abstracting: (2<=p348)
states: 0
abstracting: (1<=p226)
states: 1,427,258,182,664 (12)
MC time: 4m11.003sec

checking: AG [~ [~ [[1<=p166 | p206<=p53]]]]
normalized: ~ [E [true U ~ [[1<=p166 | p206<=p53]]]]

abstracting: (p206<=p53)
states: 80,412,159,669,581 (13)
abstracting: (1<=p166)
states: 1,387,371,916,336 (12)
MC time: 3m46.001sec

checking: AG [~ [~ [[p21<=p72 | 1<=p307]]]]
normalized: ~ [E [true U ~ [[p21<=p72 | 1<=p307]]]]

abstracting: (1<=p307)
states: 51,592,381,811,416 (13)
abstracting: (p21<=p72)
states: 80,412,159,669,581 (13)
MC time: 3m24.000sec

checking: AG [~ [[3<=p283 & p310<=p308]]]
normalized: ~ [E [true U [3<=p283 & p310<=p308]]]

abstracting: (p310<=p308)
states: 63,515,783,881,557 (13)
abstracting: (3<=p283)
states: 0
-> the formula is TRUE

FORMULA DES-PT-60a-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.426sec

checking: AG [~ [[[p96<=p177 & 3<=p251] & [p20<=p80 & 1<=p15]]]]
normalized: ~ [E [true U [[p20<=p80 & 1<=p15] & [p96<=p177 & 3<=p251]]]]

abstracting: (3<=p251)
states: 0
abstracting: (p96<=p177)
states: 80,435,440,642,929 (13)
abstracting: (1<=p15)
states: 1,427,258,182,664 (12)
abstracting: (p20<=p80)
states: 80,412,173,123,789 (13)
-> the formula is TRUE

FORMULA DES-PT-60a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [[1<=p242 & [[1<=p175 | 1<=p288] | [p232<=p144 & 3<=p114]]]]
normalized: E [true U [1<=p242 & [[p232<=p144 & 3<=p114] | [1<=p175 | 1<=p288]]]]

abstracting: (1<=p288)
states: 30,247,036,040,828 (13)
abstracting: (1<=p175)
states: 1,387,371,916,336 (12)
abstracting: (3<=p114)
states: 0
abstracting: (p232<=p144)
states: 80,436,356,626,109 (13)
abstracting: (1<=p242)
states: 40,951,737,107,124 (13)

after gc: zbdd nodes used:775538, unused:599224462MC time: 3m59.424sec

checking: AG [[[p33<=p233 | ~ [p213<=p218]] | [2<=p300 & [p322<=p350 | p338<=p231]]]]
normalized: ~ [E [true U ~ [[[2<=p300 & [p322<=p350 | p338<=p231]] | [p33<=p233 | ~ [p213<=p218]]]]]]

abstracting: (p213<=p218)
states: 80,412,159,669,581 (13)
abstracting: (p33<=p233)
states: 80,412,159,669,581 (13)
abstracting: (p338<=p231)
states: 63,477,312,246,667 (13)
abstracting: (p322<=p350)
states: 42,421,029,281,320 (13)
abstracting: (2<=p300)
states: 0

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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.002sec

56909 97985 106003 114222 107381 111569 110376 112009 110680 112092 118481 111197 115229 114006 115257 121237 115036 117521 115071 115213 119706 118438 119092
iterations count:2302282 (7402), effective:103367 (332)

initing FirstDep: 0m 0.002sec


sat_reach.icc:155: Timeout: after 344 sec

156394 185770 192332 185799 187946 192952
sat_reach.icc:155: Timeout: after 309 sec

123672 142695 149565 142955 148961 144904 150853 146887
sat_reach.icc:155: Timeout: after 278 sec

143547
sat_reach.icc:155: Timeout: after 250 sec

155434
sat_reach.icc:155: Timeout: after 225 sec

129785 128796 133185 130250 136676
sat_reach.icc:155: Timeout: after 203 sec


sat_reach.icc:155: Timeout: after 228 sec

129385 143800 139644 146496
sat_reach.icc:155: Timeout: after 198 sec

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="DES-PT-60a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/DES-PT-60a.tgz
mv DES-PT-60a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is DES-PT-60a, 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 r011-ebro-149436297200340"
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 ;