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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093300065
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-UpperBounds-0
FORMULA_NAME Peterson-COL-3-UpperBounds-1
FORMULA_NAME Peterson-COL-3-UpperBounds-10
FORMULA_NAME Peterson-COL-3-UpperBounds-11
FORMULA_NAME Peterson-COL-3-UpperBounds-12
FORMULA_NAME Peterson-COL-3-UpperBounds-13
FORMULA_NAME Peterson-COL-3-UpperBounds-14
FORMULA_NAME Peterson-COL-3-UpperBounds-15
FORMULA_NAME Peterson-COL-3-UpperBounds-2
FORMULA_NAME Peterson-COL-3-UpperBounds-3
FORMULA_NAME Peterson-COL-3-UpperBounds-4
FORMULA_NAME Peterson-COL-3-UpperBounds-5
FORMULA_NAME Peterson-COL-3-UpperBounds-6
FORMULA_NAME Peterson-COL-3-UpperBounds-7
FORMULA_NAME Peterson-COL-3-UpperBounds-8
FORMULA_NAME Peterson-COL-3-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1464102579255


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=UpperBounds.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Peterson_PT_3
(NrP: 244 NrTr: 332 NrArc: 1016)

net check time: 0m 0.000sec

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

init dd package: 0m10.335sec


RS generation: 2m27.961sec


-> reachability set: #nodes 170194 (1.7e+05) #states 3,407,946 (6)



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

checking: place_bound(CS_3,CS_1,CS_2,CS_0)
normalized: place_bound(CS_3,CS_1,CS_2,CS_0)

-> the formula is 1

FORMULA Peterson-COL-3-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)
normalized: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-4 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)
normalized: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-9 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)
normalized: place_bound(Idle_3,Idle_2,Idle_1,Idle_0)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-13 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WantSection_0_T,WantSection_3_F,WantSection_2_F,WantSection_1_F,WantSection_0_F,WantSection_3_T,WantSection_2_T,WantSection_1_T)
normalized: place_bound(WantSection_0_T,WantSection_3_F,WantSection_2_F,WantSection_1_F,WantSection_0_F,WantSection_3_T,WantSection_2_T,WantSection_1_T)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-15 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(AskForSection_0_2,AskForSection_3_1,AskForSection_2_1,AskForSection_1_1,AskForSection_0_1,AskForSection_3_0,AskForSection_2_0,AskForSection_1_0,AskForSection_0_0,AskForSection_3_2,AskForSection_1_2,AskForSection_2_2)
normalized: place_bound(AskForSection_0_2,AskForSection_3_1,AskForSection_2_1,AskForSection_1_1,AskForSection_0_1,AskForSection_3_0,AskForSection_2_0,AskForSection_1_0,AskForSection_0_0,AskForSection_3_2,AskForSection_1_2,AskForSection_2_2)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-1 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)
normalized: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-2 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)
normalized: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)

-> the formula is 3

FORMULA Peterson-COL-3-UpperBounds-3 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)
normalized: place_bound(TestTurn_0_0,TestTurn_1_0,TestTurn_2_0,TestTurn_3_0,TestTurn_0_1,TestTurn_0_2,TestTurn_3_1,TestTurn_2_1,TestTurn_1_1,TestTurn_3_2,TestTurn_2_2,TestTurn_1_2)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-7 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)
normalized: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)

-> the formula is 3

FORMULA Peterson-COL-3-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)
normalized: place_bound(EndTurn_0_0,EndTurn_0_1,EndTurn_3_0,EndTurn_2_0,EndTurn_1_0,EndTurn_0_2,EndTurn_3_1,EndTurn_2_1,EndTurn_1_1,EndTurn_3_2,EndTurn_2_2,EndTurn_1_2)

-> the formula is 3

FORMULA Peterson-COL-3-UpperBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestAlone_1_0_0,TestAlone_3_2_0,TestAlone_2_2_0,TestAlone_1_2_0,TestAlone_3_1_0,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_3_0_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_3_2_1,TestAlone_3_0_2,TestAlone_1_0_2,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_0_2_2,TestAlone_3_1_2,TestAlone_2_0_1,TestAlone_0_0_1,TestAlone_0_1_1,TestAlone_3_0_1,TestAlone_3_1_1,TestAlone_2_1_1,TestAlone_2_2_1,TestAlone_0_2_1,TestAlone_0_2_3,TestAlone_1_2_3,TestAlone_2_2_3,TestAlone_1_2_2,TestAlone_3_2_2,TestAlone_0_0_3,TestAlone_1_0_3,TestAlone_2_0_3,TestAlone_0_1_3,TestAlone_1_1_3,TestAlone_2_1_3)
normalized: place_bound(TestAlone_1_0_0,TestAlone_3_2_0,TestAlone_2_2_0,TestAlone_1_2_0,TestAlone_3_1_0,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_3_0_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_3_2_1,TestAlone_3_0_2,TestAlone_1_0_2,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_0_2_2,TestAlone_3_1_2,TestAlone_2_0_1,TestAlone_0_0_1,TestAlone_0_1_1,TestAlone_3_0_1,TestAlone_3_1_1,TestAlone_2_1_1,TestAlone_2_2_1,TestAlone_0_2_1,TestAlone_0_2_3,TestAlone_1_2_3,TestAlone_2_2_3,TestAlone_1_2_2,TestAlone_3_2_2,TestAlone_0_0_3,TestAlone_1_0_3,TestAlone_2_0_3,TestAlone_0_1_3,TestAlone_1_1_3,TestAlone_2_1_3)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-6 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestIdentity_0_1_0,TestIdentity_3_0_0,TestIdentity_2_0_0,TestIdentity_1_0_0,TestIdentity_0_2_0,TestIdentity_3_1_0,TestIdentity_2_1_0,TestIdentity_1_1_0,TestIdentity_0_0_0,TestIdentity_3_1_1,TestIdentity_0_2_1,TestIdentity_1_1_1,TestIdentity_2_1_1,TestIdentity_3_2_1,TestIdentity_0_0_2,TestIdentity_1_2_1,TestIdentity_2_2_1,TestIdentity_3_2_0,TestIdentity_0_0_1,TestIdentity_1_2_0,TestIdentity_2_2_0,TestIdentity_3_0_1,TestIdentity_0_1_1,TestIdentity_1_0_1,TestIdentity_2_0_1,TestIdentity_2_0_3,TestIdentity_1_0_3,TestIdentity_0_1_3,TestIdentity_3_0_3,TestIdentity_2_2_2,TestIdentity_1_2_2,TestIdentity_0_0_3,TestIdentity_3_2_2,TestIdentity_2_1_2,TestIdentity_1_1_2,TestIdentity_0_2_2,TestIdentity_3_1_2,TestIdentity_2_0_2,TestIdentity_1_0_2,TestIdentity_0_1_2,TestIdentity_3_0_2,TestIdentity_1_2_3,TestIdentity_2_2_3,TestIdentity_3_2_3,TestIdentity_1_1_3,TestIdentity_2_1_3,TestIdentity_3_1_3,TestIdentity_0_2_3)
normalized: place_bound(TestIdentity_0_1_0,TestIdentity_3_0_0,TestIdentity_2_0_0,TestIdentity_1_0_0,TestIdentity_0_2_0,TestIdentity_3_1_0,TestIdentity_2_1_0,TestIdentity_1_1_0,TestIdentity_0_0_0,TestIdentity_3_1_1,TestIdentity_0_2_1,TestIdentity_1_1_1,TestIdentity_2_1_1,TestIdentity_3_2_1,TestIdentity_0_0_2,TestIdentity_1_2_1,TestIdentity_2_2_1,TestIdentity_3_2_0,TestIdentity_0_0_1,TestIdentity_1_2_0,TestIdentity_2_2_0,TestIdentity_3_0_1,TestIdentity_0_1_1,TestIdentity_1_0_1,TestIdentity_2_0_1,TestIdentity_2_0_3,TestIdentity_1_0_3,TestIdentity_0_1_3,TestIdentity_3_0_3,TestIdentity_2_2_2,TestIdentity_1_2_2,TestIdentity_0_0_3,TestIdentity_3_2_2,TestIdentity_2_1_2,TestIdentity_1_1_2,TestIdentity_0_2_2,TestIdentity_3_1_2,TestIdentity_2_0_2,TestIdentity_1_0_2,TestIdentity_0_1_2,TestIdentity_3_0_2,TestIdentity_1_2_3,TestIdentity_2_2_3,TestIdentity_3_2_3,TestIdentity_1_1_3,TestIdentity_2_1_3,TestIdentity_3_1_3,TestIdentity_0_2_3)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-5 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_3_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_3_1_0,IsEndLoop_0_2_0,IsEndLoop_1_2_0,IsEndLoop_2_2_0,IsEndLoop_3_2_0,IsEndLoop_0_0_1,IsEndLoop_2_0_1,IsEndLoop_1_0_1,IsEndLoop_0_1_1,IsEndLoop_3_0_1,IsEndLoop_2_1_1,IsEndLoop_1_1_1,IsEndLoop_0_2_1,IsEndLoop_3_1_1,IsEndLoop_2_2_1,IsEndLoop_1_2_1,IsEndLoop_0_0_2,IsEndLoop_3_2_1,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_0_1_2,IsEndLoop_3_0_2,IsEndLoop_3_1_2,IsEndLoop_0_2_2,IsEndLoop_1_1_2,IsEndLoop_2_1_2,IsEndLoop_3_2_2,IsEndLoop_0_0_3,IsEndLoop_1_2_2,IsEndLoop_2_2_2,IsEndLoop_3_0_3,IsEndLoop_0_1_3,IsEndLoop_1_0_3,IsEndLoop_2_0_3,IsEndLoop_3_1_3,IsEndLoop_0_2_3,IsEndLoop_1_1_3,IsEndLoop_2_1_3,IsEndLoop_3_2_3,IsEndLoop_2_2_3,IsEndLoop_1_2_3)
normalized: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_3_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_3_1_0,IsEndLoop_0_2_0,IsEndLoop_1_2_0,IsEndLoop_2_2_0,IsEndLoop_3_2_0,IsEndLoop_0_0_1,IsEndLoop_2_0_1,IsEndLoop_1_0_1,IsEndLoop_0_1_1,IsEndLoop_3_0_1,IsEndLoop_2_1_1,IsEndLoop_1_1_1,IsEndLoop_0_2_1,IsEndLoop_3_1_1,IsEndLoop_2_2_1,IsEndLoop_1_2_1,IsEndLoop_0_0_2,IsEndLoop_3_2_1,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_0_1_2,IsEndLoop_3_0_2,IsEndLoop_3_1_2,IsEndLoop_0_2_2,IsEndLoop_1_1_2,IsEndLoop_2_1_2,IsEndLoop_3_2_2,IsEndLoop_0_0_3,IsEndLoop_1_2_2,IsEndLoop_2_2_2,IsEndLoop_3_0_3,IsEndLoop_0_1_3,IsEndLoop_1_0_3,IsEndLoop_2_0_3,IsEndLoop_3_1_3,IsEndLoop_0_2_3,IsEndLoop_1_1_3,IsEndLoop_2_1_3,IsEndLoop_3_2_3,IsEndLoop_2_2_3,IsEndLoop_1_2_3)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-8 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)
normalized: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-11 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)
normalized: place_bound(BeginLoop_0_0_0,BeginLoop_1_1_0,BeginLoop_2_1_0,BeginLoop_3_1_0,BeginLoop_0_2_0,BeginLoop_1_0_0,BeginLoop_2_0_0,BeginLoop_3_0_0,BeginLoop_0_1_0,BeginLoop_1_0_1,BeginLoop_2_0_1,BeginLoop_3_0_1,BeginLoop_0_1_1,BeginLoop_1_2_0,BeginLoop_2_2_0,BeginLoop_3_2_0,BeginLoop_0_0_1,BeginLoop_2_2_1,BeginLoop_1_2_1,BeginLoop_0_0_2,BeginLoop_3_2_1,BeginLoop_2_1_1,BeginLoop_1_1_1,BeginLoop_0_2_1,BeginLoop_3_1_1,BeginLoop_2_1_2,BeginLoop_1_1_2,BeginLoop_0_2_2,BeginLoop_3_1_2,BeginLoop_2_0_2,BeginLoop_1_0_2,BeginLoop_0_1_2,BeginLoop_3_0_2,BeginLoop_3_0_3,BeginLoop_0_1_3,BeginLoop_1_0_3,BeginLoop_2_0_3,BeginLoop_3_2_2,BeginLoop_0_0_3,BeginLoop_1_2_2,BeginLoop_2_2_2,BeginLoop_3_2_3,BeginLoop_1_2_3,BeginLoop_2_2_3,BeginLoop_3_1_3,BeginLoop_0_2_3,BeginLoop_1_1_3,BeginLoop_2_1_3)

-> the formula is 4

FORMULA Peterson-COL-3-UpperBounds-12 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 3m23.559sec


BK_STOP 1464102782891

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

967 2445 5013 5535 6419 7011 8050 7850 8058 8270 16014 18420 18877 19354 19772 20470 20773 20985 21370 21744 22962 23781 24691 25199 26392 27132 28275 27999 28895 28924 29519 29368 28814 29251 29382 29097 29178 28938 29228 28895 29620 30582 29248 30140 30707 31088 30525 33694 35711 36288 37214 36981 36599 36551 37268 37888 38007 38522 38691 38490 38299 38665 38918 38450 48717 50250 51311 51315 51639 51038 51626 53016 53725 54290 55265 55542 55365 55708 56648 57314 56980 63453 65216 65948 65419 65909 66456 66016 65955 66135 67110 66715 66845 66797 67311 67895 67890 67524 67744 67593 67180 66359 66672 66655 65430 67104 67100 72905 74037 74637 74123 73630 75814 77129 77615 78096 78247 78135 77430 77858 78229 77953 78123 78301 77678 77318 77574 77629 76325 75890 77828 83464 85549 86300 86801 87314 87359 88054 90002 89514 89290 88928 88724 88725 88147 88252 94396 95805 96458 97859 98216 98805 98567 98642 98697 98885 98463 98279 98354 98744 98530 99406 103218 103641 104396 104040 103299 103856 104021 103997 103496 103367 104869 105369 105526 104935 105418 105359 104720 105214 105461 104667 105392 106353 109182 109928 110353 109705 108875 109106 109213 110953 115356 116914 117655 118288 118194 117770 118106 118683 119088 118994 119408 119513 119058 119145 119478 119553 118403 120127 119954 123692 124997 125484 125634 126101 126099 126598 128725 128273 127822 127403 127434 126905 126664 126467 128264 127120 128370 129216 130556 130995 130919 131015 130786 131145 132667 132365 131672 131329 131104 131197 130561 130881 129618 128467 127403 129729 130116 130842 138238 140020 140294 141035 140871 141276 143028 142555 142351 142033 141995 141434 141478 142643 146499 147197 147183 149065 149877 149742 149985 149476 149691 149646 149977 149699 150406 154234 154702 155430 155584 155949 155845 155285 155126 154462 154894 155432 154962 155035 155026 154831 154091 154453 154658 153850 152472 152232 152522 152189 153196 153876 156312 156317 156695 156067 155745 156619 156715 158384 158297 158131 159672 160418 165248 166417 166912 167154 167465 167374 167080 167704 167705 166870 167020 166959 166436 165830 166021 165498 165130 164707 165888 165507 165788 166255 167532 168329 168219 168585 168885 168954 169412 169892 169278 168818 168219 167823 167503 166731 167042 166566 165618 165787 164337 163529 167567 169787 169913 170134 170611 170240 172089 172117 171855 171622 171620 171124 170669 170642 172350 171720 171920 173311 173559 173981 173993 175551 176914 176624 177087 177564 177193 177825 178024 177267 176713 176612 176116 175661 175948 175888 174406 175198 174230 173595 173367 173471 174882 174918 175331 175375 175552 176219 176213 175951 175718 175514 175220 175090 174340 173557 173382 172849 171490 170764
iterations count:416217 (1253), effective:7444 (22)

initing FirstDep: 0m 0.002sec

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="Peterson-PT-3"
export BK_EXAMINATION="UpperBounds"
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/Peterson-PT-3.tgz
mv Peterson-PT-3 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 Peterson-PT-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r089kn-ebro-146369093300065"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;