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-3254
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 r081-csrt-149441064600583
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: CircadianClock_PT_000001
(NrP: 14 NrTr: 16 NrArc: 58)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.249sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 14 (1.4e+01) #states 128



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

checking: AG [3<=a]
normalized: ~ [E [true U ~ [3<=a]]]

abstracting: (3<=a)
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: EF [3<=ma]
normalized: E [true U 3<=ma]

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (da_a<=c_cap)
states: 96
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[2<=a & ~ [~ [2<=ma_cap]]]]
normalized: E [true U [2<=a & 2<=ma_cap]]

abstracting: (2<=ma_cap)
states: 0
abstracting: (2<=a)
states: 0
-> 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 [[3<=dr & ~ [dr_a<=ma]]]
normalized: E [true U [~ [dr_a<=ma] & 3<=dr]]

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

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

MC time: 0m 0.000sec

checking: AG [[~ [~ [3<=a]] | c<=da_a]]
normalized: ~ [E [true U ~ [[3<=a | c<=da_a]]]]

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

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

MC time: 0m 0.000sec

checking: AG [[mr_cap<=dr & ~ [~ [c_cap<=dr_a]]]]
normalized: ~ [E [true U ~ [[mr_cap<=dr & c_cap<=dr_a]]]]

abstracting: (c_cap<=dr_a)
states: 96
abstracting: (mr_cap<=dr)
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: AG [[~ [[1<=mr | a<=dr_a]] | a<=c_cap]]
normalized: ~ [E [true U ~ [[~ [[1<=mr | a<=dr_a]] | a<=c_cap]]]]

abstracting: (a<=c_cap)
states: 96
abstracting: (a<=dr_a)
states: 96
abstracting: (1<=mr)
states: 64
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (mr<=a)
states: 96
abstracting: (2<=a_cap)
states: 0
abstracting: (r_cap<=dr_a)
states: 96
-> 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 [[r_cap<=da | [[r<=ma_cap | 3<=ma_cap] | 1<=dr_a]]]
normalized: E [true U [[[r<=ma_cap | 3<=ma_cap] | 1<=dr_a] | r_cap<=da]]

abstracting: (r_cap<=da)
states: 96
abstracting: (1<=dr_a)
states: 64
abstracting: (3<=ma_cap)
states: 0
abstracting: (r<=ma_cap)
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.000sec

checking: AG [[[~ [2<=a] & ma_cap<=dr] | [2<=dr_a & a_cap<=a_cap]]]
normalized: ~ [E [true U ~ [[[2<=dr_a & a_cap<=a_cap] | [~ [2<=a] & ma_cap<=dr]]]]]

abstracting: (ma_cap<=dr)
states: 96
abstracting: (2<=a)
states: 0
abstracting: (a_cap<=a_cap)
states: 128
abstracting: (2<=dr_a)
states: 0
-> 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<=a_cap & r_cap<=mr_cap] & ~ [1<=a]] | c<=c_cap]]
normalized: E [true U [[~ [1<=a] & [1<=a_cap & r_cap<=mr_cap]] | c<=c_cap]]

abstracting: (c<=c_cap)
states: 64
abstracting: (r_cap<=mr_cap)
states: 96
abstracting: (1<=a_cap)
states: 64
abstracting: (1<=a)
states: 64
-> 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 [[[[a<=da_a | 1<=dr] & [2<=c_cap & mr<=da]] | [~ [2<=c] & [dr<=ma & r<=ma_cap]]]]
normalized: ~ [E [true U ~ [[[[dr<=ma & r<=ma_cap] & ~ [2<=c]] | [[2<=c_cap & mr<=da] & [a<=da_a | 1<=dr]]]]]]

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

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

MC time: 0m 0.000sec

totally nodes used: 2113(2.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1107 1683 2790
used/not used/entry size/cache size: 1593 67107271 16 1024MB
basic ops cache: hits/miss/sum: 2320 3001 5321
used/not used/entry size/cache size: 6577 16770639 12 192MB
unary ops cache: hits/miss/sum: 0 21 21
used/not used/entry size/cache size: 21 8388587 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 103 156 259
used/not used/entry size/cache size: 156 2096996 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67106751
1 2113
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.788sec


BK_STOP 1494900264740

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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.000sec


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

initing FirstDep: 0m 0.000sec


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

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

iterations count:83 (5), effective:12 (0)

iterations count:76 (4), effective:11 (0)

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

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

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

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

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

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

iterations count:27 (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="S_CircadianClock-PT-000001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-3254"
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 r081-csrt-149441064600583"
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 ;