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

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


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_000001
(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: 0m16.519sec


RS generation: 0m 0.001sec


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



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

checking: ~ [~ [3<=a_cap]]
normalized: 3<=a_cap

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

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

MC time: 0m 0.000sec

checking: 3<=r
normalized: 3<=r

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

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

MC time: 0m 0.000sec

checking: 3<=ma
normalized: 3<=ma

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

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

MC time: 0m 0.000sec

checking: 3<=da_a
normalized: 3<=da_a

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

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

MC time: 0m 0.000sec

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

abstracting: (c<=dr) states: 96
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [AF [~ [c<=ma]]]
normalized: ~ [E [true U EG [c<=ma]]]

abstracting: (c<=ma) states: 96
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [c<=r]
normalized: ~ [EX [~ [c<=r]]]

abstracting: (c<=r) states: 96
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [AG [EG [3<=a_cap]] | 2<=ma_cap]
normalized: [2<=ma_cap | ~ [E [true U ~ [EG [3<=a_cap]]]]]

abstracting: (3<=a_cap) states: 0
.
EG iterations: 1
abstracting: (2<=ma_cap) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ma<=c
normalized: ma<=c

abstracting: (ma<=c) states: 96
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AF [E [da<=c_cap U 3<=r]]
normalized: ~ [EG [~ [E [da<=c_cap U 3<=r]]]]

abstracting: (3<=r) states: 0
abstracting: (da<=c_cap) states: 96

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: A [~ [[2<=a_cap & mr_cap<=c_cap]] U ~ [~ [1<=ma_cap]]]
normalized: [~ [E [~ [1<=ma_cap] U [[2<=a_cap & mr_cap<=c_cap] & ~ [1<=ma_cap]]]] & ~ [EG [~ [1<=ma_cap]]]]

abstracting: (1<=ma_cap) states: 64
.
EG iterations: 1
abstracting: (1<=ma_cap) states: 64
abstracting: (mr_cap<=c_cap) states: 96
abstracting: (2<=a_cap) states: 0
abstracting: (1<=ma_cap) states: 64
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: A [[ma<=a_cap | [3<=a & 3<=c_cap]] U EX [1<=a]]
normalized: [~ [EG [~ [EX [1<=a]]]] & ~ [E [~ [EX [1<=a]] U [~ [EX [1<=a]] & ~ [[ma<=a_cap | [3<=a & 3<=c_cap]]]]]]]

abstracting: (3<=c_cap) states: 0
abstracting: (3<=a) states: 0
abstracting: (ma<=a_cap) states: 96
abstracting: (1<=a) states: 64
.abstracting: (1<=a) states: 64
.abstracting: (1<=a) states: 64
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[~ [EX [2<=r]] | ~ [[da<=dr | [ma<=da | r_cap<=dr]]]]]
normalized: ~ [[~ [EX [2<=r]] | ~ [[da<=dr | [ma<=da | r_cap<=dr]]]]]

abstracting: (r_cap<=dr) states: 96
abstracting: (ma<=da) states: 96
abstracting: (da<=dr) states: 96
abstracting: (2<=r) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [~ [A [ma_cap<=c_cap U da<=dr]] & E [~ [1<=a] U ~ [a_cap<=c]]]
normalized: [E [~ [1<=a] U ~ [a_cap<=c]] & ~ [[~ [E [~ [da<=dr] U [~ [da<=dr] & ~ [ma_cap<=c_cap]]]] & ~ [EG [~ [da<=dr]]]]]]

abstracting: (da<=dr) states: 96
.
EG iterations: 1
abstracting: (ma_cap<=c_cap) states: 96
abstracting: (da<=dr) states: 96
abstracting: (da<=dr) states: 96
abstracting: (a_cap<=c) states: 96
abstracting: (1<=a) states: 64
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[~ [[dr_a<=mr & 1<=r_cap]] | [~ [ma<=ma_cap] | [1<=dr | c_cap<=a_cap]]]]
normalized: ~ [E [true U ~ [[~ [[dr_a<=mr & 1<=r_cap]] | [~ [ma<=ma_cap] | [1<=dr | c_cap<=a_cap]]]]]]

abstracting: (c_cap<=a_cap) states: 96
abstracting: (1<=dr) states: 64
abstracting: (ma<=ma_cap) states: 64
abstracting: (1<=r_cap) states: 64
abstracting: (dr_a<=mr) states: 96
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[[EX [1<=ma_cap] | [~ [2<=a_cap] | 2<=r]] | [[[r_cap<=c_cap | 2<=dr] & ~ [c<=dr]] & EF [3<=da_a]]]]
normalized: ~ [[[E [true U 3<=da_a] & [~ [c<=dr] & [r_cap<=c_cap | 2<=dr]]] | [EX [1<=ma_cap] | [2<=r | ~ [2<=a_cap]]]]]

abstracting: (2<=a_cap) states: 0
abstracting: (2<=r) states: 0
abstracting: (1<=ma_cap) states: 64
.abstracting: (2<=dr) states: 0
abstracting: (r_cap<=c_cap) states: 96
abstracting: (c<=dr) states: 96
abstracting: (3<=da_a) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec


Total processing time: 0m20.462sec


BK_STOP 1465114869820

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


iterations count:113 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:58 (3), effective:6 (0)

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

iterations count:63 (3), effective:12 (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="/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-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-2979"
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 r197kn-qhx2-146444262200003"
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 ;