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-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064600588
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494900334571

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=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(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.321sec

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(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 4.170sec


RS generation: 0m 4.447sec


-> reachability set: #nodes 5016 (5.0e+03) #states 4,020,040,040,020,004 (15)



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

checking: EF [~ [EX [2<=a_cap]]]
normalized: E [true U ~ [EX [2<=a_cap]]]

abstracting: (2<=a_cap)
states: 4,012,007,991,987,996 (15)
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.209sec

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

abstracting: (3<=ma)
states: 4,007,991,967,971,992 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: AG [AG [[2<=mr | dr<=mr_cap]]]
normalized: ~ [E [true U E [true U ~ [[2<=mr | dr<=mr_cap]]]]]

abstracting: (dr<=mr_cap)
states: 4,018,032,028,012,002 (15)
abstracting: (2<=mr)
states: 4,012,007,991,987,996 (15)
-> the formula is TRUE

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

MC time: 0m 2.150sec

checking: [AG [EX [dr_a<=c]] & AF [[~ [1<=dr_a] & ~ [1<=c]]]]
normalized: [~ [EG [~ [[~ [1<=c] & ~ [1<=dr_a]]]]] & ~ [E [true U ~ [EX [dr_a<=c]]]]]

abstracting: (dr_a<=c)
states: 4,018,032,028,012,002 (15)
.abstracting: (1<=dr_a)
states: 2,010,020,020,010,002 (15)
abstracting: (1<=c)
states: 4,016,024,016,004,000 (15)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.589sec

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

abstracting: (1<=mr_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (2<=da)
states: 0
abstracting: (a<=a)
states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [~ [[[3<=c | 1<=c_cap] | c_cap<=r]]]
normalized: E [true U ~ [[c_cap<=r | [3<=c | 1<=c_cap]]]]

abstracting: (1<=c_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (3<=c)
states: 4,007,991,967,971,992 (15)
abstracting: (c_cap<=r)
states: 2,012,028,032,018,004 (15)
-> the formula is FALSE

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

MC time: 0m 5.617sec

checking: E [~ [3<=r] U [~ [3<=c] & [3<=dr_a & dr<=dr]]]
normalized: E [~ [3<=r] U [[3<=dr_a & dr<=dr] & ~ [3<=c]]]

abstracting: (3<=c)
states: 4,007,991,967,971,992 (15)
abstracting: (dr<=dr)
states: 4,020,040,040,020,004 (15)
abstracting: (3<=dr_a)
states: 0
abstracting: (3<=r)
states: 4,007,991,967,971,992 (15)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: [AG [AG [3<=r_cap]] | [[~ [[3<=ma_cap & 2<=r]] & AF [3<=mr_cap]] & 3<=ma]]
normalized: [[3<=ma & [~ [EG [~ [3<=mr_cap]]] & ~ [[3<=ma_cap & 2<=r]]]] | ~ [E [true U E [true U ~ [3<=r_cap]]]]]

abstracting: (3<=r_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (2<=r)
states: 4,012,007,991,987,996 (15)
abstracting: (3<=ma_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (3<=mr_cap)
states: 4,007,991,967,971,992 (15)
.
EG iterations: 1
abstracting: (3<=ma)
states: 4,007,991,967,971,992 (15)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.866sec

checking: [AG [AF [dr<=dr]] | ~ [EF [[ma_cap<=a | ma<=ma_cap]]]]
normalized: [~ [E [true U [ma_cap<=a | ma<=ma_cap]]] | ~ [E [true U EG [~ [dr<=dr]]]]]

abstracting: (dr<=dr)
states: 4,020,040,040,020,004 (15)
.
EG iterations: 1
abstracting: (ma<=ma_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (ma_cap<=a)
states: 2,012,028,032,018,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.407sec

checking: EF [[[[mr_cap<=da_a & r_cap<=ma_cap] & [2<=mr_cap & 3<=ma]] & EG [1<=a_cap]]]
normalized: E [true U [EG [1<=a_cap] & [[2<=mr_cap & 3<=ma] & [mr_cap<=da_a & r_cap<=ma_cap]]]]

abstracting: (r_cap<=ma_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (mr_cap<=da_a)
states: 6,024,036,024,006 (12)
abstracting: (3<=ma)
states: 4,007,991,967,971,992 (15)
abstracting: (2<=mr_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (1<=a_cap)
states: 4,016,024,016,004,000 (15)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 4.175sec

checking: [AG [EX [mr_cap<=mr_cap]] | [AG [[2<=c & ma<=r]] | EG [~ [da_a<=mr_cap]]]]
normalized: [[EG [~ [da_a<=mr_cap]] | ~ [E [true U ~ [[2<=c & ma<=r]]]]] | ~ [E [true U ~ [EX [mr_cap<=mr_cap]]]]]

abstracting: (mr_cap<=mr_cap)
states: 4,020,040,040,020,004 (15)
.abstracting: (ma<=r)
states: 2,012,028,032,018,004 (15)
abstracting: (2<=c)
states: 4,012,007,991,987,996 (15)
abstracting: (da_a<=mr_cap)
states: 4,018,032,028,012,002 (15)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.428sec

checking: [AG [1<=a_cap] & [EF [[r_cap<=mr_cap | 2<=mr_cap]] & EG [[c<=mr | 2<=dr]]]]
normalized: [[EG [[c<=mr | 2<=dr]] & E [true U [r_cap<=mr_cap | 2<=mr_cap]]] & ~ [E [true U ~ [1<=a_cap]]]]

abstracting: (1<=a_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (2<=mr_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (r_cap<=mr_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (2<=dr)
states: 0
abstracting: (c<=mr)
states: 2,012,028,032,018,004 (15)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m22.806sec

checking: [[~ [AG [2<=ma_cap]] | AF [r_cap<=da_a]] & E [da_a<=dr_a U [r_cap<=da | 3<=c_cap]]]
normalized: [E [da_a<=dr_a U [r_cap<=da | 3<=c_cap]] & [~ [EG [~ [r_cap<=da_a]]] | E [true U ~ [2<=ma_cap]]]]

abstracting: (2<=ma_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (r_cap<=da_a)
states: 6,024,036,024,006 (12)
.
EG iterations: 1
abstracting: (3<=c_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (r_cap<=da)
states: 6,024,036,024,006 (12)
abstracting: (da_a<=dr_a)
states: 3,015,030,030,015,003 (15)

BK_TIME_CONFINEMENT_REACHED

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:85028 (5314), effective:15003 (937)

initing FirstDep: 0m 0.000sec


iterations count:6034 (377), effective:1004 (62)

iterations count:61 (3), effective:12 (0)

iterations count:14042 (877), effective:4006 (250)

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

iterations count:17980 (1123), effective:2994 (187)

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

iterations count:3019 (188), effective:501 (31)

iterations count:15018 (938), effective:4001 (250)

iterations count:6034 (377), effective:1004 (62)

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

iterations count:15001 (937), effective:3996 (249)

iterations count:18006 (1125), effective:2999 (187)

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-001000"
export BK_EXAMINATION="CTLCardinality"
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-001000.tgz
mv S_CircadianClock-PT-001000 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-001000, 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 r081-csrt-149441064600588"
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 ;