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_CircadianClock-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262200012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465114886443


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: CircadianClock_PT_000010
(NrP: 14 NrTr: 16 NrArc: 58)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m18.163sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 66 (6.6e+01) #states 644,204 (5)



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

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

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

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

MC time: 0m 0.000sec

checking: EF [~ [AX [2<=a_cap]]]
normalized: E [true U EX [~ [2<=a_cap]]]

abstracting: (2<=a_cap) states: 527,076 (5)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [EF [AX [2<=dr_a]]]
normalized: ~ [E [true U ~ [EX [~ [2<=dr_a]]]]]

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

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

MC time: 0m 0.000sec

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

abstracting: (ma_cap<=ma_cap) states: 644,204 (5)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [E [3<=ma_cap U ma_cap<=a]]
normalized: ~ [EX [~ [E [3<=ma_cap U ma_cap<=a]]]]

abstracting: (ma_cap<=a) states: 351,384 (5)
abstracting: (3<=ma_cap) states: 468,512 (5)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [~ [~ [[2<=dr & mr_cap<=a]]]]
normalized: E [true U [2<=dr & mr_cap<=a]]

abstracting: (mr_cap<=a) states: 351,384 (5)
abstracting: (2<=dr) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [EF [[ma<=ma_cap & c<=r]]]
normalized: ~ [E [true U ~ [E [true U [ma<=ma_cap & c<=r]]]]]

abstracting: (c<=r) states: 351,384 (5)
abstracting: (ma<=ma_cap) states: 351,384 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[3<=ma_cap & [ma<=dr & 3<=ma]]]]
normalized: ~ [E [true U [3<=ma_cap & [ma<=dr & 3<=ma]]]]

abstracting: (3<=ma) states: 468,512 (5)
abstracting: (ma<=dr) states: 87,846 (4)
abstracting: (3<=ma_cap) states: 468,512 (5)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [AG [[dr_a<=c & c_cap<=ma_cap]]]
normalized: E [true U ~ [E [true U ~ [[dr_a<=c & c_cap<=ma_cap]]]]]

abstracting: (c_cap<=ma_cap) states: 351,384 (5)
abstracting: (dr_a<=c) states: 614,922 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [~ [EF [[r_cap<=a & c_cap<=a_cap]]] & da<=r_cap]
normalized: [da<=r_cap & ~ [E [true U [r_cap<=a & c_cap<=a_cap]]]]

abstracting: (c_cap<=a_cap) states: 351,384 (5)
abstracting: (r_cap<=a) states: 351,384 (5)
abstracting: (da<=r_cap) states: 614,922 (5)
-> the formula is FALSE

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

MC time: 0m 0.027sec

checking: AG [[AG [da_a<=c_cap] & [~ [2<=c_cap] | [2<=dr | c<=mr_cap]]]]
normalized: ~ [E [true U ~ [[[[2<=dr | c<=mr_cap] | ~ [2<=c_cap]] & ~ [E [true U ~ [da_a<=c_cap]]]]]]]

abstracting: (da_a<=c_cap) states: 614,922 (5)
abstracting: (2<=c_cap) states: 527,076 (5)
abstracting: (c<=mr_cap) states: 351,384 (5)
abstracting: (2<=dr) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [~ [A [2<=r U 1<=c_cap]] | E [~ [3<=mr] U [2<=da_a & mr<=ma_cap]]]
normalized: [~ [[~ [E [~ [1<=c_cap] U [~ [1<=c_cap] & ~ [2<=r]]]] & ~ [EG [~ [1<=c_cap]]]]] | E [~ [3<=mr] U [2<=da_a & mr<=ma_cap]]]

abstracting: (mr<=ma_cap) states: 351,384 (5)
abstracting: (2<=da_a) states: 0
abstracting: (3<=mr) states: 468,512 (5)
abstracting: (1<=c_cap) states: 585,640 (5)
.
EG iterations: 1
abstracting: (2<=r) states: 527,076 (5)
abstracting: (1<=c_cap) states: 585,640 (5)
abstracting: (1<=c_cap) states: 585,640 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [[[2<=dr & [2<=dr & 1<=c]] | AF [1<=r]]] & [~ [EG [1<=a_cap]] | [EF [c_cap<=mr] | AG [1<=a]]]]
normalized: [[~ [EG [1<=a_cap]] | [~ [E [true U ~ [1<=a]]] | E [true U c_cap<=mr]]] & ~ [[~ [EG [~ [1<=r]]] | [2<=dr & [2<=dr & 1<=c]]]]]

abstracting: (1<=c) states: 585,640 (5)
abstracting: (2<=dr) states: 0
abstracting: (2<=dr) states: 0
abstracting: (1<=r) states: 585,640 (5)
.
EG iterations: 1
abstracting: (c_cap<=mr) states: 351,384 (5)
abstracting: (1<=a) states: 585,640 (5)
abstracting: (1<=a_cap) states: 585,640 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: ~ [[[[[mr<=ma_cap & 1<=dr_a] & [1<=ma_cap | 3<=mr_cap]] & AF [3<=c]] | [EF [ma_cap<=a] | ~ [[c<=mr_cap | dr_a<=c]]]]]
normalized: ~ [[[[[1<=ma_cap | 3<=mr_cap] & [mr<=ma_cap & 1<=dr_a]] & ~ [EG [~ [3<=c]]]] | [~ [[c<=mr_cap | dr_a<=c]] | E [true U ma_cap<=a]]]]

abstracting: (ma_cap<=a) states: 351,384 (5)
abstracting: (dr_a<=c) states: 614,922 (5)
abstracting: (c<=mr_cap) states: 351,384 (5)
abstracting: (3<=c) states: 468,512 (5)
.
EG iterations: 1
abstracting: (1<=dr_a) states: 322,102 (5)
abstracting: (mr<=ma_cap) states: 351,384 (5)
abstracting: (3<=mr_cap) states: 468,512 (5)
abstracting: (1<=ma_cap) states: 585,640 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [[AG [2<=c_cap] & [EF [r_cap<=ma] | [dr<=r | [da<=dr | mr<=mr_cap]]]] & [~ [[3<=c & ~ [dr<=a_cap]]] | AF [~ [2<=dr_a]]]]
normalized: [[~ [EG [2<=dr_a]] | ~ [[3<=c & ~ [dr<=a_cap]]]] & [[[dr<=r | [da<=dr | mr<=mr_cap]] | E [true U r_cap<=ma]] & ~ [E [true U ~ [2<=c_cap]]]]]

abstracting: (2<=c_cap) states: 527,076 (5)
abstracting: (r_cap<=ma) states: 351,384 (5)
abstracting: (mr<=mr_cap) states: 351,384 (5)
abstracting: (da<=dr) states: 483,153 (5)
abstracting: (dr<=r) states: 614,922 (5)
abstracting: (dr<=a_cap) states: 614,922 (5)
abstracting: (3<=c) states: 468,512 (5)
abstracting: (2<=dr_a) states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [[[EG [3<=dr_a] & [[1<=a & c_cap<=ma] | 1<=r_cap]] & EF [1<=r]] | AG [[[mr<=c_cap | 3<=ma_cap] | [mr_cap<=mr_cap | a_cap<=c_cap]]]]
normalized: [~ [E [true U ~ [[[mr_cap<=mr_cap | a_cap<=c_cap] | [mr<=c_cap | 3<=ma_cap]]]]] | [E [true U 1<=r] & [[1<=r_cap | [1<=a & c_cap<=ma]] & EG [3<=dr_a]]]]

abstracting: (3<=dr_a) states: 0
.
EG iterations: 1
abstracting: (c_cap<=ma) states: 351,384 (5)
abstracting: (1<=a) states: 585,640 (5)
abstracting: (1<=r_cap) states: 585,640 (5)
abstracting: (1<=r) states: 585,640 (5)
abstracting: (3<=ma_cap) states: 468,512 (5)
abstracting: (mr<=c_cap) states: 351,384 (5)
abstracting: (a_cap<=c_cap) states: 351,384 (5)
abstracting: (mr_cap<=mr_cap) states: 644,204 (5)
-> the formula is TRUE

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

MC time: 0m 0.002sec


Total processing time: 0m22.155sec


BK_STOP 1465114908655

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


iterations count:878 (54), effective:153 (9)

initing FirstDep: 0m 0.000sec


iterations count:82 (5), effective:12 (0)

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

iterations count:88 (5), effective:13 (0)

iterations count:216 (13), effective:35 (2)

iterations count:180 (11), effective:44 (2)

iterations count:307 (19), effective:55 (3)

iterations count:524 (32), effective:84 (5)

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

iterations count:34 (2), effective:9 (0)

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

iterations count:49 (3), effective:11 (0)

iterations count:88 (5), effective:13 (0)

iterations count:457 (28), effective:72 (4)

iterations count:166 (10), effective:40 (2)

iterations count:34 (2), effective:3 (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-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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-000010.tgz
mv S_CircadianClock-PT-000010 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_CircadianClock-PT-000010, 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 r197kn-qhx2-146444262200012"
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 ;