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 S_FMS-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259400664
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464439513551


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_020
(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 4.072sec


RS generation: 0m 0.151sec


-> reachability set: #nodes 6052 (6.1e+03) #states 6,029,168,852,784 (12)



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

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

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

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

MC time: 0m 0.002sec

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

abstracting: (P2<=P1M1) states: 2,465,094,546,684 (12)
-> the formula is FALSE

FORMULA FMS-PT-020-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: EF [~ [~ [[2<=P1 & 3<=M2]]]]
normalized: E [true U [2<=P1 & 3<=M2]]

abstracting: (3<=M2) states: 0
abstracting: (2<=P1) states: 3,524,136,450,219 (12)
-> the formula is FALSE

FORMULA FMS-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (P2wM2<=P2wM2) states: 6,029,168,852,784 (12)
-> the formula is TRUE

FORMULA FMS-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [~ [[1<=P12M3 & M2<=P1M1]]]]
normalized: E [true U [1<=P12M3 & M2<=P1M1]]

abstracting: (M2<=P1M1) states: 4,843,203,861,804 (12)
abstracting: (1<=P12M3) states: 2,982,906,854,004 (12)
-> the formula is TRUE

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

MC time: 0m 0.209sec

checking: AG [[2<=P2wP1 | P12M3<=M1]]
normalized: ~ [E [true U ~ [[2<=P2wP1 | P12M3<=M1]]]]

abstracting: (P12M3<=M1) states: 5,319,785,009,154 (12)
abstracting: (2<=P2wP1) states: 3,621,669,084,726 (12)
-> the formula is FALSE

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

MC time: 0m 1.098sec

checking: AG [[3<=P2wM2 | ~ [[P1M1<=P3s & 1<=P12s]]]]
normalized: ~ [E [true U ~ [[3<=P2wM2 | ~ [[P1M1<=P3s & 1<=P12s]]]]]]

abstracting: (1<=P12s) states: 3,634,972,284,405 (12)
abstracting: (P1M1<=P3s) states: 5,397,628,708,380 (12)
abstracting: (3<=P2wM2) states: 2,743,295,249,310 (12)
-> the formula is FALSE

FORMULA FMS-PT-020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.543sec

checking: AG [[[~ [2<=P3M2] & [3<=P2M2 & P1<=M3]] | ~ [[2<=M2 | 2<=P2M2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=M2 | 2<=P2M2]] | [[3<=P2M2 & P1<=M3] & ~ [2<=P3M2]]]]]]

abstracting: (2<=P3M2) states: 4,959,056,632,160 (12)
abstracting: (P1<=M3) states: 2,735,160,527,946 (12)
abstracting: (3<=P2M2) states: 0
abstracting: (2<=P2M2) states: 0
abstracting: (2<=M2) states: 0
-> the formula is TRUE

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

MC time: 0m 0.077sec

checking: EF [[P2d<=P3 & [[2<=P1 & P2<=M1] & 2<=P1s]]]
normalized: E [true U [P2d<=P3 & [2<=P1s & [2<=P1 & P2<=M1]]]]

abstracting: (P2<=M1) states: 3,031,177,958,424 (12)
abstracting: (2<=P1) states: 3,524,136,450,219 (12)
abstracting: (2<=P1s) states: 3,524,136,450,219 (12)
abstracting: (P2d<=P3) states: 4,600,197,985,012 (12)
-> the formula is TRUE

FORMULA FMS-PT-020-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.308sec

checking: EF [~ [[[2<=P3s & M1<=P1s] | [P2s<=M1 | 2<=P2M2]]]]
normalized: E [true U ~ [[[P2s<=M1 | 2<=P2M2] | [2<=P3s & M1<=P1s]]]]

abstracting: (M1<=P1s) states: 3,902,713,985,940 (12)
abstracting: (2<=P3s) states: 4,959,056,632,160 (12)
abstracting: (2<=P2M2) states: 0
abstracting: (P2s<=M1) states: 3,031,177,958,424 (12)
-> the formula is TRUE

FORMULA FMS-PT-020-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.655sec

checking: EF [[[[3<=P12s & 1<=M2] & [3<=P12M3 & P1M1<=P1]] | 1<=P12M3]]
normalized: E [true U [1<=P12M3 | [[3<=P12M3 & P1M1<=P1] & [3<=P12s & 1<=M2]]]]

abstracting: (1<=M2) states: 3,377,140,895,205 (12)
abstracting: (3<=P12s) states: 1,226,112,110,916 (12)
abstracting: (P1M1<=P1) states: 4,512,423,037,353 (12)
abstracting: (3<=P12M3) states: 0
abstracting: (1<=P12M3) states: 2,982,906,854,004 (12)
-> the formula is TRUE

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

MC time: 0m 0.052sec

checking: EF [~ [[[P12<=M2 & 1<=P3] & [P1M1<=P3 & 2<=M3]]]]
normalized: E [true U ~ [[[P1M1<=P3 & 2<=M3] & [P12<=M2 & 1<=P3]]]]

abstracting: (1<=P3) states: 5,481,062,593,440 (12)
abstracting: (P12<=M2) states: 3,229,664,150,097 (12)
abstracting: (2<=M3) states: 3,046,261,998,780 (12)
abstracting: (P1M1<=P3) states: 5,397,628,708,380 (12)
-> the formula is TRUE

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

MC time: 0m 0.271sec

checking: AG [[[~ [1<=P12M3] & ~ [P1<=P12]] | ~ [[P12M3<=P3s | P3s<=M1]]]]
normalized: ~ [E [true U ~ [[~ [[P12M3<=P3s | P3s<=M1]] | [~ [P1<=P12] & ~ [1<=P12M3]]]]]]

abstracting: (1<=P12M3) states: 2,982,906,854,004 (12)
abstracting: (P1<=P12) states: 2,639,844,392,724 (12)
abstracting: (P3s<=M1) states: 1,460,668,996,410 (12)
abstracting: (P12M3<=P3s) states: 5,661,284,937,740 (12)
-> the formula is FALSE

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

MC time: 0m 0.138sec

checking: EF [[[[P2d<=M3 & P1<=P2wM2] | 1<=P12s] & [2<=P12M3 & 1<=P2wM2]]]
normalized: E [true U [[2<=P12M3 & 1<=P2wM2] & [1<=P12s | [P2d<=M3 & P1<=P2wM2]]]]

abstracting: (P1<=P2wM2) states: 3,518,954,295,780 (12)
abstracting: (P2d<=M3) states: 2,635,844,230,173 (12)
abstracting: (1<=P12s) states: 3,634,972,284,405 (12)
abstracting: (1<=P2wM2) states: 4,706,323,937,700 (12)
abstracting: (2<=P12M3) states: 1,117,007,022,054 (12)
-> the formula is TRUE

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

MC time: 0m 1.193sec

checking: EF [[[~ [3<=M1] & [3<=P1M1 & P1<=M3]] & [P2<=P3M2 & ~ [P2d<=M2]]]]
normalized: E [true U [[P2<=P3M2 & ~ [P2d<=M2]] & [[3<=P1M1 & P1<=M3] & ~ [3<=M1]]]]

abstracting: (3<=M1) states: 2,114,591,718,855 (12)
abstracting: (P1<=M3) states: 2,735,160,527,946 (12)
abstracting: (3<=P1M1) states: 975,678,496,485 (11)
abstracting: (P2d<=M2) states: 1,920,576,892,542 (12)
abstracting: (P2<=P3M2) states: 4,600,197,985,012 (12)
-> the formula is TRUE

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

MC time: 0m 1.268sec

checking: AG [[[~ [1<=P12wM3] & [P12<=P1 | M1<=M3]] | [1<=P1wP2 & [P1s<=P1wP2 & P3s<=P2M2]]]]
normalized: ~ [E [true U ~ [[[1<=P1wP2 & [P1s<=P1wP2 & P3s<=P2M2]] | [[P12<=P1 | M1<=M3] & ~ [1<=P12wM3]]]]]]

abstracting: (1<=P12wM3) states: 3,634,972,284,405 (12)
abstracting: (M1<=M3) states: 2,858,474,465,385 (12)
abstracting: (P12<=P1) states: 4,421,411,310,855 (12)
abstracting: (P3s<=P2M2) states: 777,719,069,524 (11)
abstracting: (P1s<=P1wP2) states: 3,396,001,327,950 (12)
abstracting: (1<=P1wP2) states: 4,645,008,931,794 (12)
-> the formula is FALSE

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

MC time: 0m 0.366sec


Total processing time: 0m13.101sec


BK_STOP 1464439526695

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

5513
iterations count:1460 (73), effective:320 (16)

initing FirstDep: 0m 0.000sec


iterations count:80 (4), effective:20 (1)

iterations count:167 (8), effective:27 (1)
14355
iterations count:1554 (77), effective:246 (12)

iterations count:316 (15), effective:56 (2)

iterations count:412 (20), effective:96 (4)

iterations count:287 (14), effective:72 (3)

iterations count:100 (5), effective:14 (0)

iterations count:40 (2), effective:20 (1)

iterations count:83 (4), effective:22 (1)

iterations count:607 (30), effective:137 (6)

iterations count:478 (23), effective:121 (6)

iterations count:179 (8), effective:37 (1)

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_FMS-PT-020"
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/S_FMS-PT-020.tgz
mv S_FMS-PT-020 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 S_FMS-PT-020, 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 r149kn-smll-146416259400664"
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 ;