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_CircularTrains-PT-096, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262400088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465118535459


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: CircularTrains_PT_096
(NrP: 192 NrTr: 96 NrArc: 384)

net check time: 0m 0.000sec

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

init dd package: 0m16.137sec


RS generation: 0m 5.335sec


-> reachability set: #nodes 12299 (1.2e+04) #states 2,591,300,278,296,609,652,179 (21)



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

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

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

FORMULA CircularTrains-PT-096-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

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

FORMULA CircularTrains-PT-096-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

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

FORMULA CircularTrains-PT-096-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [1<=Section_46] & 3<=F27] & 2<=F52]]
normalized: E [true U [2<=F52 & [3<=F27 & ~ [1<=Section_46]]]]

abstracting: (1<=Section_46) states: 526,521,257,317,805,091,507 (20)
abstracting: (3<=F27) states: 0
abstracting: (2<=F52) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [~ [[[3<=F48 | 2<=Section_3] & 2<=Section_66]]]
normalized: ~ [E [true U [2<=Section_66 & [3<=F48 | 2<=Section_3]]]]

abstracting: (2<=Section_3) states: 0
abstracting: (3<=F48) states: 0
abstracting: (2<=Section_66) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[3<=Section_35 & F76<=F38]]
normalized: E [true U [3<=Section_35 & F76<=F38]]

abstracting: (F76<=F38) states: 2,424,191,713,348,205,405,682 (21)
abstracting: (3<=Section_35) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [[2<=Section_42 | [Section_95<=Section_68 | 1<=Section_75]]]
normalized: ~ [E [true U ~ [[2<=Section_42 | [Section_95<=Section_68 | 1<=Section_75]]]]]

abstracting: (1<=Section_75) states: 1,032,389,510,489,402,280,336 (21)
abstracting: (Section_95<=Section_68) states: 1,962,075,573,554,485,757,742 (21)
abstracting: (2<=Section_42) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.860sec

checking: EF [~ [[[3<=F43 & 1<=F14] | F30<=F59]]]
normalized: E [true U ~ [[F30<=F59 | [3<=F43 & 1<=F14]]]]

abstracting: (1<=F14) states: 2,188,135,472,549,331,266,280 (21)
abstracting: (3<=F43) states: 0
abstracting: (F30<=F59) states: 2,424,191,713,348,205,405,682 (21)
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.482sec

checking: EF [[3<=F34 & [[1<=F51 & 1<=Section_10] | ~ [F41<=Section_40]]]]
normalized: E [true U [3<=F34 & [~ [F41<=Section_40] | [1<=F51 & 1<=Section_10]]]]

abstracting: (1<=Section_10) states: 526,521,257,317,805,091,507 (20)
abstracting: (1<=F51) states: 1,032,389,510,489,402,280,336 (21)
abstracting: (F41<=Section_40) states: 612,906,373,994,653,017,378 (20)
abstracting: (3<=F34) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: AG [[[[1<=F75 & Section_6<=F13] | ~ [2<=F61]] | ~ [Section_53<=Section_16]]]
normalized: ~ [E [true U ~ [[~ [Section_53<=Section_16] | [~ [2<=F61] | [1<=F75 & Section_6<=F13]]]]]]

abstracting: (Section_6<=F13) states: 1,978,393,904,301,956,634,801 (21)
abstracting: (1<=F75) states: 1,032,389,510,489,402,280,336 (21)
abstracting: (2<=F61) states: 0
abstracting: (Section_53<=Section_16) states: 1,768,652,336,054,582,003,322 (21)
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: EF [[~ [Section_41<=Section_48] & [1<=Section_19 & [F80<=Section_15 | 2<=Section_32]]]]
normalized: E [true U [[1<=Section_19 & [F80<=Section_15 | 2<=Section_32]] & ~ [Section_41<=Section_48]]]

abstracting: (Section_41<=Section_48) states: 1,962,075,573,554,485,757,742 (21)
abstracting: (2<=Section_32) states: 0
abstracting: (F80<=Section_15) states: 901,067,052,345,013,831,959 (20)
abstracting: (1<=Section_19) states: 526,521,257,317,805,091,507 (20)
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.004sec

checking: EF [[[[F53<=F95 & 2<=F67] | ~ [Section_64<=Section_91]] & 2<=F48]]
normalized: E [true U [2<=F48 & [~ [Section_64<=Section_91] | [F53<=F95 & 2<=F67]]]]

abstracting: (2<=F67) states: 0
abstracting: (F53<=F95) states: 1,790,266,072,230,545,732,460 (21)
abstracting: (Section_64<=Section_91) states: 2,171,817,141,801,860,389,221 (21)
abstracting: (2<=F48) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [~ [[[F93<=Section_23 & Section_23<=Section_82] | [1<=Section_26 | F60<=F44]]]]
normalized: E [true U ~ [[[1<=Section_26 | F60<=F44] | [F93<=Section_23 & Section_23<=Section_82]]]]

abstracting: (Section_23<=Section_82) states: 1,768,652,336,054,582,003,322 (21)
abstracting: (F93<=Section_23) states: 1,978,393,904,301,956,634,801 (21)
abstracting: (F60<=F44) states: 2,424,191,713,348,205,405,682 (21)
abstracting: (1<=Section_26) states: 1,032,389,510,489,402,280,336 (21)
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.700sec

checking: EF [~ [[[F2<=Section_76 & Section_48<=Section_12] | [F36<=F37 | 1<=F83]]]]
normalized: E [true U ~ [[[F36<=F37 | 1<=F83] | [F2<=Section_76 & Section_48<=Section_12]]]]

abstracting: (Section_48<=Section_12) states: 1,962,075,573,554,485,757,742 (21)
abstracting: (F2<=Section_76) states: 658,962,825,541,100,695,791 (20)
abstracting: (1<=F83) states: 2,188,135,472,549,331,266,280 (21)
abstracting: (F36<=F37) states: 2,064,779,020,978,804,560,672 (21)
-> the formula is TRUE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.932sec

checking: AG [[[~ [2<=F66] & [F89<=F61 & Section_11<=Section_31]] | [~ [1<=Section_59] & [F69<=F32 | 2<=F82]]]]
normalized: ~ [E [true U ~ [[[[F69<=F32 | 2<=F82] & ~ [1<=Section_59]] | [[F89<=F61 & Section_11<=Section_31] & ~ [2<=F66]]]]]]

abstracting: (2<=F66) states: 0
abstracting: (Section_11<=Section_31) states: 1,768,652,336,054,582,003,322 (21)
abstracting: (F89<=F61) states: 907,913,948,839,968,418,821 (20)
abstracting: (1<=Section_59) states: 1,032,389,510,489,402,280,336 (21)
abstracting: (2<=F82) states: 0
abstracting: (F69<=F32) states: 2,424,191,713,348,205,405,682 (21)
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.676sec

checking: EF [[[[2<=Section_23 & 3<=F33] & [1<=Section_81 & Section_54<=F34]] | [[F23<=Section_4 & 2<=Section_94] | 3<=Section_93]]]
normalized: E [true U [[3<=Section_93 | [F23<=Section_4 & 2<=Section_94]] | [[1<=Section_81 & Section_54<=F34] & [2<=Section_23 & 3<=F33]]]]

abstracting: (3<=F33) states: 0
abstracting: (2<=Section_23) states: 0
abstracting: (Section_54<=F34) states: 1,978,393,904,301,956,634,801 (21)
abstracting: (1<=Section_81) states: 1,032,389,510,489,402,280,336 (21)
abstracting: (2<=Section_94) states: 0
abstracting: (F23<=Section_4) states: 658,962,825,541,100,695,791 (20)
abstracting: (3<=Section_93) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-096-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec


Total processing time: 1m 1.604sec


BK_STOP 1465118597148

--------------------
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.004sec

1475 2799 7311 12485 10939 11921 12927
iterations count:7616 (79), effective:1536 (16)

initing FirstDep: 0m 0.004sec


iterations count:880 (9), effective:140 (1)

iterations count:519 (5), effective:141 (1)
13777
iterations count:1276 (13), effective:273 (2)
16087
iterations count:1402 (14), effective:255 (2)
13673
iterations count:1110 (11), effective:278 (2)

iterations count:752 (7), effective:159 (1)

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_CircularTrains-PT-096"
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_CircularTrains-PT-096.tgz
mv S_CircularTrains-PT-096 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_CircularTrains-PT-096, 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-146444262400088"
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 ;