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 S_Raft-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423800025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495084981894

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: Raft_PT_09
(NrP: 413 NrTr: 710 NrArc: 2728)

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

net check time: 0m 0.000sec

init dd package: 0m 1.200sec


after gc: zbdd nodes used:644, unused:18749356
after gc: zbdd nodes used:761, unused:37499239
after gc: zbdd nodes used:1310, unused:74998690
after gc: zbdd nodes used:1501, unused:149998499
RS generation: 5m 8.715sec


-> reachability set: #nodes 729 (7.3e+02) #states 8,271,806,008,610,145,762,241,853,464,404,841,918,355,479,536,534,185,624,421 (57)



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

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [2<=p130]]
normalized: ~ [E [true U 2<=p130]]

abstracting: (2<=p130)
states: 0
-> the formula is TRUE

FORMULA Raft-PT-09-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-09-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p197 & p44<=p338]]
normalized: E [true U [2<=p197 & p44<=p338]]

abstracting: (p44<=p338)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (2<=p197)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[~ [p239<=p26] & p265<=p77]]]
normalized: ~ [E [true U [p265<=p77 & ~ [p239<=p26]]]]

abstracting: (p239<=p26)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p265<=p77)
states: 6,948,317,028,525,301,482,447,599,557,092,901,352,650,180,159,092,779,374,421 (57)
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.916sec

checking: EF [[p194<=p84 & [~ [p261<=p398] & ~ [p346<=p4]]]]
normalized: E [true U [p194<=p84 & [~ [p261<=p398] & ~ [p346<=p4]]]]

abstracting: (p346<=p4)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p261<=p398)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p194<=p84)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
-> the formula is TRUE

FORMULA Raft-PT-09-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.082sec

checking: EF [[[2<=p50 | [p218<=p146 | p110<=p204]] & 2<=p151]]
normalized: E [true U [2<=p151 & [2<=p50 | [p218<=p146 | p110<=p204]]]]

abstracting: (p110<=p204)
states: 6,948,317,028,525,301,482,447,599,557,092,901,352,650,180,159,092,779,374,421 (57)
abstracting: (p218<=p146)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (2<=p50)
states: 0
abstracting: (2<=p151)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[p34<=p149 & [p249<=p280 | 3<=p112]] | p77<=p43]]
normalized: ~ [E [true U ~ [[p77<=p43 | [p34<=p149 & [p249<=p280 | 3<=p112]]]]]]

abstracting: (3<=p112)
states: 0
abstracting: (p249<=p280)
states: 6,948,317,057,755,334,229,065,657,921,166,598,006,975,840,552,211,430,233,941 (57)
abstracting: (p34<=p149)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p77<=p43)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.101sec

checking: EF [~ [[[p41<=p48 | p157<=p169] | [p281<=p399 | 3<=p16]]]]
normalized: E [true U ~ [[[p281<=p399 | 3<=p16] | [p41<=p48 | p157<=p169]]]]

abstracting: (p157<=p169)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p41<=p48)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (3<=p16)
states: 0
abstracting: (p281<=p399)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
-> the formula is TRUE

FORMULA Raft-PT-09-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.105sec

checking: EF [[[[p51<=p117 & 3<=p390] & 1<=p311] & ~ [[3<=p394 & p271<=p151]]]]
normalized: E [true U [~ [[3<=p394 & p271<=p151]] & [1<=p311 & [p51<=p117 & 3<=p390]]]]

abstracting: (3<=p390)
states: 0
abstracting: (p51<=p117)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (1<=p311)
states: 1,654,361,195,876,022,603,124,759,020,066,229,052,805,963,828,683,106,952,980 (57)
abstracting: (p271<=p151)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (3<=p394)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [p342<=p242] & ~ [p229<=p114]] | [p241<=p309 | [p327<=p358 | 2<=p210]]]]
normalized: ~ [E [true U ~ [[[~ [p342<=p242] & ~ [p229<=p114]] | [p241<=p309 | [p327<=p358 | 2<=p210]]]]]]

abstracting: (2<=p210)
states: 0
abstracting: (p327<=p358)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p241<=p309)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p229<=p114)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p342<=p242)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.967sec

checking: AG [[[[1<=p73 & p331<=p357] | ~ [p238<=p150]] | [[p231<=p133 | p301<=p23] | ~ [p29<=p95]]]]
normalized: ~ [E [true U ~ [[[[p231<=p133 | p301<=p23] | ~ [p29<=p95]] | [~ [p238<=p150] | [1<=p73 & p331<=p357]]]]]]

abstracting: (p331<=p357)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (1<=p73)
states: 1,654,361,195,876,022,603,124,759,020,066,229,052,805,963,828,683,106,952,980 (57)
abstracting: (p238<=p150)
states: 6,948,317,057,755,334,229,065,657,921,166,598,006,975,840,552,211,430,233,941 (57)
abstracting: (p29<=p95)
states: 6,948,317,057,755,334,229,065,657,921,166,598,006,975,840,552,211,430,233,941 (57)
abstracting: (p301<=p23)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
abstracting: (p231<=p133)
states: 6,948,317,050,447,826,042,411,143,330,148,173,843,394,425,453,931,767,519,061 (57)
-> the formula is FALSE

FORMULA Raft-PT-09-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.175sec

totally nodes used: 173164560(1.7e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 371453737 715595548 1087049285
used/not used/entry size/cache size: 62403397 4705467 16 1024MB
basic ops cache: hits/miss/sum: 415143853 724257936 1139401789
used/not used/entry size/cache size: 16776926 290 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: 10774 12166 22940
used/not used/entry size/cache size: 12116 2085036 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 41251866
1 20144419
2 4847275
3 766241
4 89944
5 8453
6 623
7 39
8 4
9 0
>= 10 0

Total processing time: 5m18.928sec


BK_STOP 1495085300856

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

300 518 539 721 1384 585 1038 449 773 912 739 856 1379 739 950 985 649 1224 655 751 894 1210 566 741 1222 1281 1558 1256 930 1113 1241 962 1236 925 1172 1544 949 1184 1627 969 885 1181 655 1051 1419 1331 847 1080 1625 771 2083 2294 1982 2020 877 795 1252 1610 1697 1331 1371 1454 810 1292 1463 1007 1637 1618 1271 589 1213 2099 1501 1312 1228 1292 985 1870 1210 1293 1040 602 1104 1463 1505 1029 1202 873 2532 1725 2129 2232 2039 1599 1123 1397 1250 1075 1575 1647 1170 1131 1661 1474 1978 1813 1152 1781 1325 1489 1282 1342 1192 1175 1755 1682 2169 1467 1149 1790 1403 1383 1395 1813 1470 925 1616 1417 1296 1525 2029 1568 1374 1631 1209 2154 1223 1624 1139 1709 1469 728 1925 1584 1329 2602 1420 2026 1876 2524 1981 2414 1722 1520 1410 1778 1667 1614 1805 1270 1969 1686 1972 1555 1555 961 1740 1643 1822 1719 1855 1486 1982 1019 1642 1330 1886 731 1914 2486 1670 2135 697 1590 1485 1668 1217 1663 1513 2009 1507 1521 1427 1688 1000 1533 1742 1785 2202 1307 2116 2642 1215 1702 1003 1511 2003 1366 2178 1322 2155 2070 1429 1697 1033 1806 1772 1861 1990 1326 2233 1826
iterations count:22257788 (31348), effective:127562 (179)

initing FirstDep: 0m 0.000sec


iterations count:3796 (5), effective:31 (0)

iterations count:4209 (5), effective:52 (0)

iterations count:5699 (8), effective:51 (0)

iterations count:7364 (10), effective:72 (0)

iterations count:3568 (5), effective:56 (0)

iterations count:8004 (11), effective:101 (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="S_Raft-PT-09"
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/S_Raft-PT-09.tgz
mv S_Raft-PT-09 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 S_Raft-PT-09, 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 r141-csrt-149443423800025"
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 ;