About the Execution of LoLA for QuasiCertifProtocol-COL-10
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 244K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K 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 6.4K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K 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.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 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700023
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526909033479
info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-COL-10 @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17600
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-UpperBounds.task
lola: MAX(p48) : MAX(p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338) : MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470) : MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470) : MAX(p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p117 + p128 + p139 + p150 + p161 + p172 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p116 + p115 + p114 + p113 + p112 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504) : MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) : MAX(p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503) : MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504) : MAX(p1) : MAX(p337) : MAX(p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p60) : MAX(p349) : MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) : MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p48)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p48)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 15 markings, 14 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 3 markings, 2 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p337)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p337)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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 QuasiCertifProtocol-COL-10-UpperBounds-11 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(p349)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p349)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 2 markings, 1 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)
lola: processed formula length: 68
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 50 markings, 49 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-7 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-8 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 26 markings, 25 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-9 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 61 markings, 60 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-1 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 13 markings, 12 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-4 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p60)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p60)
lola: processed formula length: 68
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 26 markings, 25 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-12 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 26 markings, 25 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-6 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)
lola: processed formula length: 68
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 50 markings, 49 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-14 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: processed formula length: 849
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 61 markings, 60 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-3 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: processed formula length: 849
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 61 markings, 60 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-2 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p117 + p128 + p139 + p150 + p161 + p172 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p117 + p128 + p139 + p150 + p161 + p172 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141... (shortened)
lola: processed formula length: 811
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 83 markings, 82 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-5 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400... (shortened)
lola: processed formula length: 849
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 61 markings, 60 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-UpperBounds-15 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 11 121 121 11 121 11 11 11 11 1 1 11 1 11 121
lola:
preliminary result: 1 11 121 121 11 121 11 11 11 11 1 1 11 1 11 121
lola: memory consumption: 19148 KB
lola: time consumption: 21 seconds
BK_STOP 1526909074853
--------------------
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="QuasiCertifProtocol-COL-10"
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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 QuasiCertifProtocol-COL-10, 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 r136-qhx2-152673578700023"
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 ;