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)
......................
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 82K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 201K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 55K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 64K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 506K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BART-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308100058
=====================================================================

--------------------
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 BART-PT-002-UpperBounds-00
FORMULA_NAME BART-PT-002-UpperBounds-01
FORMULA_NAME BART-PT-002-UpperBounds-02
FORMULA_NAME BART-PT-002-UpperBounds-03
FORMULA_NAME BART-PT-002-UpperBounds-04
FORMULA_NAME BART-PT-002-UpperBounds-05
FORMULA_NAME BART-PT-002-UpperBounds-06
FORMULA_NAME BART-PT-002-UpperBounds-07
FORMULA_NAME BART-PT-002-UpperBounds-08
FORMULA_NAME BART-PT-002-UpperBounds-09
FORMULA_NAME BART-PT-002-UpperBounds-10
FORMULA_NAME BART-PT-002-UpperBounds-11
FORMULA_NAME BART-PT-002-UpperBounds-12
FORMULA_NAME BART-PT-002-UpperBounds-13
FORMULA_NAME BART-PT-002-UpperBounds-14
FORMULA_NAME BART-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526739284687


BK_STOP 1526739332282

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BART-PT-002 as instance name.
Using BART as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 669, 'Memory': 108.49, 'Tool': 'lola'}, {'Time': 7946, 'Memory': 2226.98, 'Tool': 'marcie'}, {'Time': 15447, 'Memory': 456.37, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola BART-PT-002...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BART-PT-002: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
BART-PT-002: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
UpperBounds @ BART-PT-002 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 878/65536 symbol table entries, 5 collisions
lola: preprocessing...
lola: finding significant places
lola: 474 places, 404 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 343 transition conflict sets
lola: TASK
lola: reading formula from BART-PT-002-UpperBounds.task
lola: MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5) : MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5) : MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5) : MAX(TrainState_2_4_33 + TrainState_2_4_32 + TrainState_2_4_31 + TrainState_2_4_30 + TrainState_2_4_29 + TrainState_2_4_28 + TrainState_2_4_27 + TrainState_2_4_26 + TrainState_2_4_25 + TrainState_2_4_24 + TrainState_2_4_23 + TrainState_2_4_22 + TrainState_2_4_21 + TrainState_2_4_20 + TrainState_2_4_19 + TrainState_2_4_18 + TrainState_2_4_17 + TrainState_2_4_16 + TrainState_2_4_15 + TrainState_2_4_14 + TrainState_2_4_13 + TrainState_2_4_12 + TrainState_2_4_11 + TrainState_1_2_38 + TrainState_1_2_37 + TrainState_1_2_36 + TrainState_1_2_35 + TrainState_1_2_34 + TrainState_1_0_0 + TrainState_1_2_33 + TrainState_1_2_32 + TrainState_1_2_31 + TrainState_1_2_30 + TrainState_1_2_29 + TrainState_1_2_28 + TrainState_1_2_27 + TrainState_1_2_26 + TrainState_1_1_10 + TrainState_1_1_11 + TrainState_1_1_12 + TrainState_1_1_13 + TrainState_1_1_14 + TrainState_1_1_15 + TrainState_1_1_16 + TrainState_1_1_17 + TrainState_1_1_18 + TrainState_1_1_19 + TrainState_1_1_20 + TrainState_1_1_21 + TrainState_1_1_22 + TrainState_1_1_23 + TrainState_1_1_24 + TrainState_1_1_25 + TrainState_1_1_26 + TrainState_1_1_27 + TrainState_1_1_28 + TrainState_1_1_29 + TrainState_1_1_30 + TrainState_1_1_31 + TrainState_1_1_32 + TrainState_1_1_33 + TrainState_1_1_34 + TrainState_1_1_35 + TrainState_1_1_36 + TrainState_1_1_37 + TrainState_1_1_38 + TrainState_1_1_39 + TrainState_1_1_40 + TrainState_1_2_25 + TrainState_2_3_10 + TrainState_2_3_11 + TrainState_2_3_12 + TrainState_2_3_13 + TrainState_2_3_14 + TrainState_2_3_15 + TrainState_2_3_16 + TrainState_2_3_17 + TrainState_2_3_18 + TrainState_2_3_19 + TrainState_1_1_1 + TrainState_1_1_2 + TrainState_1_1_3 + TrainState_1_1_4 + TrainState_1_1_5 + TrainState_1_1_6 + TrainState_1_1_7 + TrainState_1_1_8 + TrainState_1_1_9 + TrainState_2_3_20 + TrainState_2_3_21 + TrainState_2_3_22 + TrainState_2_3_23 + TrainState_2_3_24 + TrainState_2_3_25 + TrainState_2_3_26 + TrainState_2_3_27 + TrainState_2_3_28 + TrainState_2_3_29 + TrainState_2_3_30 + TrainState_2_3_31 + TrainState_2_3_32 + TrainState_2_3_33 + TrainState_2_3_34 + TrainState_2_3_35 + TrainState_2_3_36 + TrainState_2_3_37 + TrainState_1_2_24 + TrainState_1_2_23 + TrainState_1_2_22 + TrainState_1_2_21 + TrainState_1_2_20 + TrainState_1_2_19 + TrainState_1_2_18 + TrainState_1_2_17 + TrainState_1_2_16 + TrainState_1_2_4 + TrainState_1_2_5 + TrainState_1_2_6 + TrainState_1_2_7 + TrainState_1_2_8 + TrainState_1_2_9 + TrainState_1_2_15 + TrainState_1_2_14 + TrainState_1_2_13 + TrainState_1_2_12 + TrainState_1_2_11 + TrainState_1_2_10 + TrainState_1_3_37 + TrainState_1_3_36 + TrainState_1_3_35 + TrainState_1_3_34 + TrainState_1_3_33 + TrainState_1_3_32 + TrainState_1_3_31 + TrainState_1_3_7 + TrainState_1_3_8 + TrainState_1_3_9 + TrainState_1_3_30 + TrainState_1_3_29 + TrainState_1_3_28 + TrainState_1_3_27 + TrainState_1_3_26 + TrainState_1_3_25 + TrainState_1_3_24 + TrainState_1_3_23 + TrainState_1_3_22 + TrainState_1_3_21 + TrainState_1_3_20 + TrainState_2_2_10 + TrainState_2_2_11 + TrainState_2_2_12 + TrainState_2_2_13 + TrainState_2_2_14 + TrainState_2_2_15 + TrainState_2_2_16 + TrainState_2_2_17 + TrainState_2_2_18 + TrainState_2_2_19 + TrainState_2_2_20 + TrainState_2_2_21 + TrainState_2_2_22 + TrainState_2_2_23 + TrainState_2_2_24 + TrainState_2_2_25 + TrainState_2_2_26 + TrainState_2_2_27 + TrainState_2_2_28 + TrainState_2_2_29 + TrainState_2_2_30 + TrainState_2_2_31 + TrainState_2_2_32 + TrainState_2_2_33 + TrainState_2_2_34 + TrainState_2_2_35 + TrainState_2_2_36 + TrainState_2_2_37 + TrainState_2_2_38 + TrainState_2_2_39 + TrainState_1_3_19 + TrainState_1_3_18 + TrainState_1_3_17 + TrainState_1_3_16 + TrainState_1_3_15 + TrainState_1_3_14 + TrainState_1_3_13 + TrainState_1_3_12 + TrainState_1_3_11 + TrainState_1_3_10 + TrainState_2_3_9 + TrainState_2_3_8 + TrainState_2_3_7 + TrainState_1_4_34 + TrainState_1_4_33 + TrainState_1_4_32 + TrainState_1_4_31 + TrainState_1_4_30 + TrainState_1_4_29 + TrainState_1_4_28 + TrainState_1_4_27 + TrainState_1_4_26 + TrainState_1_4_25 + TrainState_1_4_24 + TrainState_1_4_23 + TrainState_1_4_22 + TrainState_1_4_21 + TrainState_1_4_20 + TrainState_1_4_19 + TrainState_1_4_18 + TrainState_1_4_17 + TrainState_1_4_16 + TrainState_1_4_15 + TrainState_1_4_14 + TrainState_1_4_13 + TrainState_1_4_12 + TrainState_1_4_11 + TrainState_2_2_9 + TrainState_2_2_8 + TrainState_2_2_7 + TrainState_2_2_6 + TrainState_2_2_5 + TrainState_2_2_4 + TrainState_2_1_40 + TrainState_2_1_9 + TrainState_2_1_8 + TrainState_2_1_7 + TrainState_2_1_6 + TrainState_2_1_5 + TrainState_2_1_4 + TrainState_2_1_3 + TrainState_2_1_2 + TrainState_2_1_1 + TrainState_2_1_39 + TrainState_2_0_0 + TrainState_2_1_38 + TrainState_2_1_37 + TrainState_2_1_36 + TrainState_2_1_35 + TrainState_2_1_34 + TrainState_2_1_33 + TrainState_2_1_32 + TrainState_2_1_31 + TrainState_2_1_30 + TrainState_2_1_10 + TrainState_2_1_11 + TrainState_2_1_12 + TrainState_2_1_13 + TrainState_2_1_14 + TrainState_2_1_15 + TrainState_2_1_16 + TrainState_2_1_17 + TrainState_2_1_18 + TrainState_2_1_19 + TrainState_2_1_20 + TrainState_2_1_21 + TrainState_2_1_22 + TrainState_2_1_23 + TrainState_2_1_24 + TrainState_2_1_25 + TrainState_2_1_26 + TrainState_2_1_27 + TrainState_2_1_28 + TrainState_2_1_29 + TrainState_1_2_39 + TrainState_2_4_34) : MAX(StopTable_4_10 + StopTable_5_15 + StopTable_3_6 + StopTable_2_3 + StopTable_1_1) : MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5) : MAX(StopTable_4_10 + StopTable_5_15 + StopTable_3_6 + StopTable_2_3 + StopTable_1_1) : MAX(NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_28_2_26 + NewDistTable_9_3_6 + NewDistTable_40_1_39 + NewDistTable_29_4_25 + NewDistTable_4_1_3 + NewDistTable_33_2_31 + NewDistTable_34_4_30 + NewDistTable_25_1_24 + NewDistTable_26_3_23 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_5_22 + NewDistTable_18_2_16 + NewDistTable_9_4_5 + NewDistTable_30_1_29 + NewDistTable_19_4_15 + NewDistTable_31_3_28 + NewDistTable_4_2_2 + NewDistTable_14_5_9 + NewDistTable_32_5_27 + NewDistTable_23_2_21 + NewDistTable_24_4_20 + NewDistTable_15_1_14 + NewDistTable_38_1_37 + NewDistTable_16_3_13 + NewDistTable_39_3_36 + NewDistTable_17_5_12 + NewDistTable_7_1_6 + NewDistTable_20_1_19 + NewDistTable_4_3_1 + NewDistTable_21_3_18 + NewDistTable_22_5_17 + NewDistTable_13_2_11 + NewDistTable_36_2_34 + NewDistTable_14_4_10 + NewDistTable_37_4_33 + NewDistTable_28_1_27 + NewDistTable_29_3_26 + NewDistTable_7_2_5 + NewDistTable_33_1_32 + NewDistTable_12_3_9 + NewDistTable_34_3_31 + NewDistTable_26_2_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_27_4_23 + NewDistTable_18_1_17 + NewDistTable_19_3_16 + NewDistTable_7_3_4 + NewDistTable_31_2_29 + NewDistTable_32_4_28 + NewDistTable_23_1_22 + NewDistTable_2_1_1 + NewDistTable_12_4_8 + NewDistTable_24_3_21 + NewDistTable_25_5_20 + NewDistTable_16_2_14 + NewDistTable_39_2_37 + NewDistTable_17_4_13 + NewDistTable_7_4_3 + NewDistTable_30_5_25 + NewDistTable_21_2_19 + NewDistTable_2_2_0 + NewDistTable_12_5_7 + NewDistTable_22_4_18 + NewDistTable_13_1_12 + NewDistTable_36_1_35 + NewDistTable_14_3_11 + NewDistTable_10_1_9 + NewDistTable_37_3_34 + NewDistTable_15_5_10 + NewDistTable_29_2_27 + NewDistTable_5_1_4 + NewDistTable_20_5_15 + NewDistTable_34_2_32 + NewDistTable_35_4_31 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_27_3_24 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_28_5_23 + NewDistTable_19_2_17) : MAX(TrainState_1_3_14) : MAX(DistStation_14) : MAX(NewDistTable_23_5_18) : MAX(TrainState_2_2_14) : MAX(TrainState_1_1_32) : MAX(TrainState_2_2_22) : MAX(NewDistTable_21_1_20) : MAX(TrainState_2_2_32)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistS... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistS... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistS... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_2_4_33 + TrainState_2_4_32 + TrainState_2_4_31 + TrainState_2_4_30 + TrainState_2_4_29 + TrainState_2_4_28 + TrainState_2_4_27 + TrainState_2_4_26 + TrainState_2_4_25 + TrainState_2_4_24 + TrainState_2_4_23 + TrainState_2_4_22 + TrainState_2_4_21 + TrainState_2_4_20 + TrainState_2_4_19 + TrainState_2_4_18 + TrainState_2_4_17 + TrainState_2_4_16 + TrainState_2_4_15 + TrainState_2_4_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(StopTable_4_10 + StopTable_5_15 + StopTable_3_6 + StopTable_2_3 + StopTable_1_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistS... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(StopTable_4_10 + StopTable_5_15 + StopTable_3_6 + StopTable_2_3 + StopTable_1_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTabl... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_1_3_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17424 markings, 53126 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DistStation_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NewDistTable_23_5_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_2_2_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17424 markings, 53126 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_1_1_32)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17424 markings, 53126 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_2_2_22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17424 markings, 53126 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NewDistTable_21_1_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_2_2_32)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17424 markings, 53126 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 36 36 36 2 5 36 5 169 1 1 1 1 1 1 1 1
FORMULA BART-PT-002-UpperBounds-0 36 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-1 36 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-2 36 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-3 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-4 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-5 36 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-6 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-7 169 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BART-PT-002-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="BART-PT-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="irma4mcc-full"
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/BART-PT-002.tgz
mv BART-PT-002 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is BART-PT-002, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-ebro-152646308100058"
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 ;