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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262200007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465114880188


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=ReachabilityCardinality.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: 0m18.147sec


RS generation: 0m 0.001sec


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



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

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

abstracting: (1<=ma) states: 64
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA CircadianClock-PT-000001-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=da) states: 64
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [1<=da_a]]
normalized: ~ [E [true U 1<=da_a]]

abstracting: (1<=da_a) states: 64
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (r_cap<=mr) states: 96
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[2<=da & ~ [~ [1<=dr]]]]
normalized: E [true U [2<=da & 1<=dr]]

abstracting: (1<=dr) states: 64
abstracting: (2<=da) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [da_a<=dr_a]
normalized: ~ [E [true U ~ [da_a<=dr_a]]]

abstracting: (da_a<=dr_a) states: 96
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [~ [[2<=mr_cap | r_cap<=ma_cap]]]]
normalized: E [true U [2<=mr_cap | r_cap<=ma_cap]]

abstracting: (r_cap<=ma_cap) states: 96
abstracting: (2<=mr_cap) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [~ [[[1<=da & 2<=mr_cap] & [1<=ma & da<=ma]]]]
normalized: ~ [E [true U [[1<=da & 2<=mr_cap] & [1<=ma & da<=ma]]]]

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

FORMULA CircadianClock-PT-000001-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=dr_a) states: 0
abstracting: (3<=r_cap) states: 0
abstracting: (ma_cap<=dr_a) states: 96
abstracting: (3<=dr) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[[[3<=c & 1<=r_cap] | [dr_a<=da_a & 1<=mr]] & 2<=ma_cap]]
normalized: ~ [E [true U ~ [[2<=ma_cap & [[3<=c & 1<=r_cap] | [dr_a<=da_a & 1<=mr]]]]]]

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

FORMULA CircadianClock-PT-000001-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (mr_cap<=r) states: 96
abstracting: (a<=da) states: 96
abstracting: (a_cap<=da) states: 96
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[da_a<=a & [[ma<=c & 1<=ma_cap] | [1<=da | 3<=da_a]]]]
normalized: E [true U [da_a<=a & [[1<=da | 3<=da_a] | [ma<=c & 1<=ma_cap]]]]

abstracting: (1<=ma_cap) states: 64
abstracting: (ma<=c) states: 96
abstracting: (3<=da_a) states: 0
abstracting: (1<=da) states: 64
abstracting: (da_a<=a) states: 96
-> the formula is TRUE

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

MC time: 0m 0.001sec


Total processing time: 0m23.578sec


BK_STOP 1465114903817

--------------------
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:31 (1), effective:4 (0)

iterations count:27 (1), effective:3 (0)

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

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

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

iterations count:41 (2), effective:6 (0)

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

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

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

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

iterations count:35 (2), effective:5 (0)

iterations count:31 (1), effective:4 (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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-146444262200007"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;