About the Execution of 2018-Gold for GPPP-PT-C0010N0000000100
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r088-csrt-155246565800124.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 GPPP-PT-C0010N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246565800124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.6K Feb 11 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 7 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jan 31 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 01:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1552863858954
info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0010N0000000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0010N0000000100 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C0010N0000000100 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0010N0000000100-UpperBounds.task
lola: LP says that atomic proposition is always false: (GSSG <= 0)
lola: LP says that atomic proposition is always false: (ATP <= 0)
lola: MAX(Xu5P) : MAX(Pyr) : MAX(_1_3_BPG) : MAX(DHAP) : MAX(a2) : MAX(Ru5P) : MAX(a1) : MAX(c2) : MAX(a2) : MAX(R5P) : MAX(start) : MAX(_2PG) : MAX(GSSG) : MAX(FBP) : MAX(ATP) : MAX(G6P)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSSG)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 2826 markings, 4264 edges, 565 markings/sec, 25 secs
lola: 4257794 markings, 6500066 edges, 850994 markings/sec, 30 secs
lola: 8237579 markings, 12565541 edges, 795957 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 12291033 markings, 18682920 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-12 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 5579 markings, 16485 edges, 1116 markings/sec, 25 secs
lola: 2751654 markings, 7825852 edges, 549215 markings/sec, 30 secs
lola: 5175515 markings, 15188486 edges, 484772 markings/sec, 35 secs
lola: 7392810 markings, 22237766 edges, 443459 markings/sec, 40 secs
lola: 9503813 markings, 29010997 edges, 422201 markings/sec, 45 secs
lola: 11810890 markings, 35749282 edges, 461415 markings/sec, 50 secs
lola: 13810393 markings, 42113067 edges, 399901 markings/sec, 55 secs
lola: 15895195 markings, 48775554 edges, 416960 markings/sec, 60 secs
lola: 18246838 markings, 55961999 edges, 470329 markings/sec, 65 secs
lola: SUBRESULT
lola: result: 407
lola: produced by: state space
lola: The maximum value of the given expression is 407
lola: 20115724 markings, 61975584 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-14 407 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(_1_3_BPG)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 122 markings, 121 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-2 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DHAP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(DHAP)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 10
lola: 560910 markings, 1722384 edges, 112182 markings/sec, 5 secs
lola: 2529275 markings, 8196587 edges, 393673 markings/sec, 10 secs
lola: 4631311 markings, 14377760 edges, 420407 markings/sec, 15 secs
lola: 6743708 markings, 21239671 edges, 422479 markings/sec, 20 secs
lola: 8507513 markings, 28038352 edges, 352761 markings/sec, 25 secs
lola: 10252970 markings, 34502204 edges, 349091 markings/sec, 30 secs
lola: 12157052 markings, 41218395 edges, 380816 markings/sec, 35 secs
lola: 13980633 markings, 48169030 edges, 364716 markings/sec, 40 secs
lola: 15770757 markings, 55113023 edges, 358025 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 16571270 markings, 58310910 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 14345 markings, 24246 edges, 2869 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 476486 markings, 914865 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-4 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ru5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ru5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 39
lola: 2709164 markings, 6788562 edges, 541833 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 38
lola: produced by: state space
lola: The maximum value of the given expression is 38
lola: 4300145 markings, 10692032 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-5 38 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-6 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 47475 markings, 120746 edges, 9495 markings/sec, 25 secs
lola: 2588414 markings, 6739442 edges, 508188 markings/sec, 30 secs
lola: 5141688 markings, 13057106 edges, 510655 markings/sec, 35 secs
lola: 7361855 markings, 19669777 edges, 444033 markings/sec, 40 secs
lola: 9752358 markings, 26705290 edges, 478101 markings/sec, 45 secs
lola: 12174720 markings, 33885594 edges, 484472 markings/sec, 50 secs
lola: 14465240 markings, 40947729 edges, 458104 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 70
lola: produced by: state space
lola: The maximum value of the given expression is 70
lola: 15311708 markings, 43614195 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-7 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 7554 markings, 11505 edges, 1511 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 476486 markings, 914865 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-8 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(R5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R5P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 70 markings, 69 edges
lola: ========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(start)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(start)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-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: 0 markings, 0 edges
lola:
========================================
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_2PG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(_2PG)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 142 markings, 141 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-11 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Xu5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Xu5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 38
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 476486 markings, 914865 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-0 36 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FBP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FBP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 2088016 markings, 7205588 edges, 417603 markings/sec, 0 secs
lola: 4074155 markings, 14135125 edges, 397228 markings/sec, 5 secs
lola: 6093268 markings, 21066276 edges, 403823 markings/sec, 10 secs
lola: 8059609 markings, 27866171 edges, 393268 markings/sec, 15 secs
lola: 10133249 markings, 34768428 edges, 414728 markings/sec, 20 secs
lola: 12239173 markings, 41725366 edges, 421185 markings/sec, 25 secs
lola: 14344044 markings, 48684698 edges, 420974 markings/sec, 30 secs
lola: 16485131 markings, 55714572 edges, 428217 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 17249703 markings, 58211545 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-13 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Pyr)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Pyr)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 162 markings, 161 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3160 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(G6P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(G6P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 42 markings, 41 edges
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-15 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 36 10 10 10 20 38 20 70 20 2 1 10 100 4 407 40
lola:
preliminary result: 36 10 10 10 20 38 20 70 20 2 1 10 100 4 407 40
lola: ========================================
lola: memory consumption: 18244 KB
lola: time consumption: 409 seconds
BK_STOP 1552864268331
--------------------
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="GPPP-PT-C0010N0000000100"
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 GPPP-PT-C0010N0000000100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-155246565800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 '
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 ;