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

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

=== Now, execution of the tool begins

BK_START 1463599070963


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_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 3.940sec


RS generation: 0m 0.159sec


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



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

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

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

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

MC time: 0m 0.025sec

checking: AG [AX [~ [P2<=P12]]]
normalized: ~ [E [true U EX [P2<=P12]]]

abstracting: (P2<=P12) states: 2,555,867,709,549 (12)
.-> the formula is FALSE

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

MC time: 0m 0.083sec

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

abstracting: (P1s<=M1) states: 3,107,441,661,324 (12)
-> the formula is TRUE

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

MC time: 0m 0.035sec

checking: ~ [EF [[~ [3<=M3] & [1<=P12wM3 & 3<=P2wM2]]]]
normalized: ~ [E [true U [[1<=P12wM3 & 3<=P2wM2] & ~ [3<=M3]]]]

abstracting: (3<=M3) states: 0
abstracting: (3<=P2wM2) states: 2,743,295,249,310 (12)
abstracting: (1<=P12wM3) states: 3,634,972,284,405 (12)
-> the formula is FALSE

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

MC time: 0m 0.424sec

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

abstracting: (2<=P2d) states: 3,621,669,084,726 (12)
abstracting: (2<=P2s) states: 3,621,669,084,726 (12)
abstracting: (1<=P1) states: 4,645,008,931,794 (12)
-> the formula is FALSE

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

MC time: 0m 0.461sec

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

abstracting: (3<=P2M2) states: 0
abstracting: (P1<=P1M1) states: 2,588,267,960,586 (12)
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: AX [[M3<=P1wP2 | EF [3<=P2M2]]]
normalized: ~ [EX [~ [[M3<=P1wP2 | E [true U 3<=P2M2]]]]]

abstracting: (3<=P2M2) states: 0
abstracting: (M3<=P1wP2) states: 4,361,585,458,923 (12)
.-> the formula is FALSE

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

MC time: 0m 0.134sec

checking: E [EG [P2s<=P2d] U ~ [~ [P1<=P12wM3]]]
normalized: E [EG [P2s<=P2d] U P1<=P12wM3]

abstracting: (P1<=P12wM3) states: 2,639,844,392,724 (12)
abstracting: (P2s<=P2d) states: 3,377,140,895,205 (12)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.552sec

checking: E [[[1<=P2d & 1<=P1d] | ~ [1<=P12s]] U ~ [[2<=P1 & 1<=P2]]]
normalized: E [[~ [1<=P12s] | [1<=P2d & 1<=P1d]] U ~ [[2<=P1 & 1<=P2]]]

abstracting: (1<=P2) states: 4,706,323,937,700 (12)
abstracting: (2<=P1) states: 3,524,136,450,219 (12)
abstracting: (1<=P1d) states: 4,645,008,931,794 (12)
abstracting: (1<=P2d) states: 4,706,323,937,700 (12)
abstracting: (1<=P12s) states: 3,634,972,284,405 (12)
-> the formula is TRUE

FORMULA FMS-PT-020-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.282sec

checking: AX [[[[P2<=M3 | P2wM2<=M2] | 3<=P1] & EF [2<=P12s]]]
normalized: ~ [EX [~ [[E [true U 2<=P12s] & [3<=P1 | [P2<=M3 | P2wM2<=M2]]]]]]

abstracting: (P2wM2<=M2) states: 1,920,576,892,542 (12)
abstracting: (P2<=M3) states: 2,635,844,230,173 (12)
abstracting: (3<=P1) states: 2,628,716,752,662 (12)
abstracting: (2<=P12s) states: 2,139,295,219,446 (12)
.-> the formula is TRUE

FORMULA FMS-PT-020-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

checking: E [EF [1<=P2d] U [3<=P12s & [P2<=M1 & M2<=P3M2]]]
normalized: E [E [true U 1<=P2d] U [3<=P12s & [P2<=M1 & M2<=P3M2]]]

abstracting: (M2<=P3M2) states: 5,722,156,044,129 (12)
abstracting: (P2<=M1) states: 3,031,177,958,424 (12)
abstracting: (3<=P12s) states: 1,226,112,110,916 (12)
abstracting: (1<=P2d) states: 4,706,323,937,700 (12)
-> the formula is TRUE

FORMULA FMS-PT-020-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.277sec

checking: [E [~ [M1<=P1s] U ~ [3<=P2]] & EG [~ [[1<=P2wM2 & P1<=P2s]]]]
normalized: [EG [~ [[1<=P2wM2 & P1<=P2s]]] & E [~ [M1<=P1s] U ~ [3<=P2]]]

abstracting: (3<=P2) states: 2,743,295,249,310 (12)
abstracting: (M1<=P1s) states: 3,902,713,985,940 (12)
abstracting: (P1<=P2s) states: 3,518,954,295,780 (12)
abstracting: (1<=P2wM2) states: 4,706,323,937,700 (12)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.269sec

checking: EF [[[~ [3<=M3] & [P12wM3<=P12M3 & P12wM3<=P1wM1]] & AG [2<=P3s]]]
normalized: E [true U [~ [E [true U ~ [2<=P3s]]] & [[P12wM3<=P12M3 & P12wM3<=P1wM1] & ~ [3<=M3]]]]

abstracting: (3<=M3) states: 0
abstracting: (P12wM3<=P1wM1) states: 4,421,411,310,855 (12)
abstracting: (P12wM3<=P12M3) states: 3,307,379,676,909 (12)
abstracting: (2<=P3s) states: 4,959,056,632,160 (12)
-> the formula is FALSE

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

MC time: 0m 0.312sec

checking: ~ [E [[1<=P1s | P12s<=P2M2] U [2<=P2s | P1<=P12]]]
normalized: ~ [E [[1<=P1s | P12s<=P2M2] U [2<=P2s | P1<=P12]]]

abstracting: (P1<=P12) states: 2,639,844,392,724 (12)
abstracting: (2<=P2s) states: 3,621,669,084,726 (12)
abstracting: (P12s<=P2M2) states: 3,054,406,051,620 (12)
abstracting: (1<=P1s) states: 4,645,008,931,794 (12)
-> the formula is FALSE

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

MC time: 0m 0.538sec

checking: [[P1d<=P2wP1 & AG [~ [P2<=P3M2]]] & ~ [EX [[1<=P2d & P3s<=P3]]]]
normalized: [~ [EX [[1<=P2d & P3s<=P3]]] & [P1d<=P2wP1 & ~ [E [true U P2<=P3M2]]]]

abstracting: (P2<=P3M2) states: 4,600,197,985,012 (12)
abstracting: (P1d<=P2wP1) states: 3,518,954,295,780 (12)
abstracting: (P3s<=P3) states: 3,158,136,065,744 (12)
abstracting: (1<=P2d) states: 4,706,323,937,700 (12)
.-> the formula is FALSE

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

MC time: 0m 0.613sec

checking: [~ [[2<=P1wP2 | EF [1<=P2d]]] | [[AG [P1wP2<=M1] | AX [P1<=P2wM2]] & EG [[P1s<=P12s | 3<=P2]]]]
normalized: [~ [[2<=P1wP2 | E [true U 1<=P2d]]] | [[~ [E [true U ~ [P1wP2<=M1]]] | ~ [EX [~ [P1<=P2wM2]]]] & EG [[P1s<=P12s | 3<=P2]]]]

abstracting: (3<=P2) states: 2,743,295,249,310 (12)
abstracting: (P1s<=P12s) states: 2,639,844,392,724 (12)
.
EG iterations: 1
abstracting: (P1<=P2wM2) states: 3,518,954,295,780 (12)
.abstracting: (P1wP2<=M1) states: 3,107,441,661,324 (12)
abstracting: (1<=P2d) states: 4,706,323,937,700 (12)
abstracting: (2<=P1wP2) states: 3,524,136,450,219 (12)
-> the formula is FALSE

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

MC time: 0m 0.833sec


Total processing time: 0m11.837sec


BK_STOP 1463599082842

--------------------
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:20 (1), effective:0 (0)

iterations count:77 (3), effective:19 (0)

iterations count:105 (5), effective:17 (0)

iterations count:419 (20), effective:67 (3)

iterations count:435 (21), effective:71 (3)

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

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

iterations count:168 (8), effective:28 (1)

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

iterations count:296 (14), effective:61 (3)

iterations count:74 (3), effective:18 (0)

iterations count:58 (2), effective:19 (0)

iterations count:149 (7), effective:38 (1)

iterations count:80 (4), effective:40 (2)

iterations count:167 (8), effective:33 (1)

iterations count:100 (5), effective:14 (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="FMS-PT-020"
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/FMS-PT-020.tgz
mv 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 FMS-PT-020, 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 r053kn-smll-146358767800084"
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 ;