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-3254
Executing tool marcie
Input is MultiwaySync-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473900223
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494459493388

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: MultiwaySync_PT_none
(NrP: 222 NrTr: 472 NrArc: 1496)

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

net check time: 0m 0.000sec

init dd package: 0m 1.067sec


RS generation: 0m 0.423sec


-> reachability set: #nodes 292 (2.9e+02) #states 52,595,997,309,385,113,601 (19)



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

checking: EF [1<=p124]
normalized: E [true U 1<=p124]

abstracting: (1<=p124)
states: 3,669,488,184,375,705,600 (18)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.844sec

checking: EF [1<=p86]
normalized: E [true U 1<=p86]

abstracting: (1<=p86)
states: 2,517,893,488,215,244,800 (18)

after gc: zbdd nodes used:996, unused:18749004-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.367sec

checking: AG [p50<=p83]
normalized: ~ [E [true U ~ [p50<=p83]]]

abstracting: (p50<=p83)
states: 49,658,454,906,467,328,001 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.603sec

checking: EF [[p191<=p97 & 1<=p12]]
normalized: E [true U [p191<=p97 & 1<=p12]]

abstracting: (1<=p12)
states: 3,068,099,843,047,464,960 (18)
abstracting: (p191<=p97)
states: 35,903,296,035,661,824,001 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: EF [[3<=p27 & p74<=p187]]
normalized: E [true U [3<=p27 & p74<=p187]]

abstracting: (p74<=p187)
states: 50,404,497,421,494,067,201 (19)
abstracting: (3<=p27)
states: 0
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[p144<=p36 | 2<=p203]] & 1<=p27]]
normalized: E [true U [1<=p27 & ~ [[p144<=p36 | 2<=p203]]]]

abstracting: (2<=p203)
states: 0
abstracting: (p144<=p36)
states: 51,413,606,672,197,386,241 (19)
abstracting: (1<=p27)
states: 3,068,099,843,047,464,960 (18)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.111sec

checking: AG [[[~ [p163<=p195] & 3<=p176] | p112<=p192]]
normalized: ~ [E [true U ~ [[p112<=p192 | [3<=p176 & ~ [p163<=p195]]]]]]

abstracting: (p163<=p195)
states: 50,457,948,638,271,897,601 (19)
abstracting: (3<=p176)
states: 0
abstracting: (p112<=p192)
states: 51,476,933,536,845,004,801 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.940sec

checking: EF [[[[3<=p112 & 1<=p74] | ~ [p114<=p78]] & 2<=p106]]
normalized: E [true U [2<=p106 & [~ [p114<=p78] | [3<=p112 & 1<=p74]]]]

abstracting: (1<=p74)
states: 3,287,249,831,836,569,600 (18)
abstracting: (3<=p112)
states: 0
abstracting: (p114<=p78)
states: 49,658,454,906,467,328,001 (19)
abstracting: (2<=p106)
states: 0
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[[2<=p8 | p130<=p135] | [2<=p137 & p163<=p28]]]]
normalized: E [true U ~ [[[2<=p137 & p163<=p28] | [2<=p8 | p130<=p135]]]]

abstracting: (p130<=p135)
states: 49,334,230,034,384,486,401 (19)
abstracting: (2<=p8)
states: 0
abstracting: (p163<=p28)
states: 49,869,985,253,715,763,201 (19)
abstracting: (2<=p137)
states: 0
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.286sec

checking: EF [[[[3<=p215 & 3<=p181] & 1<=p21] & [p26<=p140 | 1<=p52]]]
normalized: E [true U [[p26<=p140 | 1<=p52] & [1<=p21 & [3<=p215 & 3<=p181]]]]

abstracting: (3<=p181)
states: 0
abstracting: (3<=p215)
states: 0
abstracting: (1<=p21)
states: 1,753,199,910,312,837,120 (18)
abstracting: (1<=p52)
states: 3,068,099,843,047,464,960 (18)
abstracting: (p26<=p140)
states: 49,706,275,364,189,245,441 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[p157<=p161 | p99<=p159] & [p140<=p32 & 3<=p199]]]]
normalized: ~ [E [true U [[p140<=p32 & 3<=p199] & [p157<=p161 | p99<=p159]]]]

abstracting: (p99<=p159)
states: 49,593,631,090,375,065,601 (19)
abstracting: (p157<=p161)
states: 42,974,778,289,375,641,601 (19)
abstracting: (3<=p199)
states: 0
abstracting: (p140<=p32)
states: 49,945,811,398,447,104,001 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[2<=p115 | [[3<=p201 | 1<=p184] | [p23<=p195 & p48<=p217]]]]
normalized: ~ [E [true U ~ [[2<=p115 | [[3<=p201 | 1<=p184] | [p23<=p195 & p48<=p217]]]]]]

abstracting: (p48<=p217)
states: 51,427,197,369,176,555,521 (19)
abstracting: (p23<=p195)
states: 50,550,597,414,020,136,961 (19)
abstracting: (1<=p184)
states: 17,531,999,103,128,371,200 (19)
abstracting: (3<=p201)
states: 0
abstracting: (2<=p115)
states: 0
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.887sec

checking: AG [[p123<=p94 & [[p128<=p47 | p13<=p17] | ~ [1<=p44]]]]
normalized: ~ [E [true U ~ [[[~ [1<=p44] | [p128<=p47 | p13<=p17]] & p123<=p94]]]]

abstracting: (p123<=p94)
states: 49,473,028,641,831,321,601 (19)
abstracting: (p13<=p17)
states: 49,527,897,466,337,648,641 (19)
abstracting: (p128<=p47)
states: 49,524,499,792,092,856,321 (19)
abstracting: (1<=p44)
states: 3,068,099,843,047,464,960 (18)

after gc: zbdd nodes used:5507, unused:37494493-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.336sec

checking: EF [[[3<=p114 | [p141<=p166 & 3<=p38]] & ~ [[p151<=p84 & p185<=p67]]]]
normalized: E [true U [~ [[p151<=p84 & p185<=p67]] & [[p141<=p166 & 3<=p38] | 3<=p114]]]

abstracting: (3<=p114)
states: 0
abstracting: (3<=p38)
states: 0
abstracting: (p141<=p166)
states: 49,724,548,222,017,945,601 (19)
abstracting: (p185<=p67)
states: 35,429,248,187,571,916,801 (19)
abstracting: (p151<=p84)
states: 49,684,479,645,363,609,601 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[p50<=p160 | p210<=p29] & [p62<=p73 | 1<=p192]] | p22<=p145]]
normalized: ~ [E [true U ~ [[[[p62<=p73 | 1<=p192] & [p50<=p160 | p210<=p29]] | p22<=p145]]]]

abstracting: (p22<=p145)
states: 50,883,569,490,009,784,321 (19)
abstracting: (p210<=p29)
states: 37,693,798,071,725,998,081 (19)
abstracting: (p50<=p160)
states: 49,602,729,169,826,611,201 (19)
abstracting: (1<=p192)
states: 17,531,999,103,128,371,200 (19)
abstracting: (p62<=p73)
states: 49,308,747,477,548,544,001 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.643sec

checking: EF [[[3<=p14 | [p199<=p114 & 3<=p147]] & [~ [p75<=p39] & [p217<=p23 & p170<=p45]]]]
normalized: E [true U [[[p199<=p114 & 3<=p147] | 3<=p14] & [[p217<=p23 & p170<=p45] & ~ [p75<=p39]]]]

abstracting: (p75<=p39)
states: 49,500,503,717,739,010,561 (19)
abstracting: (p170<=p45)
states: 49,469,101,127,882,035,201 (19)
abstracting: (p217<=p23)
states: 36,086,698,153,939,230,721 (19)
abstracting: (3<=p14)
states: 0
abstracting: (3<=p147)
states: 0
abstracting: (p199<=p114)
states: 36,089,806,664,418,508,801 (19)
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 34409531(3.4e+07)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 18453030 19856712 38309742
used/not used/entry size/cache size: 3432557 63676307 16 1024MB
basic ops cache: hits/miss/sum: 35859898 39403302 75263200
used/not used/entry size/cache size: 10648910 6128306 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 7150 7571 14721
used/not used/entry size/cache size: 2814 2094338 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61101080
1 5733257
2 266012
3 8313
4 197
5 4
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m26.909sec


BK_STOP 1494459520328

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

207
iterations count:168914 (357), effective:1603 (3)

initing FirstDep: 0m 0.001sec


iterations count:18693 (39), effective:254 (0)

iterations count:35458 (75), effective:357 (0)

iterations count:8543 (18), effective:64 (0)

iterations count:8730 (18), effective:51 (0)

iterations count:27148 (57), effective:295 (0)

iterations count:36449 (77), effective:363 (0)

iterations count:17025 (36), effective:230 (0)

iterations count:23456 (49), effective:156 (0)

iterations count:35378 (74), effective:483 (1)

iterations count:29004 (61), effective:190 (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="MultiwaySync-PT-none"
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/MultiwaySync-PT-none.tgz
mv MultiwaySync-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is MultiwaySync-PT-none, 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 r031-blw7-149440473900223"
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 ;