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 188K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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-C0010N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998300289
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526720257558

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0010N0000000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0010N0000000100 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C0010N0000000100 @ 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, 21 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-C0010N0000000100-UpperBounds.task
lola: LP says that atomic proposition is always false: (GSSG <= 0)
lola: LP says that atomic proposition is always false: (NADplus <= 0)
lola: LP says that atomic proposition is always false: (NADplus <= 0)
lola: LP says that atomic proposition is always false: (GSSG <= 0)
lola: MAX(b2) : MAX(GSSG) : MAX(c1) : MAX(ADP) : MAX(start) : MAX(c2) : MAX(ADP) : MAX(NADPH) : MAX(NADplus) : MAX(S7P) : MAX(c1) : MAX(Xu5P) : MAX(NADplus) : MAX(GSSG) : MAX(GAP) : MAX(E4P)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSSG)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 5318486 markings, 8108687 edges, 1063697 markings/sec, 30 secs
lola: 10417387 markings, 15865862 edges, 1019780 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 12291033 markings, 18682920 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-1 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 230 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-C0010N0000000100-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: 200
lola: SUBRESULT
lola: result: 200
lola: produced by: state space
lola: The maximum value of the given expression is 200
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-8 200 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 247 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-C0010N0000000100-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: 200
lola: SUBRESULT
lola: result: 200
lola: produced by: state space
lola: The maximum value of the given expression is 200
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-12 200 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSSG)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 1206 markings, 1664 edges, 241 markings/sec, 25 secs
lola: 5334143 markings, 8132588 edges, 1066587 markings/sec, 30 secs
lola: 10471361 markings, 15944764 edges, 1027444 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 12291033 markings, 18682920 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-13 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(start)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(start)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 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-C0010N0000000100-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 376 markings, 437 edges, 75 markings/sec, 25 secs
lola: 3561284 markings, 9099514 edges, 712182 markings/sec, 30 secs
lola: 6770375 markings, 17873072 edges, 641818 markings/sec, 35 secs
lola: 9592505 markings, 26282792 edges, 564426 markings/sec, 40 secs
lola: 12541223 markings, 34902695 edges, 589744 markings/sec, 45 secs
lola: 15191722 markings, 43266200 edges, 530100 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 15311708 markings, 43614195 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-5 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 336 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-C0010N0000000100-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: 114
lola: SUBRESULT
lola: result: 114
lola: produced by: state space
lola: The maximum value of the given expression is 114
lola: 93 markings, 92 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-6 114 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADPH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NADPH)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 84
lola: 2622073 markings, 6560151 edges, 524415 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 76
lola: produced by: state space
lola: The maximum value of the given expression is 76
lola: 4300145 markings, 10692032 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-7 76 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 419 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-C0010N0000000100-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: 30
lola: SUBRESULT
lola: result: 30
lola: produced by: state space
lola: The maximum value of the given expression is 30
lola: 4 markings, 3 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-0 30 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(S7P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(S7P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 72 markings, 71 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 559 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-C0010N0000000100-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: 70
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 0 markings, 0 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-10 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 671 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-C0010N0000000100-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: 38
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 476486 markings, 914865 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-11 36 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 839 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-C0010N0000000100-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: 70
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 0 markings, 0 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-2 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1118 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-C0010N0000000100-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: 114
lola: SUBRESULT
lola: result: 114
lola: produced by: state space
lola: The maximum value of the given expression is 114
lola: 93 markings, 92 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-3 114 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1676 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-C0010N0000000100-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 10
lola: 1505720 markings, 5591920 edges, 301144 markings/sec, 5 secs
lola: 3597512 markings, 15275893 edges, 418358 markings/sec, 10 secs
lola: 5960438 markings, 24637811 edges, 472585 markings/sec, 15 secs
lola: 8178221 markings, 33124560 edges, 443557 markings/sec, 20 secs
lola: 10327044 markings, 42518956 edges, 429765 markings/sec, 25 secs
lola: 12322032 markings, 51580191 edges, 398998 markings/sec, 30 secs
lola: 14351807 markings, 59957129 edges, 405955 markings/sec, 35 secs
lola: 16151654 markings, 68876233 edges, 359969 markings/sec, 40 secs
lola: 18021608 markings, 78415139 edges, 373991 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 18360807 markings, 80179333 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-14 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3302 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-C0010N0000000100-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 14 markings, 13 edges

FORMULA GPPP-PT-C0010N0000000100-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 30 100 70 114 1 70 114 76 200 2 70 36 200 100 10 1
lola:
preliminary result: 30 100 70 114 1 70 114 76 200 2 70 36 200 100 10 1
lola: ========================================
lola: memory consumption: 18388 KB
lola: time consumption: 268 seconds

BK_STOP 1526720525297

--------------------
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-C0010N0000000100"
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-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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-C0010N0000000100, 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-152649998300289"
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 ;