fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r055-oct2-155234418600148
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for DLCround-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
904.320 251203.00 261779.00 37.50 1 1 1 1 1 ? 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r055-oct2-155234418600148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is DLCround-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-oct2-155234418600148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 3.3K Feb 10 06:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 06:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 05:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 6 05:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 2 22:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 2 22:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 30 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 30 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col

-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.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 DLCround-PT-10b-UpperBounds-00
FORMULA_NAME DLCround-PT-10b-UpperBounds-01
FORMULA_NAME DLCround-PT-10b-UpperBounds-02
FORMULA_NAME DLCround-PT-10b-UpperBounds-03
FORMULA_NAME DLCround-PT-10b-UpperBounds-04
FORMULA_NAME DLCround-PT-10b-UpperBounds-05
FORMULA_NAME DLCround-PT-10b-UpperBounds-06
FORMULA_NAME DLCround-PT-10b-UpperBounds-07
FORMULA_NAME DLCround-PT-10b-UpperBounds-08
FORMULA_NAME DLCround-PT-10b-UpperBounds-09
FORMULA_NAME DLCround-PT-10b-UpperBounds-10
FORMULA_NAME DLCround-PT-10b-UpperBounds-11
FORMULA_NAME DLCround-PT-10b-UpperBounds-12
FORMULA_NAME DLCround-PT-10b-UpperBounds-13
FORMULA_NAME DLCround-PT-10b-UpperBounds-14
FORMULA_NAME DLCround-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552699652276

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCround-PT-10b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DLCround-PT-10b formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ DLCround-PT-10b @ 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: 10116/65536 symbol table entries, 2628 collisions
lola: preprocessing...
lola: Size of bit vector: 3924
lola: finding significant places
lola: 3924 places, 6192 transitions, 3711 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8844 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-10b-UpperBounds.task
lola: MAX(p2281) : MAX(p1605) : MAX(p2787) : MAX(p736) : MAX(p2326) : MAX(p332) : MAX(p3553) : MAX(p449) : MAX(p3844) : MAX(p2093) : MAX(p1621) : MAX(p1653) : MAX(p3248) : MAX(p1922) : MAX(p1548) : MAX(p3913)
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(p2281)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2281)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-10b-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: 211 markings, 210 edges
lola: ========================================

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

FORMULA DLCround-PT-10b-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(p2787)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2787)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file DLCround-PT-10b-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: 120 markings, 119 edges
lola: ========================================

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

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

FORMULA DLCround-PT-10b-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p332)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p332)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file DLCround-PT-10b-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: 41633 markings, 53481 edges, 8327 markings/sec, 0 secs
lola: 90353 markings, 116663 edges, 9744 markings/sec, 5 secs
lola: 138966 markings, 180891 edges, 9723 markings/sec, 10 secs
lola: 186636 markings, 244411 edges, 9534 markings/sec, 15 secs
lola: 233507 markings, 305434 edges, 9374 markings/sec, 20 secs
lola: 280107 markings, 366791 edges, 9320 markings/sec, 25 secs
lola: 326550 markings, 427776 edges, 9289 markings/sec, 30 secs
lola: 373338 markings, 490921 edges, 9358 markings/sec, 35 secs
lola: 418084 markings, 551107 edges, 8949 markings/sec, 40 secs
lola: 463390 markings, 611237 edges, 9061 markings/sec, 45 secs
lola: 508321 markings, 671933 edges, 8986 markings/sec, 50 secs
lola: 552960 markings, 729841 edges, 8928 markings/sec, 55 secs
lola: 597831 markings, 790006 edges, 8974 markings/sec, 60 secs
lola: 642438 markings, 849275 edges, 8921 markings/sec, 65 secs
lola: 686782 markings, 908183 edges, 8869 markings/sec, 70 secs
lola: 731522 markings, 966877 edges, 8948 markings/sec, 75 secs
lola: 776249 markings, 1026255 edges, 8945 markings/sec, 80 secs
lola: 821328 markings, 1084774 edges, 9016 markings/sec, 85 secs
lola: 867113 markings, 1143780 edges, 9157 markings/sec, 90 secs
lola: 912871 markings, 1203672 edges, 9152 markings/sec, 95 secs
lola: 958386 markings, 1263621 edges, 9103 markings/sec, 100 secs
lola: 1003987 markings, 1325410 edges, 9120 markings/sec, 105 secs
lola: 1049841 markings, 1386207 edges, 9171 markings/sec, 110 secs
lola: 1095803 markings, 1448100 edges, 9192 markings/sec, 115 secs
lola: 1141684 markings, 1511473 edges, 9176 markings/sec, 120 secs
lola: 1188557 markings, 1574728 edges, 9375 markings/sec, 125 secs
lola: 1236167 markings, 1640632 edges, 9522 markings/sec, 130 secs
lola: 1283768 markings, 1704274 edges, 9520 markings/sec, 135 secs
lola: 1330732 markings, 1768259 edges, 9393 markings/sec, 140 secs
lola: 1375890 markings, 1828723 edges, 9032 markings/sec, 145 secs
lola: 1422083 markings, 1890203 edges, 9239 markings/sec, 150 secs
lola: 1467650 markings, 1951190 edges, 9113 markings/sec, 155 secs
lola: 1514908 markings, 2013584 edges, 9452 markings/sec, 160 secs
lola: 1562134 markings, 2076322 edges, 9445 markings/sec, 165 secs
lola: 1608008 markings, 2136327 edges, 9175 markings/sec, 170 secs
lola: 1655111 markings, 2198577 edges, 9421 markings/sec, 175 secs
lola: 1701626 markings, 2259363 edges, 9303 markings/sec, 180 secs
lola: 1749262 markings, 2322905 edges, 9527 markings/sec, 185 secs
lola: 1797442 markings, 2389236 edges, 9636 markings/sec, 190 secs
lola: 1845644 markings, 2453368 edges, 9640 markings/sec, 195 secs
lola: 1893022 markings, 2517890 edges, 9476 markings/sec, 200 secs
lola: 1939015 markings, 2579049 edges, 9199 markings/sec, 205 secs
lola: 1984887 markings, 2640212 edges, 9174 markings/sec, 210 secs
lola: 2029703 markings, 2699523 edges, 8963 markings/sec, 215 secs
lola: 2076638 markings, 2760698 edges, 9387 markings/sec, 220 secs
lola: 2123319 markings, 2822543 edges, 9336 markings/sec, 225 secs
lola: 2169526 markings, 2883881 edges, 9241 markings/sec, 230 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2183447 markings, 2901318 edges

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

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

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

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

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

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

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

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

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

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

FORMULA DLCround-PT-10b-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: memory consumption: 26052 KB
lola: time consumption: 251 seconds

BK_STOP 1552699903479

--------------------
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="DLCround-PT-10b"
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-3954"
echo " Executing tool win2018"
echo " Input is DLCround-PT-10b, 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 r055-oct2-155234418600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10b.tgz
mv DLCround-PT-10b 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 ;