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-2979
Executing tool marcie
Input is FMS-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767800097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463599359046


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: FMS_PT_050
(NrP: 22 NrTr: 20 NrArc: 50)

net check time: 0m 0.000sec

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

init dd package: 0m 3.838sec


RS generation: 0m 3.216sec


-> reachability set: #nodes 35347 (3.5e+04) #states 424,025,581,818,265,596 (17)



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

checking: AG [1<=P2]
normalized: ~ [E [true U ~ [1<=P2]]]

abstracting: (1<=P2) states: 381,583,852,607,400,300 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.453sec

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

abstracting: (2<=P12M3) states: 112,613,672,400,866,910 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.124sec

checking: EF [[3<=P12wM3 & ~ [3<=P3]]]
normalized: E [true U [3<=P12wM3 & ~ [3<=P3]]]

abstracting: (3<=P3) states: 376,058,887,042,443,696 (17)
abstracting: (3<=P12wM3) states: 220,851,535,107,971,040 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.571sec

checking: AG [P12wM3<=P3M2]
normalized: ~ [E [true U ~ [P12wM3<=P3M2]]]

abstracting: (P12wM3<=P3M2) states: 365,376,939,485,666,016 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.387sec

checking: AG [~ [[~ [1<=P12wM3] & 2<=P2s]]]
normalized: ~ [E [true U [2<=P2s & ~ [1<=P12wM3]]]]

abstracting: (1<=P12wM3) states: 342,619,299,282,007,800 (17)
abstracting: (2<=P2s) states: 342,528,633,066,500,790 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.837sec

checking: AG [P12wM3<=P1s]
normalized: ~ [E [true U ~ [P12wM3<=P1s]]]

abstracting: (P12wM3<=P1s) states: 292,457,991,554,696,916 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.755sec

checking: EF [[3<=P2s | P2<=P1wM1]]
normalized: E [true U [3<=P2s | P2<=P1wM1]]

abstracting: (P2<=P1wM1) states: 221,906,752,509,842,946 (17)
abstracting: (3<=P2s) states: 306,665,812,815,780,600 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.063sec

checking: EF [[M3<=M2 & 1<=P2M2]]
normalized: E [true U [M3<=M2 & 1<=P2M2]]

abstracting: (1<=P2M2) states: 200,966,721,526,505,610 (17)
abstracting: (M3<=M2) states: 185,977,576,497,711,960 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.211sec

checking: EF [[~ [[1<=P2wM2 & 2<=P1]] & P2<=P3M2]]
normalized: E [true U [P2<=P3M2 & ~ [[1<=P2wM2 & 2<=P1]]]]

abstracting: (2<=P1) states: 340,655,753,100,914,160 (17)
abstracting: (1<=P2wM2) states: 381,583,852,607,400,300 (17)
abstracting: (P2<=P3M2) states: 317,749,824,305,923,656 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.389sec

checking: EF [~ [[[2<=P2 & 2<=M3] & P2M2<=M3]]]
normalized: E [true U ~ [[P2M2<=M3 & [2<=P2 & 2<=M3]]]]

abstracting: (2<=M3) states: 171,966,938,109,139,836 (17)
abstracting: (2<=P2) states: 342,528,633,066,500,790 (17)
abstracting: (P2M2<=M3) states: 370,716,501,121,060,536 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.647sec

checking: EF [[P1s<=P2wM2 & ~ [[P1wM1<=P1s | P12s<=P1]]]]
normalized: E [true U [P1s<=P2wM2 & ~ [[P1wM1<=P1s | P12s<=P1]]]]

abstracting: (P12s<=P1) states: 292,457,991,554,696,916 (17)
abstracting: (P1wM1<=P1s) states: 223,338,534,507,540,036 (17)
abstracting: (P1s<=P2wM2) states: 227,666,392,615,111,086 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m59.264sec

checking: EF [[~ [~ [P3M2<=M3]] & [[3<=P3M2 & 2<=M1] | [3<=P3M2 & 1<=M2]]]]
normalized: E [true U [P3M2<=M3 & [[3<=P3M2 & 1<=M2] | [3<=P3M2 & 2<=M1]]]]

abstracting: (2<=M1) states: 234,636,585,847,090,596 (17)
abstracting: (3<=P3M2) states: 376,058,887,042,443,696 (17)
abstracting: (1<=M2) states: 223,058,860,291,759,986 (17)
abstracting: (3<=P3M2) states: 376,058,887,042,443,696 (17)
abstracting: (P3M2<=M3) states: 34,405,942,768,438,410 (16)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.481sec

checking: EF [[[[P3<=M1 & P2<=P12s] & ~ [1<=P12M3]] | ~ [3<=P3]]]
normalized: E [true U [~ [3<=P3] | [~ [1<=P12M3] & [P3<=M1 & P2<=P12s]]]]

abstracting: (P2<=P12s) states: 159,844,861,640,693,736 (17)
abstracting: (P3<=M1) states: 42,062,101,295,695,728 (16)
abstracting: (1<=P12M3) states: 252,058,643,709,125,760 (17)
abstracting: (3<=P3) states: 376,058,887,042,443,696 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.835sec

checking: AG [[M1<=P12wM3 | [[P3M2<=P2wP1 | P1M1<=P12s] | ~ [3<=P2s]]]]
normalized: ~ [E [true U ~ [[M1<=P12wM3 | [~ [3<=P2s] | [P3M2<=P2wP1 | P1M1<=P12s]]]]]]

abstracting: (P1M1<=P12s) states: 324,238,592,722,363,176 (17)
abstracting: (P3M2<=P2wP1) states: 120,212,621,033,595,561 (17)
abstracting: (3<=P2s) states: 306,665,812,815,780,600 (17)
abstracting: (M1<=P12wM3) states: 307,390,592,058,786,600 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.577sec

checking: AG [[[[P2M2<=M1 | 1<=M1] & P2wM2<=P3s] | P1wP2<=P1wP2]]
normalized: ~ [E [true U ~ [[P1wP2<=P1wP2 | [P2wM2<=P3s & [P2M2<=M1 | 1<=M1]]]]]]

abstracting: (1<=M1) states: 334,521,580,915,640,196 (17)
abstracting: (P2M2<=M1) states: 381,589,155,692,653,896 (17)
abstracting: (P2wM2<=P3s) states: 317,749,824,305,923,656 (17)
abstracting: (P1wP2<=P1wP2) states: 424,025,581,818,265,596 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.251sec

checking: EF [[3<=P12wM3 & [~ [P2wP1<=P1s] & [M1<=P12 & P12wM3<=M2]]]]
normalized: E [true U [3<=P12wM3 & [[M1<=P12 & P12wM3<=M2] & ~ [P2wP1<=P1s]]]]

abstracting: (P2wP1<=P1s) states: 221,906,752,509,842,946 (17)
abstracting: (P12wM3<=M2) states: 116,509,265,536,688,466 (17)
abstracting: (M1<=P12) states: 307,390,592,058,786,600 (17)
abstracting: (3<=P12wM3) states: 220,851,535,107,971,040 (17)
-> the formula is FALSE

FORMULA FMS-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.177sec


Total processing time: 4m32.710sec


BK_STOP 1463599631988

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

check for maximal unmarked siphon
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

8354 18408 51776
iterations count:3620 (181), effective:800 (40)

initing FirstDep: 0m 0.000sec


iterations count:170 (8), effective:50 (2)

iterations count:180 (9), effective:28 (1)

iterations count:311 (15), effective:90 (4)

iterations count:751 (37), effective:114 (5)

iterations count:341 (17), effective:127 (6)
210576
iterations count:1570 (78), effective:231 (11)

iterations count:65 (3), effective:12 (0)

iterations count:312 (15), effective:50 (2)

iterations count:713 (35), effective:199 (9)

iterations count:168 (8), effective:50 (2)
209228 151183
iterations count:2563 (128), effective:520 (26)

iterations count:68 (3), effective:48 (2)
35464
iterations count:1009 (50), effective:297 (14)

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="FMS-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/FMS-PT-050.tgz
mv FMS-PT-050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is FMS-PT-050, 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 r053kn-smll-146358767800097"
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 ;