Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326000019.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326000019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 20K Feb 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 8 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 303K Feb 8 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 12K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 295K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 251K Feb 1 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 952K Feb 1 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552861592964

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-PT-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ PhilosophersDyn-PT-10 @ 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: 2480/65536 symbol table entries, 65 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-10-UpperBounds.task
lola: MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) : MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1) : MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) : MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9) : MAX(WaitRight_5) : MAX(Neighbourhood_3_9) : MAX(HasLeft_5) : MAX(Neighbourhood_3_6) : MAX(HasLeft_4) : MAX(Neighbourhood_1_8) : MAX(Neighbourhood_2_6) : MAX(Neighbourhood_6_7)
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(WaitRight_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitRight_5)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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 PhilosophersDyn-PT-10-UpperBounds-8 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(Neighbourhood_3_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_3_9)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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 PhilosophersDyn-PT-10-UpperBounds-9 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(HasLeft_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_5)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 4 markings, 3 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_3_6)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 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: 12721 markings, 26293 edges, 2544 markings/sec, 30 secs
lola: 25055 markings, 55029 edges, 2467 markings/sec, 35 secs
lola: 37521 markings, 85258 edges, 2493 markings/sec, 40 secs
lola: 49746 markings, 113387 edges, 2445 markings/sec, 45 secs
lola: 61840 markings, 142490 edges, 2419 markings/sec, 50 secs
lola: 74018 markings, 170071 edges, 2436 markings/sec, 55 secs
lola: 86452 markings, 200016 edges, 2487 markings/sec, 60 secs
lola: 98640 markings, 229804 edges, 2438 markings/sec, 65 secs
lola: 110957 markings, 261415 edges, 2463 markings/sec, 70 secs
lola: 123154 markings, 292964 edges, 2439 markings/sec, 75 secs
lola: 135276 markings, 322094 edges, 2424 markings/sec, 80 secs
lola: 147614 markings, 350276 edges, 2468 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 153978 markings, 364764 edges
lola: ========================================

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

FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_1_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_1_8)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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

FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_2_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_2_6)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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

FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_6_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_6_7)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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 PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: processed formula length: 103
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 9271 markings, 20380 edges, 1854 markings/sec, 0 secs
lola: 22271 markings, 47967 edges, 2600 markings/sec, 5 secs
lola: 35231 markings, 77119 edges, 2592 markings/sec, 10 secs
lola: 48052 markings, 106479 edges, 2564 markings/sec, 15 secs
lola: 60749 markings, 136768 edges, 2539 markings/sec, 20 secs
lola: 73428 markings, 166198 edges, 2536 markings/sec, 25 secs
lola: 86297 markings, 197662 edges, 2574 markings/sec, 30 secs
lola: 98552 markings, 230106 edges, 2451 markings/sec, 35 secs
lola: 110996 markings, 261485 edges, 2489 markings/sec, 40 secs
lola: 123538 markings, 293836 edges, 2508 markings/sec, 45 secs
lola: 136223 markings, 325094 edges, 2537 markings/sec, 50 secs
lola: 148996 markings, 356185 edges, 2555 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 154195 markings, 369030 edges
lola:
FORMULA PhilosophersDyn-PT-10-UpperBounds-0 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Think_10 + Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9)
lola: processed formula length: 103
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 9908 markings, 21675 edges, 1982 markings/sec, 0 secs
lola: 23029 markings, 49594 edges, 2624 markings/sec, 5 secs
lola: 35634 markings, 78049 edges, 2521 markings/sec, 10 secs
lola: 48444 markings, 107375 edges, 2562 markings/sec, 15 secs
lola: 61247 markings, 137942 edges, 2561 markings/sec, 20 secs
lola: 74063 markings, 167594 edges, 2563 markings/sec, 25 secs
lola: 86869 markings, 199066 edges, 2561 markings/sec, 30 secs
lola: 99576 markings, 232892 edges, 2541 markings/sec, 35 secs
lola: 112084 markings, 264325 edges, 2502 markings/sec, 40 secs
lola: 124782 markings, 296999 edges, 2540 markings/sec, 45 secs
lola: 137561 markings, 328116 edges, 2556 markings/sec, 50 secs
lola: 150360 markings, 359232 edges, 2560 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 154195 markings, 369030 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-1 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 11603 markings, 30720 edges, 2321 markings/sec, 0 secs
lola: 23736 markings, 63399 edges, 2427 markings/sec, 5 secs
lola: 36099 markings, 97066 edges, 2473 markings/sec, 10 secs
lola: 48383 markings, 131934 edges, 2457 markings/sec, 15 secs
lola: 59579 markings, 164132 edges, 2239 markings/sec, 20 secs
lola: 71791 markings, 199963 edges, 2442 markings/sec, 25 secs
lola: 83832 markings, 236083 edges, 2408 markings/sec, 30 secs
lola: 96034 markings, 272723 edges, 2440 markings/sec, 35 secs
lola: 108021 markings, 308443 edges, 2397 markings/sec, 40 secs
lola: 120019 markings, 344082 edges, 2400 markings/sec, 45 secs
lola: 131962 markings, 379128 edges, 2389 markings/sec, 50 secs
lola: 144138 markings, 416173 edges, 2435 markings/sec, 55 secs
lola: 156090 markings, 453168 edges, 2390 markings/sec, 60 secs
lola: 167820 markings, 489676 edges, 2346 markings/sec, 65 secs
lola: 179776 markings, 526872 edges, 2391 markings/sec, 70 secs
lola: 191665 markings, 563850 edges, 2378 markings/sec, 75 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-2 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: processed formula length: 103
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 10679 markings, 23060 edges, 2136 markings/sec, 0 secs
lola: 23541 markings, 50461 edges, 2572 markings/sec, 5 secs
lola: 36225 markings, 79873 edges, 2537 markings/sec, 10 secs
lola: 48726 markings, 107947 edges, 2500 markings/sec, 15 secs
lola: 61083 markings, 137424 edges, 2471 markings/sec, 20 secs
lola: 73403 markings, 165941 edges, 2464 markings/sec, 25 secs
lola: 85796 markings, 196307 edges, 2479 markings/sec, 30 secs
lola: 98122 markings, 228343 edges, 2465 markings/sec, 35 secs
lola: 110412 markings, 258864 edges, 2458 markings/sec, 40 secs
lola: 122736 markings, 290489 edges, 2465 markings/sec, 45 secs
lola: 135245 markings, 321473 edges, 2502 markings/sec, 50 secs
lola: 147679 markings, 351398 edges, 2487 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 154009 markings, 367022 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-3 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Forks_9 + Forks_8 + Forks_7 + Forks_6 + Forks_10 + Forks_5 + Forks_4 + Forks_3 + Forks_2 + Forks_1)
lola: processed formula length: 103
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 10720 markings, 23147 edges, 2144 markings/sec, 0 secs
lola: 23627 markings, 50655 edges, 2581 markings/sec, 5 secs
lola: 36069 markings, 79389 edges, 2488 markings/sec, 10 secs
lola: 47799 markings, 105514 edges, 2346 markings/sec, 15 secs
lola: 59957 markings, 135039 edges, 2432 markings/sec, 20 secs
lola: 72049 markings, 162959 edges, 2418 markings/sec, 25 secs
lola: 84288 markings, 192587 edges, 2448 markings/sec, 30 secs
lola: 95649 markings, 221944 edges, 2272 markings/sec, 35 secs
lola: 107991 markings, 253193 edges, 2468 markings/sec, 40 secs
lola: 120376 markings, 284756 edges, 2477 markings/sec, 45 secs
lola: 131896 markings, 313910 edges, 2304 markings/sec, 50 secs
lola: 144347 markings, 343996 edges, 2490 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 154009 markings, 367022 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1036 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 12341 markings, 32468 edges, 2468 markings/sec, 0 secs
lola: 24287 markings, 64691 edges, 2389 markings/sec, 5 secs
lola: 36510 markings, 98693 edges, 2445 markings/sec, 10 secs
lola: 48875 markings, 133231 edges, 2473 markings/sec, 15 secs
lola: 60881 markings, 169269 edges, 2401 markings/sec, 20 secs
lola: 72801 markings, 202741 edges, 2384 markings/sec, 25 secs
lola: 84055 markings, 236683 edges, 2251 markings/sec, 30 secs
lola: 95299 markings, 270959 edges, 2249 markings/sec, 35 secs
lola: 106595 markings, 303169 edges, 2259 markings/sec, 40 secs
lola: 118513 markings, 338962 edges, 2384 markings/sec, 45 secs
lola: 130531 markings, 375128 edges, 2404 markings/sec, 50 secs
lola: 142541 markings, 411728 edges, 2402 markings/sec, 55 secs
lola: 153711 markings, 446955 edges, 2234 markings/sec, 60 secs
lola: 164831 markings, 480131 edges, 2224 markings/sec, 65 secs
lola: 175898 markings, 514756 edges, 2213 markings/sec, 70 secs
lola: 187559 markings, 551138 edges, 2332 markings/sec, 75 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)
lola: processed formula length: 133
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 11205 markings, 29250 edges, 2241 markings/sec, 0 secs
lola: 24054 markings, 65466 edges, 2570 markings/sec, 5 secs
lola: 36920 markings, 101969 edges, 2573 markings/sec, 10 secs
lola: 49138 markings, 139445 edges, 2444 markings/sec, 15 secs
lola: 61399 markings, 175694 edges, 2452 markings/sec, 20 secs
lola: 73397 markings, 212964 edges, 2400 markings/sec, 25 secs
lola: 85558 markings, 249761 edges, 2432 markings/sec, 30 secs
lola: 97998 markings, 288128 edges, 2488 markings/sec, 35 secs
lola: 110190 markings, 326403 edges, 2438 markings/sec, 40 secs
lola: 122447 markings, 364607 edges, 2451 markings/sec, 45 secs
lola: 134827 markings, 402250 edges, 2476 markings/sec, 50 secs
lola: 147028 markings, 440125 edges, 2440 markings/sec, 55 secs
lola: 159062 markings, 477326 edges, 2407 markings/sec, 60 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481027 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-6 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 2960 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitLeft_10 + WaitLeft_1 + WaitLeft_2 + WaitLeft_3 + WaitLeft_4 + WaitLeft_5 + WaitLeft_6 + WaitLeft_7 + WaitLeft_8 + WaitLeft_9)
lola: processed formula length: 133
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-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: 10
lola: 10577 markings, 27821 edges, 2115 markings/sec, 0 secs
lola: 23323 markings, 63594 edges, 2549 markings/sec, 5 secs
lola: 36256 markings, 100202 edges, 2587 markings/sec, 10 secs
lola: 48736 markings, 138481 edges, 2496 markings/sec, 15 secs
lola: 61101 markings, 174904 edges, 2473 markings/sec, 20 secs
lola: 73395 markings, 212960 edges, 2459 markings/sec, 25 secs
lola: 85742 markings, 250639 edges, 2469 markings/sec, 30 secs
lola: 98153 markings, 288555 edges, 2482 markings/sec, 35 secs
lola: 110620 markings, 327447 edges, 2493 markings/sec, 40 secs
lola: 123049 markings, 366147 edges, 2486 markings/sec, 45 secs
lola: 135381 markings, 404931 edges, 2466 markings/sec, 50 secs
lola: 147685 markings, 441941 edges, 2461 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481027 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-7 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 4 4 2 2 2 2 4 4 1 1 1 1 1 1 1 1
lola:
preliminary result: 4 4 2 2 2 2 4 4 1 1 1 1 1 1 1 1
lola: memory consumption: 33316 KB
lola: time consumption: 674 seconds

BK_STOP 1552862267459

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is PhilosophersDyn-PT-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 r121-smll-155272326000019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;