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

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

=== Now, execution of the tool begins

BK_START 1464439546678


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


RS generation: 0m 3.067sec


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



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

checking: EF [1<=P12s]
normalized: E [true U 1<=P12s]

abstracting: (1<=P12s) states: 342,619,299,282,007,800 (17)
-> the formula is TRUE

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

MC time: 0m 1.164sec

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

abstracting: (3<=P12wM3) states: 220,851,535,107,971,040 (17)
.-> the formula is TRUE

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

MC time: 0m 2.851sec

checking: AX [~ [EF [1<=P12s]]]
normalized: ~ [EX [E [true U 1<=P12s]]]

abstracting: (1<=P12s) states: 342,619,299,282,007,800 (17)
.-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (P1wP2<=M2) states: 64,491,582,569,568,726 (16)
-> the formula is TRUE

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

MC time: 0m 1.818sec

checking: EF [[EG [1<=P2wM2] & EX [2<=P12wM3]]]
normalized: E [true U [EX [2<=P12wM3] & EG [1<=P2wM2]]]

abstracting: (1<=P2wM2) states: 381,583,852,607,400,300 (17)
.
EG iterations: 1
abstracting: (2<=P12wM3) states: 275,680,288,553,678,190 (17)
.-> the formula is TRUE

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

MC time: 0m 1.909sec

checking: EF [[AG [1<=M1] | ~ [2<=M3]]]
normalized: E [true U [~ [2<=M3] | ~ [E [true U ~ [1<=M1]]]]]

abstracting: (1<=M1) states: 334,521,580,915,640,196 (17)
abstracting: (2<=M3) states: 171,966,938,109,139,836 (17)
-> the formula is TRUE

FORMULA FMS-PT-050-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.140sec

checking: AG [AX [P12s<=P3]]
normalized: ~ [E [true U EX [~ [P12s<=P3]]]]

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

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

MC time: 0m 7.779sec

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

abstracting: (3<=P1d) states: 304,106,353,550,718,264 (17)
abstracting: (1<=P1d) states: 380,558,460,392,121,960 (17)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.177sec

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

abstracting: (P3M2<=P1wP2) states: 118,038,133,053,618,066 (17)
abstracting: (P12wM3<=P2) states: 294,639,280,055,406,936 (17)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m51.758sec

checking: [AF [AG [M3<=P1]] & EG [~ [~ [P1s<=P12M3]]]]
normalized: [EG [P1s<=P12M3] & ~ [EG [E [true U ~ [M3<=P1]]]]]

abstracting: (M3<=P1) states: 376,401,818,867,280,570 (17)

EG iterations: 0
abstracting: (P1s<=P12M3) states: 77,297,038,447,563,792 (16)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 4.340sec

checking: EX [[EF [3<=M3] & [P3s<=P2 & P2wP1<=P2wM2]]]
normalized: EX [[[P3s<=P2 & P2wP1<=P2wM2] & E [true U 3<=M3]]]

abstracting: (3<=M3) states: 0
abstracting: (P2wP1<=P2wM2) states: 223,058,860,291,759,986 (17)
abstracting: (P3s<=P2) states: 120,212,621,033,595,561 (17)
.-> the formula is FALSE

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

MC time: 0m 5.094sec

checking: E [P2wP1<=P12wM3 U [[3<=M2 | P3<=P2d] & [2<=P2wP1 | 3<=P1wM1]]]
normalized: E [P2wP1<=P12wM3 U [[2<=P2wP1 | 3<=P1wM1] & [3<=M2 | P3<=P2d]]]

abstracting: (P3<=P2d) states: 120,212,621,033,595,561 (17)
abstracting: (3<=M2) states: 0
abstracting: (3<=P1wM1) states: 304,106,353,550,718,264 (17)
abstracting: (2<=P2wP1) states: 342,528,633,066,500,790 (17)
abstracting: (P2wP1<=P12wM3) states: 159,844,861,640,693,736 (17)
-> the formula is TRUE

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

MC time: 0m46.993sec

checking: [~ [AF [3<=M2]] & [AG [[P1wM1<=P3 | P12wM3<=P1wP2]] | ~ [EF [P1wM1<=P12]]]]
normalized: [[~ [E [true U P1wM1<=P12]] | ~ [E [true U ~ [[P1wM1<=P3 | P12wM3<=P1wP2]]]]] & EG [~ [3<=M2]]]

abstracting: (3<=M2) states: 0

EG iterations: 0
abstracting: (P12wM3<=P1wP2) states: 292,457,991,554,696,916 (17)
abstracting: (P1wM1<=P3) states: 319,981,401,021,606,516 (17)
abstracting: (P1wM1<=P12) states: 162,493,847,016,914,556 (17)
-> the formula is FALSE

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

MC time: 3m55.000sec

checking: E [[[M2<=M3 & 1<=P3] | [P12M3<=P2s & 2<=P1s]] U ~ [~ [3<=P1wP2]]]
normalized: E [[[P12M3<=P2s & 2<=P1s] | [M2<=M3 & 1<=P3]] U 3<=P1wP2]

abstracting: (3<=P1wP2) states: 304,106,353,550,718,264 (17)
abstracting: (1<=P3) states: 407,716,905,594,486,150 (17)
abstracting: (M2<=M3) states: 364,720,990,114,603,746 (17)
abstracting: (2<=P1s) states: 340,655,753,100,914,160 (17)
abstracting: (P12M3<=P2s) states: 387,956,953,355,845,536 (17)
-> the formula is TRUE

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

MC time: 0m 5.380sec

checking: E [[[P2M2<=P3M2 & P3s<=M1] & [3<=P12 & 2<=P1wM1]] U AG [3<=P3]]
normalized: E [[[3<=P12 & 2<=P1wM1] & [P2M2<=P3M2 & P3s<=M1]] U ~ [E [true U ~ [3<=P3]]]]

abstracting: (3<=P3) states: 376,058,887,042,443,696 (17)
abstracting: (P3s<=M1) states: 42,062,101,295,695,728 (16)
abstracting: (P2M2<=P3M2) states: 416,296,092,528,784,611 (17)
abstracting: (2<=P1wM1) states: 340,655,753,100,914,160 (17)
abstracting: (3<=P12) states: 220,851,535,107,971,040 (17)
-> the formula is FALSE

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

MC time: 0m 6.247sec

checking: [EF [AG [3<=P1M1]] | [AG [[P2<=P1wM1 | 2<=M3]] | [[~ [2<=P12] | 1<=P1] & ~ [~ [M1<=P12s]]]]]
normalized: [E [true U ~ [E [true U ~ [3<=P1M1]]]] | [[M1<=P12s & [1<=P1 | ~ [2<=P12]]] | ~ [E [true U ~ [[P2<=P1wM1 | 2<=M3]]]]]]

abstracting: (2<=M3) states: 171,966,938,109,139,836 (17)
abstracting: (P2<=P1wM1) states: 221,906,752,509,842,946 (17)

FORMULA FMS-PT-050-CTLCardinality-3 CANNOT_COMPUTE

MC time: 0m18.863sec


Total processing time: 6m45.394sec


BK_STOP 1464439952482

--------------------
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:94 (4), effective:14 (0)

iterations count:252 (12), effective:41 (2)

iterations count:94 (4), effective:14 (0)

iterations count:136 (6), effective:23 (1)

iterations count:302 (15), effective:47 (2)

iterations count:245 (12), effective:42 (2)

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

iterations count:142 (7), effective:63 (3)

iterations count:254 (12), effective:42 (2)

iterations count:210 (10), effective:106 (5)

iterations count:171 (8), effective:51 (2)

iterations count:260 (13), effective:86 (4)
71046
iterations count:1449 (72), effective:245 (12)
42247
iterations count:1319 (65), effective:235 (11)

iterations count:146 (7), effective:27 (1)

iterations count:68 (3), effective:48 (2)
std::bad_alloc

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-050"
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-050.tgz
mv S_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 S_FMS-PT-050, 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-146416259400669"
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 ;