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 CircadianClock-PT-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347850900021
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463592494680


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_000100
(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: 0m17.254sec


RS generation: 0m 0.077sec


-> reachability set: #nodes 516 (5.2e+02) #states 42,040,402,004 (10)



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

checking: AX [AG [1<=r_cap]]
normalized: ~ [EX [E [true U ~ [1<=r_cap]]]]

abstracting: (1<=r_cap) states: 41,624,160,400 (10)
.-> the formula is FALSE

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

MC time: 0m 0.200sec

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

abstracting: (2<=a_cap) states: 41,207,918,796 (10)
.-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

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

abstracting: (2<=r_cap) states: 41,207,918,796 (10)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AF [EF [~ [a<=c_cap]]]
normalized: ~ [EG [~ [E [true U ~ [a<=c_cap]]]]]

abstracting: (a<=c_cap) states: 21,228,321,804 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 4.553sec

checking: EX [EF [[3<=da & da_a<=dr]]]
normalized: EX [E [true U [3<=da & da_a<=dr]]]

abstracting: (da_a<=dr) states: 31,530,301,503 (10)
abstracting: (3<=da) states: 0
.-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[AG [c_cap<=r] | 3<=ma_cap]]
normalized: ~ [E [true U ~ [[3<=ma_cap | ~ [E [true U ~ [c_cap<=r]]]]]]]

abstracting: (c_cap<=r) states: 21,228,321,804 (10)
abstracting: (3<=ma_cap) states: 40,791,677,192 (10)
-> the formula is FALSE

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

MC time: 0m 0.339sec

checking: EF [AX [[3<=dr_a | mr_cap<=mr]]]
normalized: E [true U ~ [EX [~ [[3<=dr_a | mr_cap<=mr]]]]]

abstracting: (mr_cap<=mr) states: 21,228,321,804 (10)
abstracting: (3<=dr_a) states: 0
.-> the formula is TRUE

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

MC time: 0m 0.131sec

checking: [3<=r | ~ [E [ma<=mr_cap U 3<=dr]]]
normalized: [3<=r | ~ [E [ma<=mr_cap U 3<=dr]]]

abstracting: (3<=dr) states: 0
abstracting: (ma<=mr_cap) states: 21,228,321,804 (10)
abstracting: (3<=r) states: 40,791,677,192 (10)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: EF [EX [[a<=mr_cap & ma_cap<=r]]]
normalized: E [true U EX [[a<=mr_cap & ma_cap<=r]]]

abstracting: (ma_cap<=r) states: 21,228,321,804 (10)
abstracting: (a<=mr_cap) states: 21,228,321,804 (10)
.-> the formula is TRUE

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

MC time: 0m 0.472sec

checking: [~ [E [c<=a U mr_cap<=mr]] | EG [EG [3<=mr]]]
normalized: [EG [EG [3<=mr]] | ~ [E [c<=a U mr_cap<=mr]]]

abstracting: (mr_cap<=mr) states: 21,228,321,804 (10)
abstracting: (c<=a) states: 21,228,321,804 (10)
abstracting: (3<=mr) states: 40,791,677,192 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m10.906sec

checking: [AX [[[3<=c_cap | dr<=c] | 1<=r_cap]] & EX [AG [ma<=c_cap]]]
normalized: [EX [~ [E [true U ~ [ma<=c_cap]]]] & ~ [EX [~ [[1<=r_cap | [3<=c_cap | dr<=c]]]]]]

abstracting: (dr<=c) states: 41,832,281,202 (10)
abstracting: (3<=c_cap) states: 40,791,677,192 (10)
abstracting: (1<=r_cap) states: 41,624,160,400 (10)
.abstracting: (ma<=c_cap) states: 21,228,321,804 (10)
.-> the formula is FALSE

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

MC time: 0m 0.339sec

checking: E [EF [3<=a_cap] U [[da<=ma_cap & 3<=dr] & [2<=da_a | 1<=r_cap]]]
normalized: E [E [true U 3<=a_cap] U [[2<=da_a | 1<=r_cap] & [da<=ma_cap & 3<=dr]]]

abstracting: (3<=dr) states: 0
abstracting: (da<=ma_cap) states: 41,832,281,202 (10)
abstracting: (1<=r_cap) states: 41,624,160,400 (10)
abstracting: (2<=da_a) states: 0
abstracting: (3<=a_cap) states: 40,791,677,192 (10)
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AF [[EF [3<=c] & [[ma<=a & 1<=da] & [1<=dr | c_cap<=mr]]]]
normalized: ~ [EG [~ [[[[1<=dr | c_cap<=mr] & [ma<=a & 1<=da]] & E [true U 3<=c]]]]]

abstracting: (3<=c) states: 40,791,677,192 (10)
abstracting: (1<=da) states: 21,020,201,002 (10)
abstracting: (ma<=a) states: 21,228,321,804 (10)
abstracting: (c_cap<=mr) states: 21,228,321,804 (10)
abstracting: (1<=dr) states: 21,020,201,002 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m13.235sec

checking: EF [~ [[[dr_a<=ma_cap | da_a<=mr_cap] | [2<=da | c_cap<=ma]]]]
normalized: E [true U ~ [[[2<=da | c_cap<=ma] | [dr_a<=ma_cap | da_a<=mr_cap]]]]

abstracting: (da_a<=mr_cap) states: 41,832,281,202 (10)
abstracting: (dr_a<=ma_cap) states: 41,832,281,202 (10)
abstracting: (c_cap<=ma) states: 21,228,321,804 (10)
abstracting: (2<=da) states: 0
-> the formula is FALSE

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

MC time: 0m 0.175sec

checking: [~ [AG [[dr_a<=r_cap | 3<=ma]]] & [AX [~ [1<=da]] | [~ [~ [1<=dr]] | [[a_cap<=a_cap & 2<=da_a] | mr<=dr]]]]
normalized: [[[1<=dr | [mr<=dr | [a_cap<=a_cap & 2<=da_a]]] | ~ [EX [1<=da]]] & E [true U ~ [[dr_a<=r_cap | 3<=ma]]]]

abstracting: (3<=ma) states: 40,791,677,192 (10)
abstracting: (dr_a<=r_cap) states: 41,832,281,202 (10)
abstracting: (1<=da) states: 21,020,201,002 (10)
.abstracting: (2<=da_a) states: 0
abstracting: (a_cap<=a_cap) states: 42,040,402,004 (10)
abstracting: (mr<=dr) states: 624,362,406 (8)
abstracting: (1<=dr) states: 21,020,201,002 (10)
-> the formula is TRUE

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

MC time: 0m 0.137sec

checking: [[E [c_cap<=r_cap U r_cap<=mr] | AG [r_cap<=a]] | [~ [1<=mr_cap] | ~ [[[c_cap<=c | a<=mr_cap] | [1<=da_a & 2<=da]]]]]
normalized: [[~ [[[1<=da_a & 2<=da] | [c_cap<=c | a<=mr_cap]]] | ~ [1<=mr_cap]] | [~ [E [true U ~ [r_cap<=a]]] | E [c_cap<=r_cap U r_cap<=mr]]]

abstracting: (r_cap<=mr) states: 21,228,321,804 (10)
abstracting: (c_cap<=r_cap) states: 21,228,321,804 (10)
abstracting: (r_cap<=a) states: 21,228,321,804 (10)
abstracting: (1<=mr_cap) states: 41,624,160,400 (10)
abstracting: (a<=mr_cap) states: 21,228,321,804 (10)
abstracting: (c_cap<=c) states: 21,228,321,804 (10)
abstracting: (2<=da) states: 0
abstracting: (1<=da_a) states: 21,020,201,002 (10)
-> the formula is TRUE

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

MC time: 5m43.780sec


Total processing time: 6m37.264sec


BK_STOP 1463592892057

--------------------
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

235 287 343 415 439 460 692 713
iterations count:8528 (533), effective:1503 (93)

initing FirstDep: 0m 0.000sec

471
iterations count:1816 (113), effective:300 (18)

iterations count:628 (39), effective:103 (6)

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

iterations count:683 (42), effective:112 (7)

iterations count:222 (13), effective:102 (6)
486
iterations count:1486 (92), effective:392 (24)

iterations count:271 (16), effective:102 (6)
601
iterations count:1601 (100), effective:496 (31)

iterations count:266 (16), effective:100 (6)
4052
iterations count:1565 (97), effective:408 (25)

iterations count:28 (1), effective:4 (0)

iterations count:163 (10), effective:24 (1)
660 504
iterations count:2226 (139), effective:402 (25)

iterations count:516 (32), effective:200 (12)

iterations count:321 (20), effective:102 (6)

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="CircadianClock-PT-000100"
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/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 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 CircadianClock-PT-000100, 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 r017kn-qhx2-146347850900021"
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 ;