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.9M
-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 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.9K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCround-PT-11b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735200121
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526659961748

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCround-PT-11b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DLCround-PT-11b formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ DLCround-PT-11b @ 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: 11366/65536 symbol table entries, 3163 collisions
lola: preprocessing...
lola: Size of bit vector: 4375
lola: finding significant places
lola: 4375 places, 6991 transitions, 4131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10066 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-11b-UpperBounds.task
lola: MAX(p12) : MAX(p2412) : MAX(p3649) : MAX(p408) : MAX(p1437) : MAX(p1664) : MAX(p219) : MAX(p2018) : MAX(p412) : MAX(p3415) : MAX(p2063) : MAX(p3777) : MAX(p4255) : MAX(p2988) : MAX(p425) : MAX(p692)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p12)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 13 markings, 12 edges

FORMULA DLCround-PT-11b-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2412)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2412)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 227 markings, 226 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-1 1 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(p3649)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3649)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 126 markings, 125 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-2 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p408)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p408)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 14978 markings, 18308 edges, 2996 markings/sec, 0 secs
lola: 35349 markings, 44864 edges, 4074 markings/sec, 5 secs
lola: 56061 markings, 70922 edges, 4142 markings/sec, 10 secs
lola: 74915 markings, 95097 edges, 3771 markings/sec, 15 secs
lola: 93507 markings, 118819 edges, 3718 markings/sec, 20 secs
lola: 111998 markings, 142688 edges, 3698 markings/sec, 25 secs
lola: 131437 markings, 166223 edges, 3888 markings/sec, 30 secs
lola: 151035 markings, 189803 edges, 3920 markings/sec, 35 secs
lola: 169881 markings, 213274 edges, 3769 markings/sec, 40 secs
lola: 188567 markings, 237113 edges, 3737 markings/sec, 45 secs
lola: 207204 markings, 261040 edges, 3727 markings/sec, 50 secs
lola: 225697 markings, 284959 edges, 3699 markings/sec, 55 secs
lola: 244253 markings, 308703 edges, 3711 markings/sec, 60 secs
lola: 262761 markings, 332873 edges, 3702 markings/sec, 65 secs
lola: 281383 markings, 357860 edges, 3724 markings/sec, 70 secs
lola: 299944 markings, 381840 edges, 3712 markings/sec, 75 secs
lola: 318532 markings, 406457 edges, 3718 markings/sec, 80 secs
lola: 337028 markings, 431705 edges, 3699 markings/sec, 85 secs
lola: 356538 markings, 457070 edges, 3902 markings/sec, 90 secs
lola: 376643 markings, 483583 edges, 4021 markings/sec, 95 secs
lola: 396716 markings, 509660 edges, 4015 markings/sec, 100 secs
lola: 416867 markings, 535712 edges, 4030 markings/sec, 105 secs
lola: 436254 markings, 561001 edges, 3877 markings/sec, 110 secs
lola: 455565 markings, 586819 edges, 3862 markings/sec, 115 secs
lola: 474504 markings, 611862 edges, 3788 markings/sec, 120 secs
lola: 494063 markings, 637431 edges, 3912 markings/sec, 125 secs
lola: 513924 markings, 663146 edges, 3972 markings/sec, 130 secs
lola: 533605 markings, 688762 edges, 3936 markings/sec, 135 secs
lola: 553227 markings, 714466 edges, 3924 markings/sec, 140 secs
lola: 572624 markings, 740549 edges, 3879 markings/sec, 145 secs
lola: 591752 markings, 766368 edges, 3826 markings/sec, 150 secs
lola: 610512 markings, 791235 edges, 3752 markings/sec, 155 secs
lola: 629685 markings, 816407 edges, 3835 markings/sec, 160 secs
lola: 648532 markings, 841537 edges, 3769 markings/sec, 165 secs
lola: 668129 markings, 868211 edges, 3919 markings/sec, 170 secs
lola: 687070 markings, 897107 edges, 3788 markings/sec, 175 secs
lola: 706933 markings, 924833 edges, 3973 markings/sec, 180 secs
lola: 726028 markings, 949392 edges, 3819 markings/sec, 185 secs
lola: 746279 markings, 975648 edges, 4050 markings/sec, 190 secs
lola: 766147 markings, 1001288 edges, 3974 markings/sec, 195 secs
lola: 785815 markings, 1026867 edges, 3934 markings/sec, 200 secs
lola: 805314 markings, 1052051 edges, 3900 markings/sec, 205 secs
lola: 824970 markings, 1077970 edges, 3931 markings/sec, 210 secs
lola: 844799 markings, 1105321 edges, 3966 markings/sec, 215 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 846889 markings, 1108318 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1437)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1437)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 131 markings, 130 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1664)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1664)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 28 markings, 27 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-5 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p219)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p219)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 20 markings, 19 edges

FORMULA DLCround-PT-11b-UpperBounds-6 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2018)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2018)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 152 markings, 151 edges

FORMULA DLCround-PT-11b-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p412)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p412)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 15594 markings, 19072 edges, 3119 markings/sec, 0 secs
lola: 36406 markings, 46172 edges, 4162 markings/sec, 5 secs
lola: 57886 markings, 73280 edges, 4296 markings/sec, 10 secs
lola: 77169 markings, 97929 edges, 3857 markings/sec, 15 secs
lola: 96337 markings, 122522 edges, 3834 markings/sec, 20 secs
lola: 115447 markings, 147183 edges, 3822 markings/sec, 25 secs
lola: 135793 markings, 171426 edges, 4069 markings/sec, 30 secs
lola: 155973 markings, 195705 edges, 4036 markings/sec, 35 secs
lola: 175224 markings, 220092 edges, 3850 markings/sec, 40 secs
lola: 194526 markings, 244540 edges, 3860 markings/sec, 45 secs
lola: 213725 markings, 269406 edges, 3840 markings/sec, 50 secs
lola: 232837 markings, 294053 edges, 3822 markings/sec, 55 secs
lola: 252043 markings, 318980 edges, 3841 markings/sec, 60 secs
lola: 271244 markings, 344122 edges, 3840 markings/sec, 65 secs
lola: 290432 markings, 369432 edges, 3838 markings/sec, 70 secs
lola: 309469 markings, 394856 edges, 3807 markings/sec, 75 secs
lola: 328760 markings, 420204 edges, 3858 markings/sec, 80 secs
lola: 348238 markings, 446247 edges, 3896 markings/sec, 85 secs
lola: 368972 markings, 473677 edges, 4147 markings/sec, 90 secs
lola: 389628 markings, 500507 edges, 4131 markings/sec, 95 secs
lola: 410363 markings, 527197 edges, 4147 markings/sec, 100 secs
lola: 430512 markings, 553680 edges, 4030 markings/sec, 105 secs
lola: 450713 markings, 580625 edges, 4040 markings/sec, 110 secs
lola: 470359 markings, 606198 edges, 3929 markings/sec, 115 secs
lola: 490200 markings, 632578 edges, 3968 markings/sec, 120 secs
lola: 510790 markings, 659115 edges, 4118 markings/sec, 125 secs
lola: 531377 markings, 685842 edges, 4117 markings/sec, 130 secs
lola: 551572 markings, 712196 edges, 4039 markings/sec, 135 secs
lola: 571595 markings, 739190 edges, 4005 markings/sec, 140 secs
lola: 591343 markings, 765795 edges, 3950 markings/sec, 145 secs
lola: 610656 markings, 791409 edges, 3863 markings/sec, 150 secs
lola: 630506 markings, 817602 edges, 3970 markings/sec, 155 secs
lola: 650050 markings, 843456 edges, 3909 markings/sec, 160 secs
lola: 670136 markings, 871035 edges, 4017 markings/sec, 165 secs
lola: 689441 markings, 900227 edges, 3861 markings/sec, 170 secs
lola: 709897 markings, 928522 edges, 4091 markings/sec, 175 secs
lola: 729893 markings, 954450 edges, 3999 markings/sec, 180 secs
lola: 750636 markings, 981421 edges, 4149 markings/sec, 185 secs
lola: 771193 markings, 1007634 edges, 4111 markings/sec, 190 secs
lola: 791226 markings, 1033618 edges, 4007 markings/sec, 195 secs
lola: 811612 markings, 1060266 edges, 4077 markings/sec, 200 secs
lola: 831966 markings, 1087494 edges, 4071 markings/sec, 205 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 846885 markings, 1108314 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3415)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3415)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 98 markings, 97 edges

FORMULA DLCround-PT-11b-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2063)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2063)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 197 markings, 196 edges

FORMULA DLCround-PT-11b-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3777)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3777)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 298 markings, 297 edges

FORMULA DLCround-PT-11b-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p4255)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p4255)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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
lola:
FORMULA DLCround-PT-11b-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2988)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2988)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 145 markings, 144 edges

FORMULA DLCround-PT-11b-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p425)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p425)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 18 markings, 17 edges
lola: ========================================

FORMULA DLCround-PT-11b-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p692)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p692)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-11b-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: 33 markings, 32 edges

FORMULA DLCround-PT-11b-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 27288 KB
lola: time consumption: 464 seconds

BK_STOP 1526660426342

--------------------
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="DLCround-PT-11b"
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/DLCround-PT-11b.tgz
mv DLCround-PT-11b 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 DLCround-PT-11b, 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 r064-smll-152649735200121"
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 ;