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 200K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C0001N0000100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998300275
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526713624826

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0001N0000100000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0001N0000100000 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C0001N0000100000 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0001N0000100000-UpperBounds.task
lola: LP says that atomic proposition is always false: (NADplus <= 0)
lola: MAX(_2PG) : MAX(ADP) : MAX(_1_3_BPG) : MAX(GAP) : MAX(Pyr) : MAX(c2) : MAX(DHAP) : MAX(E4P) : MAX(a2) : MAX(Xu5P) : MAX(b2) : MAX(c2) : MAX(Ru5P) : MAX(NADplus) : MAX(Gluc) : MAX(c1)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADplus)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NADplus)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 200000
lola: SUBRESULT
lola: result: 200000
lola: produced by: state space
lola: The maximum value of the given expression is 200000
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-13 200000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ADP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ADP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 14
lola: SUBRESULT
lola: result: 14
lola: produced by: state space
lola: The maximum value of the given expression is 14
lola: 20 markings, 19 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-1 14 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(_1_3_BPG)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 32 markings, 31 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-2 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GAP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GAP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 4419862 markings, 5443517 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-3 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Pyr)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Pyr)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 60 markings, 59 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-4 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 14 markings, 13 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-5 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DHAP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(DHAP)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 4319047 markings, 5339866 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-6 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(E4P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(E4P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 2
lola: 5401367 markings, 7990278 edges, 1080273 markings/sec, 0 secs
lola: 8970484 markings, 16294687 edges, 713823 markings/sec, 5 secs
lola: 12385115 markings, 24239717 edges, 682926 markings/sec, 10 secs
lola: 15883603 markings, 32379969 edges, 699698 markings/sec, 15 secs
lola: 19431793 markings, 40635768 edges, 709638 markings/sec, 20 secs
lola: 23002119 markings, 48942871 edges, 714065 markings/sec, 25 secs
lola: 26483435 markings, 57043040 edges, 696263 markings/sec, 30 secs
lola: 29908617 markings, 65012500 edges, 685036 markings/sec, 35 secs
lola: 33514886 markings, 73403534 edges, 721254 markings/sec, 40 secs
lola: 37009335 markings, 81534324 edges, 698890 markings/sec, 45 secs
lola: 40547469 markings, 89766546 edges, 707627 markings/sec, 50 secs
lola: 44080082 markings, 97985957 edges, 706523 markings/sec, 55 secs
lola: 47642053 markings, 106273822 edges, 712394 markings/sec, 60 secs
lola: 51194016 markings, 114361619 edges, 710393 markings/sec, 65 secs
lola: 54600651 markings, 122087773 edges, 681327 markings/sec, 70 secs
lola: 57983138 markings, 129759085 edges, 676497 markings/sec, 75 secs
lola: 61358189 markings, 137413645 edges, 675010 markings/sec, 80 secs
lola: 64717096 markings, 145031550 edges, 671781 markings/sec, 85 secs
lola: 68066566 markings, 152628176 edges, 669894 markings/sec, 90 secs
lola: 71459809 markings, 160323786 edges, 678649 markings/sec, 95 secs
lola: 74896657 markings, 168118622 edges, 687370 markings/sec, 100 secs
lola: 78305783 markings, 175850372 edges, 681825 markings/sec, 105 secs
lola: 81703141 markings, 183555349 edges, 679472 markings/sec, 110 secs
lola: 85081764 markings, 191218011 edges, 675725 markings/sec, 115 secs
lola: 88443762 markings, 198842932 edges, 672400 markings/sec, 120 secs
lola: 91831444 markings, 206526113 edges, 677536 markings/sec, 125 secs
lola: 95053557 markings, 213833770 edges, 644423 markings/sec, 130 secs
lola: 98502868 markings, 221656748 edges, 689862 markings/sec, 135 secs
lola: 101963237 markings, 229504734 edges, 692074 markings/sec, 140 secs
lola: 105452527 markings, 237418421 edges, 697858 markings/sec, 145 secs
lola: 108981751 markings, 245422485 edges, 705845 markings/sec, 150 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 111251507 markings, 250570338 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 7 markings, 6 edges

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-8 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Xu5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Xu5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 13 markings, 12 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(b2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(b2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 4 markings, 3 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-10 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 14 markings, 13 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-11 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ru5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ru5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 10 markings, 9 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-12 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_2PG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(_2PG)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 46 markings, 45 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-0 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Gluc)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Gluc)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-14 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0001N0000100000-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0001N0000100000-UpperBounds-15 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 7 14 7 7 7 7 7 1 2 2 3 7 3 200000 4 7
lola:
preliminary result: 7 14 7 7 7 7 7 1 2 2 3 7 3 200000 4 7
lola: memory consumption: 18400 KB
lola: time consumption: 167 seconds

BK_STOP 1526713792477

--------------------
content from 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="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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/GPPP-PT-C0001N0000100000.tgz
mv GPPP-PT-C0001N0000100000 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 lola"
echo " Input is GPPP-PT-C0001N0000100000, 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 r088-blw7-152649998300275"
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 ;