About the Execution of LoLA for GPPP-PT-C0010N0000000010
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 184K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K 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 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-C0010N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998300282
=====================================================================
--------------------
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-C0010N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526715471925
info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0010N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0010N0000000010 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C0010N0000000010 @ 3569 seconds
lola: LoLA will run for 3569 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-C0010N0000000010-UpperBounds.task
lola: LP says that atomic proposition is always false: (NADplus <= 0)
lola: MAX(GAP) : MAX(PEP) : MAX(NADPplus) : MAX(c2) : MAX(R5P) : MAX(Xu5P) : MAX(GSH) : MAX(S7P) : MAX(G6P) : MAX(S7P) : MAX(_2PG) : MAX(ATP) : MAX(c2) : MAX(FBP) : MAX(NADplus) : MAX(Pyr)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 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-C0010N0000000010-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-14 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(PEP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(PEP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 222 markings, 221 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADPplus)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NADPplus)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-2 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 269 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-C0010N0000000010-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: 3873497 markings, 9467531 edges, 774699 markings/sec, 30 secs
lola: 7542384 markings, 18740865 edges, 733777 markings/sec, 35 secs
lola: 11162092 markings, 27465912 edges, 723942 markings/sec, 40 secs
lola: 14622529 markings, 35774222 edges, 692087 markings/sec, 45 secs
lola: 18116486 markings, 44438778 edges, 698791 markings/sec, 50 secs
lola: 21121831 markings, 52750856 edges, 601069 markings/sec, 55 secs
lola: 23823958 markings, 60888556 edges, 540425 markings/sec, 60 secs
lola: 26511546 markings, 68982548 edges, 537518 markings/sec, 65 secs
lola: 29126813 markings, 76878735 edges, 523053 markings/sec, 70 secs
lola: 31740980 markings, 84777709 edges, 522833 markings/sec, 75 secs
lola: 34375014 markings, 92740382 edges, 526807 markings/sec, 80 secs
lola: 37456470 markings, 101132076 edges, 616291 markings/sec, 85 secs
lola: 40192947 markings, 109338132 edges, 547295 markings/sec, 90 secs
lola: 43179101 markings, 117828261 edges, 597231 markings/sec, 95 secs
lola: 45833743 markings, 125783811 edges, 530928 markings/sec, 100 secs
lola: 48720511 markings, 134104508 edges, 577354 markings/sec, 105 secs
lola: 51179815 markings, 142009512 edges, 491861 markings/sec, 110 secs
lola: 53589192 markings, 149698988 edges, 481875 markings/sec, 115 secs
lola: 55982318 markings, 157337579 edges, 478625 markings/sec, 120 secs
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 58348953 markings, 164788918 edges
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-3 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(R5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R5P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: ========================================
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: 108 markings, 107 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 306 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-C0010N0000000010-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: 1007954 markings, 1435719 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-5 36 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(GSH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSH)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 24 markings, 23 edges
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-6 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 374 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-C0010N0000000010-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: 110 markings, 109 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-7 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(G6P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(G6P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 42 markings, 41 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-8 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 480 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-C0010N0000000010-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: 110 markings, 109 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 561 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-C0010N0000000010-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 212 markings, 211 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-10 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 10188 markings, 26758 edges, 2038 markings/sec, 25 secs
lola: 3357864 markings, 9685833 edges, 669535 markings/sec, 30 secs
lola: 6793907 markings, 18945393 edges, 687209 markings/sec, 35 secs
lola: 9744113 markings, 27141612 edges, 590041 markings/sec, 40 secs
lola: 12636000 markings, 35860167 edges, 578377 markings/sec, 45 secs
lola: 15560951 markings, 44213930 edges, 584990 markings/sec, 50 secs
lola: 18086388 markings, 52247407 edges, 505087 markings/sec, 55 secs
lola: 20648333 markings, 60228902 edges, 512389 markings/sec, 60 secs
lola: 23351823 markings, 68531916 edges, 540698 markings/sec, 65 secs
lola: 25981257 markings, 76962058 edges, 525887 markings/sec, 70 secs
lola: 28534589 markings, 85284970 edges, 510666 markings/sec, 75 secs
lola: 31199625 markings, 93773198 edges, 533007 markings/sec, 80 secs
lola: 33796685 markings, 102049927 edges, 519412 markings/sec, 85 secs
lola: 36403404 markings, 110351898 edges, 521344 markings/sec, 90 secs
lola: 39030207 markings, 118721403 edges, 525361 markings/sec, 95 secs
lola: 42024866 markings, 126885027 edges, 598932 markings/sec, 100 secs
lola: 44904726 markings, 135193768 edges, 575972 markings/sec, 105 secs
lola: 47423855 markings, 143038833 edges, 503826 markings/sec, 110 secs
lola: 49977696 markings, 151058700 edges, 510768 markings/sec, 115 secs
lola: 52507817 markings, 159105770 edges, 506024 markings/sec, 120 secs
lola: 54940703 markings, 167011561 edges, 486577 markings/sec, 125 secs
lola: 57572574 markings, 175315693 edges, 526374 markings/sec, 130 secs
lola: 60113326 markings, 183425893 edges, 508150 markings/sec, 135 secs
lola: 62718481 markings, 191624473 edges, 521031 markings/sec, 140 secs
lola: 65554381 markings, 199759011 edges, 567180 markings/sec, 145 secs
lola: 68175314 markings, 207948079 edges, 524187 markings/sec, 150 secs
lola: 70624393 markings, 216008779 edges, 489816 markings/sec, 155 secs
lola: 72987052 markings, 223695229 edges, 472532 markings/sec, 160 secs
lola: 75345643 markings, 231352636 edges, 471718 markings/sec, 165 secs
lola: 77722130 markings, 239057829 edges, 475297 markings/sec, 170 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: 78265543 markings, 240710774 edges
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-11 47 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 797 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-C0010N0000000010-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: 2795 markings, 4446 edges, 559 markings/sec, 25 secs
lola: 3899623 markings, 9529646 edges, 779366 markings/sec, 30 secs
lola: 7565815 markings, 18795902 edges, 733238 markings/sec, 35 secs
lola: 11185751 markings, 27522657 edges, 723987 markings/sec, 40 secs
lola: 14713064 markings, 35990925 edges, 705463 markings/sec, 45 secs
lola: 18255488 markings, 44793639 edges, 708485 markings/sec, 50 secs
lola: 21286971 markings, 53245496 edges, 606297 markings/sec, 55 secs
lola: 23955274 markings, 61283605 edges, 533661 markings/sec, 60 secs
lola: 26586749 markings, 69207567 edges, 526295 markings/sec, 65 secs
lola: 29249595 markings, 77246576 edges, 532569 markings/sec, 70 secs
lola: 31918454 markings, 85308793 edges, 533772 markings/sec, 75 secs
lola: 34594937 markings, 93404561 edges, 535297 markings/sec, 80 secs
lola: 37748567 markings, 101991288 edges, 630726 markings/sec, 85 secs
lola: 40522235 markings, 110329108 edges, 554734 markings/sec, 90 secs
lola: 43581465 markings, 119029933 edges, 611846 markings/sec, 95 secs
lola: 46244747 markings, 127021655 edges, 532656 markings/sec, 100 secs
lola: 49180429 markings, 135580923 edges, 587136 markings/sec, 105 secs
lola: 51688753 markings, 143634152 edges, 501665 markings/sec, 110 secs
lola: 54132367 markings, 151431946 edges, 488723 markings/sec, 115 secs
lola: 56578954 markings, 159241531 edges, 489317 markings/sec, 120 secs
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 58348953 markings, 164788918 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-12 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FBP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FBP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 2053451 markings, 5847570 edges, 410690 markings/sec, 0 secs
lola: 5206396 markings, 15138418 edges, 630589 markings/sec, 5 secs
lola: 8035787 markings, 24261241 edges, 565878 markings/sec, 10 secs
lola: 10744083 markings, 33072204 edges, 541659 markings/sec, 15 secs
lola: 13380861 markings, 41998955 edges, 527356 markings/sec, 20 secs
lola: 16326443 markings, 51450942 edges, 589116 markings/sec, 25 secs
lola: 19212026 markings, 60272968 edges, 577117 markings/sec, 30 secs
lola: 22052019 markings, 68937706 edges, 567999 markings/sec, 35 secs
lola: 24872094 markings, 77522754 edges, 564015 markings/sec, 40 secs
lola: 27684728 markings, 86101011 edges, 562527 markings/sec, 45 secs
lola: 30498572 markings, 94693998 edges, 562769 markings/sec, 50 secs
lola: 33343349 markings, 103384796 edges, 568955 markings/sec, 55 secs
lola: 36197909 markings, 112275489 edges, 570912 markings/sec, 60 secs
lola: 38524429 markings, 120238226 edges, 465304 markings/sec, 65 secs
lola: 40748798 markings, 128149984 edges, 444874 markings/sec, 70 secs
lola: 43072341 markings, 136008786 edges, 464709 markings/sec, 75 secs
lola: 45406620 markings, 143909537 edges, 466856 markings/sec, 80 secs
lola: 47691412 markings, 151588330 edges, 456958 markings/sec, 85 secs
lola: 49920314 markings, 159493267 edges, 445780 markings/sec, 90 secs
lola: 52192273 markings, 167353227 edges, 454392 markings/sec, 95 secs
lola: 54333439 markings, 174876397 edges, 428233 markings/sec, 100 secs
lola: 56478875 markings, 182429522 edges, 429087 markings/sec, 105 secs
lola: 58601265 markings, 190867470 edges, 424478 markings/sec, 110 secs
lola: 60653085 markings, 199368444 edges, 410364 markings/sec, 115 secs
lola: 62718922 markings, 206678194 edges, 413167 markings/sec, 120 secs
lola: 64939427 markings, 214142437 edges, 444101 markings/sec, 125 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 65642091 markings, 216428084 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-13 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1464 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-C0010N0000000010-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: 10
lola: 919088 markings, 3039932 edges, 183818 markings/sec, 0 secs
lola: 3466108 markings, 12723284 edges, 509404 markings/sec, 5 secs
lola: 6106174 markings, 22089251 edges, 528013 markings/sec, 10 secs
lola: 8320702 markings, 31561145 edges, 442906 markings/sec, 15 secs
lola: 10446333 markings, 41100554 edges, 425126 markings/sec, 20 secs
lola: 12639434 markings, 50959838 edges, 438620 markings/sec, 25 secs
lola: 14772671 markings, 60944618 edges, 426647 markings/sec, 30 secs
lola: 17262278 markings, 69702256 edges, 497921 markings/sec, 35 secs
lola: 19690962 markings, 78166172 edges, 485737 markings/sec, 40 secs
lola: 22198992 markings, 86884069 edges, 501606 markings/sec, 45 secs
lola: 24746060 markings, 95630973 edges, 509414 markings/sec, 50 secs
lola: 27029025 markings, 104838571 edges, 456593 markings/sec, 55 secs
lola: 29128111 markings, 113773651 edges, 419817 markings/sec, 60 secs
lola: 31268807 markings, 123097262 edges, 428139 markings/sec, 65 secs
lola: 33354214 markings, 132338429 edges, 417081 markings/sec, 70 secs
lola: 35591695 markings, 141688184 edges, 447496 markings/sec, 75 secs
lola: 37693376 markings, 151092849 edges, 420336 markings/sec, 80 secs
lola: 39591796 markings, 159680663 edges, 379684 markings/sec, 85 secs
lola: 41535251 markings, 168136361 edges, 388691 markings/sec, 90 secs
lola: 43330597 markings, 177261920 edges, 359069 markings/sec, 95 secs
lola: 45304500 markings, 185683273 edges, 394781 markings/sec, 100 secs
lola: 47279426 markings, 193927224 edges, 394985 markings/sec, 105 secs
lola: 49266660 markings, 202150992 edges, 397447 markings/sec, 110 secs
lola: 51262238 markings, 210409448 edges, 399116 markings/sec, 115 secs
lola: 53249029 markings, 218634422 edges, 397358 markings/sec, 120 secs
lola: 55286539 markings, 226900944 edges, 407502 markings/sec, 125 secs
lola: 57077815 markings, 236135457 edges, 358255 markings/sec, 130 secs
lola: 58794915 markings, 244864131 edges, 343420 markings/sec, 135 secs
lola: 60518726 markings, 253587187 edges, 344762 markings/sec, 140 secs
lola: 62311310 markings, 262735137 edges, 358517 markings/sec, 145 secs
lola: 64044105 markings, 271826367 edges, 346559 markings/sec, 150 secs
lola: 65841753 markings, 280865633 edges, 359530 markings/sec, 155 secs
lola: 67860980 markings, 290645151 edges, 403845 markings/sec, 160 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 69279022 markings, 298022220 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-0 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2760 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-C0010N0000000010-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 232 markings, 231 edges
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-15 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 10 10 20 70 2 36 20 2 40 2 10 47 70 4 20 10
lola:
preliminary result: 10 10 20 70 2 36 20 2 40 2 10 47 70 4 20 10
lola: ========================================
lola: memory consumption: 18568 KB
lola: time consumption: 810 seconds
BK_STOP 1526716282651
--------------------
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-C0010N0000000010"
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-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 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-C0010N0000000010, 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-152649998300282"
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 '
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 ;