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 CircadianClock-PT-000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r008kn-ebro-143214239100269
=====================================================================

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

Model: 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=ReachabilityCardinality.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 [[2<=c_cap & [[1<=c_cap & 1<=r] | [ma<=c | da<=a]]]]
normalized: E [true U [2<=c_cap & [[ma<=c | da<=a] | [1<=c_cap & 1<=r]]]]

abstracting: (1<=r) states: 64
abstracting: (1<=c_cap) states: 64
abstracting: (da<=a) states: 96
abstracting: (ma<=c) states: 96
abstracting: (2<=c_cap) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [a_cap<=mr_cap]
normalized: ~ [E [true U ~ [a_cap<=mr_cap]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [~ [[~ [3<=r_cap] & [a_cap<=a_cap & 3<=r_cap]]]]
normalized: E [true U ~ [[[a_cap<=a_cap & 3<=r_cap] & ~ [3<=r_cap]]]]

abstracting: (3<=r_cap) states: 0
abstracting: (3<=r_cap) states: 0
abstracting: (a_cap<=a_cap) states: 128
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[~ [da<=a_cap] | [da_a<=a & da_a<=r]] | ma<=r_cap]]
normalized: E [true U [ma<=r_cap | [~ [da<=a_cap] | [da_a<=a & da_a<=r]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [[r<=mr | 3<=a_cap]] | ~ [~ [da<=ma]]]]
normalized: ~ [E [true U ~ [[da<=ma | ~ [[r<=mr | 3<=a_cap]]]]]]

abstracting: (3<=a_cap) states: 0
abstracting: (r<=mr) states: 96
abstracting: (da<=ma) states: 96
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=ma_cap) states: 0
abstracting: (1<=da_a) states: 64
abstracting: (2<=ma_cap) states: 0
abstracting: (3<=mr) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [~ [[3<=r & [3<=dr & 1<=ma_cap]]]]
normalized: E [true U ~ [[3<=r & [3<=dr & 1<=ma_cap]]]]

abstracting: (1<=ma_cap) states: 64
abstracting: (3<=dr) states: 0
abstracting: (3<=r) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[ma_cap<=da | 1<=c_cap]]
normalized: ~ [E [true U ~ [[ma_cap<=da | 1<=c_cap]]]]

abstracting: (1<=c_cap) states: 64
abstracting: (ma_cap<=da) states: 96
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[[~ [3<=da] & ~ [a_cap<=mr]] & [[r_cap<=a | a_cap<=r] | [ma<=r & ma<=dr]]]]
normalized: ~ [E [true U ~ [[[[ma<=r & ma<=dr] | [r_cap<=a | a_cap<=r]] & [~ [a_cap<=mr] & ~ [3<=da]]]]]]

abstracting: (3<=da) states: 0
abstracting: (a_cap<=mr) states: 96
abstracting: (a_cap<=r) states: 96
abstracting: (r_cap<=a) states: 96
abstracting: (ma<=dr) states: 96
abstracting: (ma<=r) states: 96
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[3<=c | [[2<=mr_cap & da_a<=da] | ~ [mr<=ma]]]]
normalized: E [true U [3<=c | [~ [mr<=ma] | [2<=mr_cap & da_a<=da]]]]

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

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

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432332849853

--------------------
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:45 (2), effective:8 (0)

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

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

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

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

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

iterations count:55 (3), effective:10 (0)

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

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

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

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

iterations count:46 (2), effective:7 (0)

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

iterations count:25 (1), 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="CircadianClock-PT-000001"
export BK_EXAMINATION="ReachabilityCardinality"
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/CircadianClock-PT-000001.tgz
mv 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 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 r008kn-ebro-143214239100269"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;