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

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

=== Now, execution of the tool begins

BK_START 1495084977610

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_08
(NrP: 328 NrTr: 568 NrArc: 2163)

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

net check time: 0m 0.000sec

init dd package: 0m 1.304sec


after gc: zbdd nodes used:833, unused:18749167
after gc: zbdd nodes used:934, unused:37499066
after gc: zbdd nodes used:1230, unused:74998770
RS generation: 2m16.297sec


-> reachability set: #nodes 576 (5.8e+02) #states 10,842,014,919,207,705,921,305,258,741,207,268,478,893,583,381 (46)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [~ [p283<=p39]]
normalized: E [true U ~ [p283<=p39]]

abstracting: (p283<=p39)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
-> the formula is TRUE

FORMULA Raft-PT-08-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.416sec

checking: EF [~ [[~ [3<=p221] & p266<=p215]]]
normalized: E [true U ~ [[~ [3<=p221] & p266<=p215]]]

abstracting: (p266<=p215)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (3<=p221)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.244sec

checking: EF [~ [~ [[1<=p294 & p46<=p37]]]]
normalized: E [true U [1<=p294 & p46<=p37]]

abstracting: (p46<=p37)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (1<=p294)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
-> the formula is TRUE

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

MC time: 0m 0.266sec

checking: AG [[3<=p164 | [p188<=p96 | ~ [1<=p274]]]]
normalized: ~ [E [true U ~ [[3<=p164 | [p188<=p96 | ~ [1<=p274]]]]]]

abstracting: (1<=p274)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
abstracting: (p188<=p96)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (3<=p164)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.492sec

checking: EF [~ [[~ [3<=p65] | [p146<=p114 | p296<=p160]]]]
normalized: E [true U ~ [[[p146<=p114 | p296<=p160] | ~ [3<=p65]]]]

abstracting: (3<=p65)
states: 0
abstracting: (p296<=p160)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (p146<=p114)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [[[[3<=p263 & 1<=p126] & [1<=p122 & 2<=p178]] & ~ [~ [2<=p192]]]]
normalized: E [true U [2<=p192 & [[1<=p122 & 2<=p178] & [3<=p263 & 1<=p126]]]]

abstracting: (1<=p126)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
abstracting: (3<=p263)
states: 0
abstracting: (2<=p178)
states: 0
abstracting: (1<=p122)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
abstracting: (2<=p192)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[[[p77<=p260 & p98<=p125] | ~ [1<=p123]] | ~ [3<=p107]]]
normalized: ~ [E [true U ~ [[~ [3<=p107] | [~ [1<=p123] | [p77<=p260 & p98<=p125]]]]]]

abstracting: (p98<=p125)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (p77<=p260)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (1<=p123)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
abstracting: (3<=p107)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [[[3<=p133 & ~ [2<=p70]] | [2<=p37 & [p22<=p241 | 2<=p135]]]]
normalized: E [true U [[2<=p37 & [p22<=p241 | 2<=p135]] | [3<=p133 & ~ [2<=p70]]]]

abstracting: (2<=p70)
states: 0
abstracting: (3<=p133)
states: 0
abstracting: (2<=p135)
states: 0
abstracting: (p22<=p241)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (2<=p37)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [~ [[[p37<=p80 | 2<=p10] | [p286<=p187 | 2<=p300]]]]
normalized: E [true U ~ [[[p286<=p187 | 2<=p300] | [p37<=p80 | 2<=p10]]]]

abstracting: (2<=p10)
states: 0
abstracting: (p37<=p80)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (2<=p300)
states: 0
abstracting: (p286<=p187)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
-> the formula is TRUE

FORMULA Raft-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.405sec

checking: EF [[~ [[p322<=p36 | p203<=p212]] & [[p171<=p324 | p223<=p171] & [1<=p321 & 2<=p307]]]]
normalized: E [true U [~ [[p322<=p36 | p203<=p212]] & [[1<=p321 & 2<=p307] & [p171<=p324 | p223<=p171]]]]

abstracting: (p223<=p171)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (p171<=p324)
states: 9,107,292,804,360,366,510,647,188,113,313,791,467,685,179,205 (45)
abstracting: (2<=p307)
states: 0
abstracting: (1<=p321)
states: 2,168,402,983,841,541,184,261,051,748,241,453,695,778,716,676 (45)
abstracting: (p203<=p212)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (p322<=p36)
states: 9,107,292,464,077,999,589,708,724,649,939,184,035,916,967,749 (45)
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: AG [[[p211<=p321 | [p124<=p187 | 2<=p277]] & [[1<=p266 | p163<=p270] | [3<=p151 & p39<=p277]]]]
normalized: ~ [E [true U ~ [[[p211<=p321 | [p124<=p187 | 2<=p277]] & [[1<=p266 | p163<=p270] | [3<=p151 & p39<=p277]]]]]]

abstracting: (p39<=p277)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (3<=p151)
states: 0
abstracting: (p163<=p270)
states: 9,107,293,144,642,733,431,585,651,576,688,398,899,453,390,661 (45)
abstracting: (1<=p266)
states: 2,168,402,643,559,174,263,322,588,284,866,846,264,010,505,220 (45)
abstracting: (2<=p277)
states: 0
abstracting: (p124<=p187)
states: 9,107,292,719,289,774,780,412,572,247,470,139,609,743,126,341 (45)
abstracting: (p211<=p321)
states: 9,107,292,804,360,366,510,647,188,113,313,791,467,685,179,205 (45)
-> the formula is FALSE

FORMULA Raft-PT-08-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.707sec

totally nodes used: 75472087(7.5e+07)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 177120626 312821063 489941689
used/not used/entry size/cache size: 28211296 38897568 16 1024MB
basic ops cache: hits/miss/sum: 165309311 282103523 447412834
used/not used/entry size/cache size: 15424300 1352916 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: 9273 10486 19759
used/not used/entry size/cache size: 10454 2086698 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 57946298
1 8507849
2 623161
3 30351
4 1165
5 40
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 2m21.343sec


BK_STOP 1495085118985

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

530 457 622 543 467 473 585 757 1035 981 830 596 977 764 723 674 424 587 582 1296 579 1449 905 1053 788 1086 929 993 1015 1116 958 1615 969 1415 755 1105 905 1059 1957 1722 1689 1203 1387 1265 1381 1349 1004 1154 1363 1394 1261 1415 1363 1344 892 741 1289 1201 1227 1069 1322 1431 987 520 751 749 688 1946 1530 936 2112 1825 2031 910 1224 1671 1337 1116 1538 1592 1157 1482 1668 1280 1710 1291 1277 1492 1519 1537 1553 1159 1054 1506 1374 1524 1565 1480 1208 1497 1401 1426 1608 1013 1093 1823 1480 798 1428
iterations count:10955025 (19287), effective:76564 (134)

initing FirstDep: 0m 0.000sec


iterations count:2174 (3), effective:27 (0)

iterations count:1948 (3), effective:26 (0)

iterations count:2247 (3), effective:27 (0)

iterations count:3117 (5), effective:46 (0)

iterations count:4125 (7), effective:49 (0)

iterations count:3695 (6), effective:61 (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-08"
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-08.tgz
mv S_Raft-PT-08 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-08, 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-149443423800016"
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 ;