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-2265
Executing tool marcie
Input is S_Railroad-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930300958
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433782070874

Model: S_Railroad-PT-010
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 118 NrTr: 156 NrArc: 898)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m19sec


-> reachability set: #nodes 46855 (4.7e+04) #states 2,038,166 (6)



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

checking: EF [[~ [1<=pl_P20_3] & 3<=pl_P39_1]]
normalized: E [true U [3<=pl_P39_1 & ~ [1<=pl_P20_3]]]

abstracting: (1<=pl_P20_3) states: 32
abstracting: (3<=pl_P39_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[pl_P43_1<=pl_P66_1 & [2<=pl_P20_1 & pl_P43_1<=pl_P24_1]]]]
normalized: ~ [E [true U [pl_P43_1<=pl_P66_1 & [2<=pl_P20_1 & pl_P43_1<=pl_P24_1]]]]

abstracting: (pl_P43_1<=pl_P24_1) states: 1,533,561 (6)
abstracting: (2<=pl_P20_1) states: 0
abstracting: (pl_P43_1<=pl_P66_1) states: 1,658,072 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[pl_P31_1<=pl_P14_1 & pl_P5_1<=pl_P34_1] & 1<=pl_P14_5]]]
normalized: ~ [E [true U [1<=pl_P14_5 & [pl_P31_1<=pl_P14_1 & pl_P5_1<=pl_P34_1]]]]

abstracting: (pl_P5_1<=pl_P34_1) states: 1,776,022 (6)
abstracting: (pl_P31_1<=pl_P14_1) states: 2,038,136 (6)
abstracting: (1<=pl_P14_5) states: 70,182 (4)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48sec

checking: AG [[[~ [1<=pl_P31_1] | [3<=pl_P60_1 | 2<=pl_P15_11]] | [[pl_P0_1<=pl_P16_9 | pl_P4_1<=pl_P15_4] | ~ [pl_P20_9<=pl_P26_1]]]]
normalized: ~ [E [true U ~ [[[~ [pl_P20_9<=pl_P26_1] | [pl_P0_1<=pl_P16_9 | pl_P4_1<=pl_P15_4]] | [[3<=pl_P60_1 | 2<=pl_P15_11] | ~ [1<=pl_P31_1]]]]]]

abstracting: (1<=pl_P31_1) states: 30
abstracting: (2<=pl_P15_11) states: 0
abstracting: (3<=pl_P60_1) states: 0
abstracting: (pl_P4_1<=pl_P15_4) states: 1,277,921 (6)
abstracting: (pl_P0_1<=pl_P16_9) states: 1,658,072 (6)
abstracting: (pl_P20_9<=pl_P26_1) states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14sec

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

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

FORMULA Railroad-PT-010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [3<=pl_P31_1]] & pl_P28_1<=pl_P31_1]]
normalized: E [true U [3<=pl_P31_1 & pl_P28_1<=pl_P31_1]]

abstracting: (pl_P28_1<=pl_P31_1) states: 1,513,875 (6)
abstracting: (3<=pl_P31_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[1<=pl_P37_9 & 1<=pl_P51_1] | [pl_P14_3<=pl_P40_1 | pl_P15_5<=pl_P16_7]] & ~ [[1<=pl_P52_1 & 1<=pl_P37_7]]]]
normalized: ~ [E [true U ~ [[~ [[1<=pl_P52_1 & 1<=pl_P37_7]] & [[1<=pl_P37_9 & 1<=pl_P51_1] | [pl_P14_3<=pl_P40_1 | pl_P15_5<=pl_P16_7]]]]]]

abstracting: (pl_P15_5<=pl_P16_7) states: 1,658,072 (6)
abstracting: (pl_P14_3<=pl_P40_1) states: 2,035,832 (6)
abstracting: (1<=pl_P51_1) states: 524,294 (5)
abstracting: (1<=pl_P37_9) states: 0
abstracting: (1<=pl_P37_7) states: 0
abstracting: (1<=pl_P52_1) states: 504,605 (5)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m5sec

checking: EF [[[~ [2<=pl_P37_2] & ~ [2<=pl_P33_1]] & [2<=pl_P25_1 & [3<=pl_P37_8 & pl_P16_7<=pl_P37_7]]]]
normalized: E [true U [[2<=pl_P25_1 & [3<=pl_P37_8 & pl_P16_7<=pl_P37_7]] & [~ [2<=pl_P33_1] & ~ [2<=pl_P37_2]]]]

abstracting: (2<=pl_P37_2) states: 0
abstracting: (2<=pl_P33_1) states: 0
abstracting: (pl_P16_7<=pl_P37_7) states: 1,533,504 (6)
abstracting: (3<=pl_P37_8) states: 0
abstracting: (2<=pl_P25_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[~ [2<=pl_P20_5] | ~ [3<=pl_P21_1]] & [[pl_P37_4<=pl_P61_1 & pl_P37_5<=pl_P15_1] | [3<=pl_P66_1 & pl_P14_7<=pl_P65_1]]]]
normalized: ~ [E [true U ~ [[[[3<=pl_P66_1 & pl_P14_7<=pl_P65_1] | [pl_P37_4<=pl_P61_1 & pl_P37_5<=pl_P15_1]] & [~ [3<=pl_P21_1] | ~ [2<=pl_P20_5]]]]]]

abstracting: (2<=pl_P20_5) states: 0
abstracting: (3<=pl_P21_1) states: 0
abstracting: (pl_P37_5<=pl_P15_1) states: 2,038,166 (6)
abstracting: (pl_P37_4<=pl_P61_1) states: 2,038,166 (6)
abstracting: (pl_P14_7<=pl_P65_1) states: 1,637,996 (6)
abstracting: (3<=pl_P66_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18sec

checking: EF [~ [[[3<=pl_P42_1 | pl_P37_9<=pl_P37_6] | [3<=pl_P37_4 | pl_P65_1<=pl_P3_1]]]]
normalized: E [true U ~ [[[3<=pl_P37_4 | pl_P65_1<=pl_P3_1] | [3<=pl_P42_1 | pl_P37_9<=pl_P37_6]]]]

abstracting: (pl_P37_9<=pl_P37_6) states: 2,038,166 (6)
abstracting: (3<=pl_P42_1) states: 0
abstracting: (pl_P65_1<=pl_P3_1) states: 2,038,166 (6)
abstracting: (3<=pl_P37_4) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [1<=pl_P14_10]] & pl_P14_9<=pl_P67_1]]
normalized: E [true U [1<=pl_P14_10 & pl_P14_9<=pl_P67_1]]

abstracting: (pl_P14_9<=pl_P67_1) states: 1,764,908 (6)
abstracting: (1<=pl_P14_10) states: 254,855 (5)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m25sec

checking: AG [[1<=pl_P2_1 | ~ [~ [pl_P37_6<=pl_P43_1]]]]
normalized: ~ [E [true U ~ [[1<=pl_P2_1 | pl_P37_6<=pl_P43_1]]]]

abstracting: (pl_P37_6<=pl_P43_1) states: 2,038,166 (6)
abstracting: (1<=pl_P2_1) states: 504,605 (5)
-> the formula is TRUE

FORMULA Railroad-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=pl_P37_8 & [~ [pl_P56_1<=pl_P37_4] | ~ [pl_P32_1<=pl_P34_1]]]]
normalized: E [true U [3<=pl_P37_8 & [~ [pl_P32_1<=pl_P34_1] | ~ [pl_P56_1<=pl_P37_4]]]]

abstracting: (pl_P56_1<=pl_P37_4) states: 1,533,561 (6)
abstracting: (pl_P32_1<=pl_P34_1) states: 2,038,163 (6)
abstracting: (3<=pl_P37_8) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Railroad-PT-010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[pl_P20_10<=pl_P28_1 & pl_P15_6<=pl_P37_10] | ~ [pl_P27_1<=pl_P32_1]] | ~ [~ [pl_P12_1<=pl_P57_1]]]]
normalized: ~ [E [true U ~ [[pl_P12_1<=pl_P57_1 | [~ [pl_P27_1<=pl_P32_1] | [pl_P20_10<=pl_P28_1 & pl_P15_6<=pl_P37_10]]]]]]

abstracting: (pl_P15_6<=pl_P37_10) states: 1,533,561 (6)
abstracting: (pl_P20_10<=pl_P28_1) states: 2,038,166 (6)
abstracting: (pl_P27_1<=pl_P32_1) states: 1,533,561 (6)
abstracting: (pl_P12_1<=pl_P57_1) states: 1,533,561 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56sec

checking: EF [[[2<=pl_P32_1 | ~ [3<=pl_P45_1]] & [~ [pl_P35_1<=pl_P62_1] & 1<=pl_P53_1]]]
normalized: E [true U [[1<=pl_P53_1 & ~ [pl_P35_1<=pl_P62_1]] & [2<=pl_P32_1 | ~ [3<=pl_P45_1]]]]

abstracting: (3<=pl_P45_1) states: 0
abstracting: (2<=pl_P32_1) states: 0
abstracting: (pl_P35_1<=pl_P62_1) states: 2,038,166 (6)
abstracting: (1<=pl_P53_1) states: 1,009,267 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 5m33sec


BK_STOP 1433782404650

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

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: 0m0sec

389 724 1909 3994 5283 6471 10293 15063 16171 23002 23562 24670 33373 34753 33741 35579 44164 44398 44260 45048 44636 46433 46437
iterations count:23394 (149), effective:612 (3)

initing FirstDep: 0m0sec

25176 25964 29896 30052 39438 43539 40967 47139 45616 50432 50464 50461 50446 50417 50418 50411 50378 50203 49766 45616
iterations count:20718 (132), effective:453 (2)
1036 1233 1480 1538 2772 2834 4528 4444 5705 5503 9507 9452 9443 9392 8877 14269 13635 20454 20163 41064 40079 40105 40093 40023 40048 40041 39995 39950 39699 38707 37229 37524 37607 37562 37501 37504 37467 37555 37562 37209 36850 43697 43649 44354 44966 45128 45273 45301 45329 45159 45012 44931 44689 44847 44938 45017 44637 44382 43194 44040 44023 44009 43741 44605 44603 44556 44255 44809 44810 44813 44573 42517 45216 45203 45121 45933 45050 45061 45004 43931 45291 45285 45148 44045 45169 45167 45090 44256 45784 45810 45822 45810 45778 45771 45764 45692 45720 45364 43941 43202 43311 43328 43266 43176 43110 43000 42855 42870 42768 49801 52551 52559 52542 52499 52503 52474 52169 51032 46564
iterations count:119251 (764), effective:3239 (20)
46120 45458 46428 47327 47401 47343 47103 47145 47162 46955 45286 46670 46726 46794 46697 46484 46536 45521 47098 47304 47390 47229 47310 47015 47138 47383 46925 46471 46564
iterations count:29322 (187), effective:752 (4)
15765 15799 15795 15800 15775 15763 15770 15729 15670 15376 14502 18311 22796 22950 23013 23141 23141 23091 22992 22953 22929 22854 22903 23026 23150 22907 22769 22211 54832 55022 55100 55204 55144 55119 55080 54880 54826 54775 54673 54678 54595 53902 53633 51343 48056 48275 48463 48769 48779 48767 48360 48308 48150 48179 48124 48217 48448 47991 47394 46369
iterations count:60970 (390), effective:1698 (10)

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_Railroad-PT-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_Railroad-PT-010.tgz
mv S_Railroad-PT-010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_Railroad-PT-010, 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 r218st-ebro-143344930300958"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;