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 S_CircadianClock-PT-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419500282
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433162852554

Model: S_CircadianClock-PT-000010
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 66 (6.6e+01) #states 644,204 (5)



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

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

abstracting: (3<=c) states: 468,512 (5)
abstracting: (r_cap<=dr_a) states: 87,846 (4)
abstracting: (ma_cap<=ma_cap) states: 644,204 (5)
abstracting: (a_cap<=da) states: 87,846 (4)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=mr) states: 527,076 (5)
abstracting: (ma_cap<=ma) states: 351,384 (5)
abstracting: (ma_cap<=da) states: 87,846 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[dr_a<=r_cap & 2<=r_cap] | [mr<=ma & mr_cap<=mr]] | c_cap<=da]]
normalized: ~ [E [true U ~ [[c_cap<=da | [[mr<=ma & mr_cap<=mr] | [dr_a<=r_cap & 2<=r_cap]]]]]]

abstracting: (2<=r_cap) states: 527,076 (5)
abstracting: (dr_a<=r_cap) states: 614,922 (5)
abstracting: (mr_cap<=mr) states: 351,384 (5)
abstracting: (mr<=ma) states: 351,384 (5)
abstracting: (c_cap<=da) states: 87,846 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[3<=r_cap & [c_cap<=da & 3<=da_a]] & [~ [r_cap<=a_cap] | ~ [dr_a<=c]]]]
normalized: E [true U [[~ [dr_a<=c] | ~ [r_cap<=a_cap]] & [3<=r_cap & [c_cap<=da & 3<=da_a]]]]

abstracting: (3<=da_a) states: 0
abstracting: (c_cap<=da) states: 87,846 (4)
abstracting: (3<=r_cap) states: 468,512 (5)
abstracting: (r_cap<=a_cap) states: 351,384 (5)
abstracting: (dr_a<=c) states: 614,922 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [~ [[2<=r_cap | da_a<=r]]]]
normalized: ~ [E [true U ~ [[2<=r_cap | da_a<=r]]]]

abstracting: (da_a<=r) states: 614,922 (5)
abstracting: (2<=r_cap) states: 527,076 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [[r_cap<=a & 3<=mr]] | [[a<=dr_a & 2<=mr] | 2<=dr_a]]]
normalized: ~ [E [true U ~ [[[2<=dr_a | [a<=dr_a & 2<=mr]] | ~ [[r_cap<=a & 3<=mr]]]]]]

abstracting: (3<=mr) states: 468,512 (5)
abstracting: (r_cap<=a) states: 351,384 (5)
abstracting: (2<=mr) states: 527,076 (5)
abstracting: (a<=dr_a) states: 87,846 (4)
abstracting: (2<=dr_a) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=r_cap) states: 527,076 (5)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (1<=a_cap) states: 585,640 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (a<=r_cap) states: 351,384 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (c_cap<=r) states: 351,384 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[da_a<=r_cap | [~ [2<=a_cap] & [2<=dr_a & 1<=dr_a]]]]
normalized: ~ [E [true U ~ [[da_a<=r_cap | [[2<=dr_a & 1<=dr_a] & ~ [2<=a_cap]]]]]]

abstracting: (2<=a_cap) states: 527,076 (5)
abstracting: (1<=dr_a) states: 322,102 (5)
abstracting: (2<=dr_a) states: 0
abstracting: (da_a<=r_cap) states: 614,922 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[1<=a_cap & a<=c_cap]]
normalized: ~ [E [true U ~ [[1<=a_cap & a<=c_cap]]]]

abstracting: (a<=c_cap) states: 351,384 (5)
abstracting: (1<=a_cap) states: 585,640 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[r<=r & ~ [[dr_a<=mr_cap & 3<=da]]]]
normalized: ~ [E [true U ~ [[r<=r & ~ [[dr_a<=mr_cap & 3<=da]]]]]]

abstracting: (3<=da) states: 0
abstracting: (dr_a<=mr_cap) states: 614,922 (5)
abstracting: (r<=r) states: 644,204 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (c_cap<=da) states: 87,846 (4)
abstracting: (dr<=r_cap) states: 614,922 (5)
abstracting: (1<=c_cap) states: 585,640 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [~ [[2<=dr & da_a<=mr]]]]
normalized: E [true U [2<=dr & da_a<=mr]]

abstracting: (da_a<=mr) states: 614,922 (5)
abstracting: (2<=dr) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433162862306

--------------------
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:653 (40), effective:136 (8)

initing FirstDep: 0m0sec


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

iterations count:85 (5), effective:17 (1)

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

iterations count:54 (3), effective:9 (0)

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

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

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

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

iterations count:48 (3), effective:7 (0)

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

iterations count:61 (3), effective:9 (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="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/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-2265"
echo " Executing tool marcie"
echo " Input is S_CircadianClock-PT-000010, 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 r120st-ebro-143297419500282"
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 ;