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-2265
Executing tool marcie
Input is S_CircadianClock-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419500262
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433162496838

Model: S_CircadianClock-PT-000001
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 14 NrTr: 16 NrArc: 58)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 21 (2.1e+01) #states 128



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

checking: [EF [EX [dr_a<=mr_cap]] | 1<=c]
normalized: [1<=c | E [true U EX [dr_a<=mr_cap]]]

abstracting: (dr_a<=mr_cap) states: 96
.abstracting: (1<=c) states: 64
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [[AF [3<=a_cap] & [[2<=c_cap | a_cap<=ma_cap] | [1<=r | ma_cap<=dr]]]]
normalized: ~ [EX [~ [[~ [EG [~ [3<=a_cap]]] & [[2<=c_cap | a_cap<=ma_cap] | [1<=r | ma_cap<=dr]]]]]]

abstracting: (ma_cap<=dr) states: 96
abstracting: (1<=r) states: 64
abstracting: (a_cap<=ma_cap) states: 96
abstracting: (2<=c_cap) states: 0
abstracting: (3<=a_cap) states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircadianClock-PT-000001-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [~ [3<=mr_cap] U EG [3<=mr]]
normalized: [~ [EG [~ [EG [3<=mr]]]] & ~ [E [3<=mr_cap U [3<=mr_cap & ~ [EG [3<=mr]]]]]]

abstracting: (3<=mr) states: 0
.
EG iterations: 1
abstracting: (3<=mr_cap) states: 0
abstracting: (3<=mr_cap) states: 0
abstracting: (3<=mr) states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [[~ [EF [2<=ma]] | ma<=mr]]
normalized: ~ [[ma<=mr | ~ [E [true U 2<=ma]]]]

abstracting: (2<=ma) states: 0
abstracting: (ma<=mr) states: 96
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [AG [~ [a_cap<=c_cap]]]
normalized: ~ [EX [E [true U a_cap<=c_cap]]]

abstracting: (a_cap<=c_cap) states: 96
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[~ [3<=ma_cap] & da_a<=a_cap] U EF [da<=mr_cap]]
normalized: E [[da_a<=a_cap & ~ [3<=ma_cap]] U E [true U da<=mr_cap]]

abstracting: (da<=mr_cap) states: 96
abstracting: (3<=ma_cap) states: 0
abstracting: (da_a<=a_cap) states: 96
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [3<=da_a & [EX [[1<=c_cap & 2<=da]] & [EX [dr_a<=mr] | [[a<=r | 2<=a] | r_cap<=ma_cap]]]]
normalized: [3<=da_a & [[[r_cap<=ma_cap | [a<=r | 2<=a]] | EX [dr_a<=mr]] & EX [[1<=c_cap & 2<=da]]]]

abstracting: (2<=da) states: 0
abstracting: (1<=c_cap) states: 64
.abstracting: (dr_a<=mr) states: 96
.abstracting: (2<=a) states: 0
abstracting: (a<=r) states: 96
abstracting: (r_cap<=ma_cap) states: 96
abstracting: (3<=da_a) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircadianClock-PT-000001-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [[[3<=c | [ma<=r_cap | [ma<=dr | ma<=da]]] & ~ [[[mr<=mr | 3<=da] | ~ [2<=ma_cap]]]]]
normalized: ~ [[[3<=c | [ma<=r_cap | [ma<=dr | ma<=da]]] & ~ [[[mr<=mr | 3<=da] | ~ [2<=ma_cap]]]]]

abstracting: (2<=ma_cap) states: 0
abstracting: (3<=da) states: 0
abstracting: (mr<=mr) states: 128
abstracting: (ma<=da) states: 96
abstracting: (ma<=dr) states: 96
abstracting: (ma<=r_cap) states: 96
abstracting: (3<=c) states: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[EG [~ [1<=a]] | [[[3<=da & dr<=da_a] | 3<=dr] | da<=a_cap]] & dr<=dr]
normalized: [dr<=dr & [EG [~ [1<=a]] | [da<=a_cap | [3<=dr | [3<=da & dr<=da_a]]]]]

abstracting: (dr<=da_a) states: 96
abstracting: (3<=da) states: 0
abstracting: (3<=dr) states: 0
abstracting: (da<=a_cap) states: 96
abstracting: (1<=a) states: 64
.
EG iterations: 1
abstracting: (dr<=dr) states: 128
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[[2<=a_cap | ma<=da_a] & [3<=dr | 2<=mr_cap]] U 1<=da]
normalized: E [[[2<=a_cap | ma<=da_a] & [3<=dr | 2<=mr_cap]] U 1<=da]

abstracting: (1<=da) states: 64
abstracting: (2<=mr_cap) states: 0
abstracting: (3<=dr) states: 0
abstracting: (ma<=da_a) states: 96
abstracting: (2<=a_cap) states: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EX [[AF [da_a<=da] | [[1<=dr_a & ma<=r] & [1<=mr | 3<=da]]]]
normalized: EX [[~ [EG [~ [da_a<=da]]] | [[1<=dr_a & ma<=r] & [1<=mr | 3<=da]]]]

abstracting: (3<=da) states: 0
abstracting: (1<=mr) states: 64
abstracting: (ma<=r) states: 96
abstracting: (1<=dr_a) states: 64
abstracting: (da_a<=da) states: 64
.
EG iterations: 1
.-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: 3<=dr
normalized: 3<=dr

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

FORMULA CircadianClock-PT-000001-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [[~ [ma_cap<=ma] | [[r<=da | 2<=c_cap] & ~ [dr_a<=ma_cap]]]]
normalized: ~ [EG [~ [[[[r<=da | 2<=c_cap] & ~ [dr_a<=ma_cap]] | ~ [ma_cap<=ma]]]]]

abstracting: (ma_cap<=ma) states: 64
abstracting: (dr_a<=ma_cap) states: 96
abstracting: (2<=c_cap) states: 0
abstracting: (r<=da) states: 96
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EX [~ [a_cap<=da_a]]]
normalized: EG [EX [~ [a_cap<=da_a]]]

abstracting: (a_cap<=da_a) states: 96
..
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433162506287

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

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: 0m0sec


iterations count:104 (6), effective:19 (1)

initing FirstDep: 0m0sec


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

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

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

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

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

iterations count:16 (1), effective:0 (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_CircadianClock-PT-000001"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_CircadianClock-PT-000001.tgz
mv S_CircadianClock-PT-000001 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_CircadianClock-PT-000001, 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 r120st-ebro-143297419500262"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;