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-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259300633
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464439213320


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: FMS_PT_002
(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.880sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 139 (1.4e+02) #states 3,444 (3)



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

checking: ~ [EX [EF [3<=P1d]]]
normalized: ~ [EX [E [true U 3<=P1d]]]

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

FORMULA FMS-PT-002-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA FMS-PT-002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [AF [2<=M3]] & EF [3<=P12M3]]
normalized: [E [true U 3<=P12M3] & E [true U ~ [EG [~ [2<=M3]]]]]

abstracting: (2<=M3) states: 3,204 (3)
.
EG iterations: 1
abstracting: (3<=P12M3) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (P2wM2<=P12) states: 2,580 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[AX [P1d<=P1s] & EF [3<=P2d]]]
normalized: ~ [EX [~ [[E [true U 3<=P2d] & ~ [EX [~ [P1d<=P1s]]]]]]]

abstracting: (P1d<=P1s) states: 2,700 (3)
.abstracting: (3<=P2d) states: 0
.-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [AF [P2s<=P1M1] U EX [3<=P12M3]]
normalized: E [~ [EG [~ [P2s<=P1M1]]] U EX [3<=P12M3]]

abstracting: (3<=P12M3) states: 0
.abstracting: (P2s<=P1M1) states: 2,754 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EF [[P1wM1<=P2s & 3<=P1wM1]]]
normalized: EX [E [true U [P1wM1<=P2s & 3<=P1wM1]]]

abstracting: (3<=P1wM1) states: 0
abstracting: (P1wM1<=P2s) states: 2,790 (3)
.-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [P3s<=P12M3 U 3<=M2]
normalized: E [P3s<=P12M3 U 3<=M2]

abstracting: (3<=M2) states: 0
abstracting: (P3s<=P12M3) states: 1,803 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[AG [P2s<=P2wP1] | EF [1<=P12wM3]]]
normalized: ~ [E [true U ~ [[E [true U 1<=P12wM3] | ~ [E [true U ~ [P2s<=P2wP1]]]]]]]

abstracting: (P2s<=P2wP1) states: 2,670 (3)
abstracting: (1<=P12wM3) states: 240
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [[~ [EG [2<=P1M1]] & 1<=P2M2] | AG [P12s<=P1s]]
normalized: [~ [E [true U ~ [P12s<=P1s]]] | [1<=P2M2 & ~ [EG [2<=P1M1]]]]

abstracting: (2<=P1M1) states: 120
.
EG iterations: 1
abstracting: (1<=P2M2) states: 774
abstracting: (P12s<=P1s) states: 3,240 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [[~ [[[3<=P12 | 1<=P2wM2] | ~ [1<=P1wP2]]] | EF [3<=P12]] | 1<=P12wM3]
normalized: [1<=P12wM3 | [E [true U 3<=P12] | ~ [[~ [1<=P1wP2] | [3<=P12 | 1<=P2wM2]]]]]

abstracting: (1<=P2wM2) states: 900
abstracting: (3<=P12) states: 0
abstracting: (1<=P1wP2) states: 864
abstracting: (3<=P12) states: 0
abstracting: (1<=P12wM3) states: 240
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [E [~ [P2wP1<=M3] U ~ [3<=M1]] | AG [[[P1M1<=M3 & 1<=M1] | ~ [1<=P3s]]]]
normalized: [~ [E [true U ~ [[~ [1<=P3s] | [P1M1<=M3 & 1<=M1]]]]] | E [~ [P2wP1<=M3] U ~ [3<=M1]]]

abstracting: (3<=M1) states: 2,580 (3)
abstracting: (P2wP1<=M3) states: 3,444 (3)
abstracting: (1<=M1) states: 3,444 (3)
abstracting: (P1M1<=M3) states: 3,444 (3)
abstracting: (1<=P3s) states: 1,722 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[3<=M2 & P3s<=P1s] & [2<=M1 | [P1wP2<=P1wP2 | 3<=P3]]]]
normalized: E [true U [[2<=M1 | [P1wP2<=P1wP2 | 3<=P3]] & [3<=M2 & P3s<=P1s]]]

abstracting: (P3s<=P1s) states: 2,030 (3)
abstracting: (3<=M2) states: 0
abstracting: (3<=P3) states: 0
abstracting: (P1wP2<=P1wP2) states: 3,444 (3)
abstracting: (2<=M1) states: 3,324 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[P3M2<=P1 | [P2d<=P2M2 & P1M1<=P1wM1]] U AG [P12s<=P1wM1]]
normalized: [~ [EG [E [true U ~ [P12s<=P1wM1]]]] & ~ [E [E [true U ~ [P12s<=P1wM1]] U [E [true U ~ [P12s<=P1wM1]] & ~ [[P3M2<=P1 | [P2d<=P2M2 & P1M1<=P1wM1]]]]]]]

abstracting: (P1M1<=P1wM1) states: 2,700 (3)
abstracting: (P2d<=P2M2) states: 2,670 (3)
abstracting: (P3M2<=P1) states: 2,030 (3)
abstracting: (P12s<=P1wM1) states: 3,240 (3)
abstracting: (P12s<=P1wM1) states: 3,240 (3)
abstracting: (P12s<=P1wM1) states: 3,240 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [M1<=P12M3 & [A [2<=P3s U 2<=M3] & EX [[P2M2<=P3M2 & M3<=P12]]]]
normalized: [M1<=P12M3 & [[~ [E [~ [2<=M3] U [~ [2<=M3] & ~ [2<=P3s]]]] & ~ [EG [~ [2<=M3]]]] & EX [[P2M2<=P3M2 & M3<=P12]]]]

abstracting: (M3<=P12) states: 18
abstracting: (P2M2<=P3M2) states: 3,057 (3)
.abstracting: (2<=M3) states: 3,204 (3)
.
EG iterations: 1
abstracting: (2<=P3s) states: 574
abstracting: (2<=M3) states: 3,204 (3)
abstracting: (2<=M3) states: 3,204 (3)
abstracting: (M1<=P12M3) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [E [[3<=P1s & 3<=P3s] U [P1wP2<=P1d | 3<=P1]] & [~ [EF [3<=P2wM2]] | A [P2wP1<=P2d U 3<=P1M1]]]
normalized: [[~ [E [true U 3<=P2wM2]] | [~ [E [~ [3<=P1M1] U [~ [P2wP1<=P2d] & ~ [3<=P1M1]]]] & ~ [EG [~ [3<=P1M1]]]]] & E [[3<=P1s & 3<=P3s] U [P1wP2<=P1d | 3<=P1]]]

abstracting: (3<=P1) states: 0
abstracting: (P1wP2<=P1d) states: 2,700 (3)
abstracting: (3<=P3s) states: 0
abstracting: (3<=P1s) states: 0
abstracting: (3<=P1M1) states: 0

EG iterations: 0
abstracting: (3<=P1M1) states: 0
abstracting: (P2wP1<=P2d) states: 2,670 (3)
abstracting: (3<=P1M1) states: 0
abstracting: (3<=P2wM2) states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 5.459sec


BK_STOP 1464439218817

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


iterations count:164 (8), effective:32 (1)

initing FirstDep: 0m 0.000sec


iterations count:24 (1), effective:2 (0)

iterations count:35 (1), effective:3 (0)

iterations count:164 (8), effective:25 (1)

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

iterations count:99 (4), effective:15 (0)

iterations count:20 (1), effective:0 (0)

iterations count:95 (4), effective:15 (0)

iterations count:95 (4), effective:15 (0)

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

iterations count:95 (4), effective:15 (0)

iterations count:22 (1), effective:1 (0)

iterations count:20 (1), effective:0 (0)

iterations count:68 (3), effective:10 (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_FMS-PT-002"
export BK_EXAMINATION="CTLCardinality"
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-002.tgz
mv S_FMS-PT-002 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-002, examination is CTLCardinality"
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-146416259300633"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;